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-c17473d-m [2018-02-04 12:39:21,382 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:39:21,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:39:21,395 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:39:21,395 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:39:21,396 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:39:21,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:39:21,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:39:21,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:39:21,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:39:21,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:39:21,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:39:21,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:39:21,404 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:39:21,405 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:39:21,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:39:21,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:39:21,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:39:21,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:39:21,412 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:39:21,414 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:39:21,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:39:21,414 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:39:21,415 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:39:21,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:39:21,417 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:39:21,417 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:39:21,418 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:39:21,418 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:39:21,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:39:21,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:39:21,419 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-04 12:39:21,428 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:39:21,429 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:39:21,430 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:39:21,430 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:39:21,430 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:39:21,430 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:39:21,430 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:39:21,430 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:39:21,431 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:39:21,431 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:39:21,431 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:39:21,431 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:39:21,431 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:39:21,431 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:39:21,431 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:39:21,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:39:21,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:39:21,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:39:21,432 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:39:21,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:39:21,432 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:39:21,433 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:39:21,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:39:21,433 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:39:21,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:39:21,475 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:39:21,478 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:39:21,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:39:21,480 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:39:21,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0134_true-valid-memsafety.i [2018-02-04 12:39:21,621 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:39:21,622 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:39:21,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:39:21,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:39:21,626 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:39:21,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:39:21" (1/1) ... [2018-02-04 12:39:21,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7dd1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:39:21, skipping insertion in model container [2018-02-04 12:39:21,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:39:21" (1/1) ... [2018-02-04 12:39:21,638 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:39:21,665 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:39:21,761 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:39:21,780 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:39:21,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:39:21 WrapperNode [2018-02-04 12:39:21,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:39:21,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:39:21,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:39:21,790 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:39:21,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:39:21" (1/1) ... [2018-02-04 12:39:21,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:39:21" (1/1) ... [2018-02-04 12:39:21,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:39:21" (1/1) ... [2018-02-04 12:39:21,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:39:21" (1/1) ... [2018-02-04 12:39:21,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:39:21" (1/1) ... [2018-02-04 12:39:21,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:39:21" (1/1) ... [2018-02-04 12:39:21,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:39:21" (1/1) ... [2018-02-04 12:39:21,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:39:21,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:39:21,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:39:21,825 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:39:21,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:39:21" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:39:21,864 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:39:21,865 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:39:21,865 INFO L136 BoogieDeclarations]: Found implementation of procedure list_empty [2018-02-04 12:39:21,865 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-04 12:39:21,865 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-02-04 12:39:21,865 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-02-04 12:39:21,865 INFO L136 BoogieDeclarations]: Found implementation of procedure list_del [2018-02-04 12:39:21,865 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-02-04 12:39:21,865 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-02-04 12:39:21,865 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-02-04 12:39:21,865 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-02-04 12:39:21,865 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-02-04 12:39:21,865 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_seek_max [2018-02-04 12:39:21,865 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-02-04 12:39:21,865 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure list_empty [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-02-04 12:39:21,866 INFO L128 BoogieDeclarations]: Found specification of procedure list_del [2018-02-04 12:39:21,867 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-02-04 12:39:21,867 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-02-04 12:39:21,867 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-02-04 12:39:21,867 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-02-04 12:39:21,867 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-02-04 12:39:21,867 INFO L128 BoogieDeclarations]: Found specification of procedure gl_seek_max [2018-02-04 12:39:21,867 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-02-04 12:39:21,867 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:39:21,867 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:39:21,867 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:39:22,235 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:39:22,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:39:22 BoogieIcfgContainer [2018-02-04 12:39:22,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:39:22,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:39:22,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:39:22,240 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:39:22,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:39:21" (1/3) ... [2018-02-04 12:39:22,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b037aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:39:22, skipping insertion in model container [2018-02-04 12:39:22,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:39:21" (2/3) ... [2018-02-04 12:39:22,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b037aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:39:22, skipping insertion in model container [2018-02-04 12:39:22,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:39:22" (3/3) ... [2018-02-04 12:39:22,242 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0134_true-valid-memsafety.i [2018-02-04 12:39:22,248 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:39:22,254 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-04 12:39:22,279 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:39:22,279 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:39:22,279 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:39:22,279 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:39:22,279 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:39:22,279 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:39:22,279 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:39:22,279 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:39:22,280 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:39:22,291 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2018-02-04 12:39:22,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 12:39:22,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:22,298 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 12:39:22,298 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:22,301 INFO L82 PathProgramCache]: Analyzing trace with hash 8457694, now seen corresponding path program 1 times [2018-02-04 12:39:22,302 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:22,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:22,335 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:22,335 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:22,335 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:22,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:22,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:22,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:39:22,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:39:22,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:39:22,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:39:22,412 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 3 states. [2018-02-04 12:39:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:22,627 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2018-02-04 12:39:22,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:39:22,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 12:39:22,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:22,639 INFO L225 Difference]: With dead ends: 182 [2018-02-04 12:39:22,639 INFO L226 Difference]: Without dead ends: 179 [2018-02-04 12:39:22,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:39:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-04 12:39:22,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-02-04 12:39:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-04 12:39:22,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-02-04 12:39:22,670 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 4 [2018-02-04 12:39:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:22,670 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-02-04 12:39:22,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:39:22,670 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-02-04 12:39:22,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 12:39:22,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:22,671 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 12:39:22,671 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:22,671 INFO L82 PathProgramCache]: Analyzing trace with hash 8457695, now seen corresponding path program 1 times [2018-02-04 12:39:22,671 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:22,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:22,672 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:22,672 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:22,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:22,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:22,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:22,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:39:22,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:39:22,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:39:22,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:39:22,731 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 3 states. [2018-02-04 12:39:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:22,848 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2018-02-04 12:39:22,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:39:22,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 12:39:22,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:22,851 INFO L225 Difference]: With dead ends: 180 [2018-02-04 12:39:22,851 INFO L226 Difference]: Without dead ends: 180 [2018-02-04 12:39:22,852 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:39:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-04 12:39:22,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-02-04 12:39:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 12:39:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2018-02-04 12:39:22,872 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 4 [2018-02-04 12:39:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:22,872 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2018-02-04 12:39:22,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:39:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2018-02-04 12:39:22,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:39:22,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:22,873 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:22,873 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:22,873 INFO L82 PathProgramCache]: Analyzing trace with hash 809839361, now seen corresponding path program 1 times [2018-02-04 12:39:22,874 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:22,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:22,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:22,875 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:22,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:22,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:22,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:22,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:39:22,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:39:22,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:39:22,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:39:22,928 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand 4 states. [2018-02-04 12:39:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:23,043 INFO L93 Difference]: Finished difference Result 175 states and 188 transitions. [2018-02-04 12:39:23,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:39:23,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 12:39:23,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:23,045 INFO L225 Difference]: With dead ends: 175 [2018-02-04 12:39:23,045 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 12:39:23,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:39:23,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 12:39:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-02-04 12:39:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 12:39:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2018-02-04 12:39:23,055 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 16 [2018-02-04 12:39:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:23,055 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2018-02-04 12:39:23,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:39:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2018-02-04 12:39:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:39:23,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:23,056 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:23,056 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash 809839362, now seen corresponding path program 1 times [2018-02-04 12:39:23,056 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:23,056 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:23,057 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:23,057 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:23,057 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:23,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:23,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:23,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:39:23,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:39:23,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:39:23,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:39:23,118 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 4 states. [2018-02-04 12:39:23,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:23,218 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2018-02-04 12:39:23,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:39:23,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 12:39:23,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:23,220 INFO L225 Difference]: With dead ends: 174 [2018-02-04 12:39:23,220 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 12:39:23,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:39:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 12:39:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-02-04 12:39:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-04 12:39:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-02-04 12:39:23,225 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 16 [2018-02-04 12:39:23,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:23,225 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-02-04 12:39:23,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:39:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-02-04 12:39:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:39:23,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:23,226 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:23,226 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:23,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1093319294, now seen corresponding path program 1 times [2018-02-04 12:39:23,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:23,226 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:23,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:23,227 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:23,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:23,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:23,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:23,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:39:23,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:39:23,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:39:23,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:39:23,299 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 7 states. [2018-02-04 12:39:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:23,475 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2018-02-04 12:39:23,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:39:23,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 12:39:23,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:23,476 INFO L225 Difference]: With dead ends: 182 [2018-02-04 12:39:23,477 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 12:39:23,477 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-04 12:39:23,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 12:39:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-02-04 12:39:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 12:39:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2018-02-04 12:39:23,487 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 19 [2018-02-04 12:39:23,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:23,487 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2018-02-04 12:39:23,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:39:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2018-02-04 12:39:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:39:23,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:23,488 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:23,488 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:23,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1093319295, now seen corresponding path program 1 times [2018-02-04 12:39:23,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:23,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:23,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:23,489 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:23,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:23,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:23,629 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:23,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:39:23,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:39:23,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:39:23,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:39:23,629 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand 9 states. [2018-02-04 12:39:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:23,974 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2018-02-04 12:39:23,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:39:23,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 12:39:23,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:23,975 INFO L225 Difference]: With dead ends: 177 [2018-02-04 12:39:23,975 INFO L226 Difference]: Without dead ends: 177 [2018-02-04 12:39:23,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:39:23,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-04 12:39:23,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-02-04 12:39:23,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-04 12:39:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2018-02-04 12:39:23,982 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 19 [2018-02-04 12:39:23,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:23,983 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2018-02-04 12:39:23,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:39:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2018-02-04 12:39:23,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:39:23,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:23,984 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:23,984 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:23,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1956678693, now seen corresponding path program 1 times [2018-02-04 12:39:23,984 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:23,984 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:23,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:23,985 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:23,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:24,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:24,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:24,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:39:24,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:39:24,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:39:24,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:39:24,133 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 10 states. [2018-02-04 12:39:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:24,509 INFO L93 Difference]: Finished difference Result 203 states and 217 transitions. [2018-02-04 12:39:24,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:39:24,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 12:39:24,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:24,511 INFO L225 Difference]: With dead ends: 203 [2018-02-04 12:39:24,511 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 12:39:24,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:39:24,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 12:39:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 195. [2018-02-04 12:39:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 12:39:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 216 transitions. [2018-02-04 12:39:24,517 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 216 transitions. Word has length 22 [2018-02-04 12:39:24,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:24,517 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 216 transitions. [2018-02-04 12:39:24,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:39:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2018-02-04 12:39:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:39:24,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:24,518 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:24,518 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:24,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1956678692, now seen corresponding path program 1 times [2018-02-04 12:39:24,518 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:24,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:24,519 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:24,519 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:24,519 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:24,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:24,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:24,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:39:24,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:39:24,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:39:24,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:39:24,730 INFO L87 Difference]: Start difference. First operand 195 states and 216 transitions. Second operand 11 states. [2018-02-04 12:39:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:25,525 INFO L93 Difference]: Finished difference Result 362 states and 386 transitions. [2018-02-04 12:39:25,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:39:25,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-04 12:39:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:25,529 INFO L225 Difference]: With dead ends: 362 [2018-02-04 12:39:25,529 INFO L226 Difference]: Without dead ends: 362 [2018-02-04 12:39:25,530 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-04 12:39:25,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-02-04 12:39:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 290. [2018-02-04 12:39:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-04 12:39:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 356 transitions. [2018-02-04 12:39:25,555 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 356 transitions. Word has length 22 [2018-02-04 12:39:25,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:25,556 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 356 transitions. [2018-02-04 12:39:25,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:39:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 356 transitions. [2018-02-04 12:39:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:39:25,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:25,557 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:25,557 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:25,557 INFO L82 PathProgramCache]: Analyzing trace with hash -527497365, now seen corresponding path program 1 times [2018-02-04 12:39:25,557 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:25,557 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:25,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:25,558 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:25,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:25,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:25,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:25,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:39:25,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:39:25,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:39:25,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:39:25,729 INFO L87 Difference]: Start difference. First operand 290 states and 356 transitions. Second operand 7 states. [2018-02-04 12:39:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:25,948 INFO L93 Difference]: Finished difference Result 302 states and 364 transitions. [2018-02-04 12:39:25,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:39:25,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 12:39:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:25,951 INFO L225 Difference]: With dead ends: 302 [2018-02-04 12:39:25,951 INFO L226 Difference]: Without dead ends: 302 [2018-02-04 12:39:25,951 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:39:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-02-04 12:39:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 206. [2018-02-04 12:39:25,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 12:39:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2018-02-04 12:39:25,957 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 23 [2018-02-04 12:39:25,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:25,958 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2018-02-04 12:39:25,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:39:25,958 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2018-02-04 12:39:25,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:39:25,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:25,958 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:25,960 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:25,961 INFO L82 PathProgramCache]: Analyzing trace with hash -527497364, now seen corresponding path program 1 times [2018-02-04 12:39:25,961 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:25,961 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:25,961 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:25,962 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:25,962 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:25,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:26,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:26,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:39:26,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:39:26,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:39:26,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:39:26,063 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand 8 states. [2018-02-04 12:39:26,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:26,322 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2018-02-04 12:39:26,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:39:26,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-04 12:39:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:26,324 INFO L225 Difference]: With dead ends: 210 [2018-02-04 12:39:26,324 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 12:39:26,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:39:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 12:39:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 206. [2018-02-04 12:39:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 12:39:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 223 transitions. [2018-02-04 12:39:26,330 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 223 transitions. Word has length 23 [2018-02-04 12:39:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:26,330 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 223 transitions. [2018-02-04 12:39:26,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:39:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 223 transitions. [2018-02-04 12:39:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:39:26,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:26,331 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:26,331 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:26,331 INFO L82 PathProgramCache]: Analyzing trace with hash -118827570, now seen corresponding path program 1 times [2018-02-04 12:39:26,331 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:26,331 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:26,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:26,332 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:26,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:26,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:26,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:26,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:39:26,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:39:26,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:39:26,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:39:26,373 INFO L87 Difference]: Start difference. First operand 206 states and 223 transitions. Second operand 5 states. [2018-02-04 12:39:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:26,509 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2018-02-04 12:39:26,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:39:26,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-04 12:39:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:26,510 INFO L225 Difference]: With dead ends: 205 [2018-02-04 12:39:26,511 INFO L226 Difference]: Without dead ends: 205 [2018-02-04 12:39:26,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:39:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-04 12:39:26,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-02-04 12:39:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-04 12:39:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 220 transitions. [2018-02-04 12:39:26,516 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 220 transitions. Word has length 25 [2018-02-04 12:39:26,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:26,516 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 220 transitions. [2018-02-04 12:39:26,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:39:26,517 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 220 transitions. [2018-02-04 12:39:26,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:39:26,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:26,517 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:26,517 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:26,517 INFO L82 PathProgramCache]: Analyzing trace with hash -118827569, now seen corresponding path program 1 times [2018-02-04 12:39:26,517 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:26,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:26,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:26,518 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:26,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:26,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:26,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:26,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:39:26,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:39:26,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:39:26,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:39:26,579 INFO L87 Difference]: Start difference. First operand 205 states and 220 transitions. Second operand 8 states. [2018-02-04 12:39:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:26,760 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-02-04 12:39:26,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:39:26,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-04 12:39:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:26,761 INFO L225 Difference]: With dead ends: 207 [2018-02-04 12:39:26,761 INFO L226 Difference]: Without dead ends: 207 [2018-02-04 12:39:26,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:39:26,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-04 12:39:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-02-04 12:39:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-04 12:39:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 218 transitions. [2018-02-04 12:39:26,767 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 218 transitions. Word has length 25 [2018-02-04 12:39:26,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:26,767 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 218 transitions. [2018-02-04 12:39:26,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:39:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 218 transitions. [2018-02-04 12:39:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:39:26,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:26,768 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:26,768 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1902858492, now seen corresponding path program 1 times [2018-02-04 12:39:26,769 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:26,769 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:26,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:26,770 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:26,770 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:26,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:26,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:26,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:39:26,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:39:26,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:39:26,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:39:26,879 INFO L87 Difference]: Start difference. First operand 205 states and 218 transitions. Second operand 9 states. [2018-02-04 12:39:27,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:27,154 INFO L93 Difference]: Finished difference Result 204 states and 217 transitions. [2018-02-04 12:39:27,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:39:27,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-04 12:39:27,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:27,156 INFO L225 Difference]: With dead ends: 204 [2018-02-04 12:39:27,156 INFO L226 Difference]: Without dead ends: 204 [2018-02-04 12:39:27,156 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:39:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-04 12:39:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-02-04 12:39:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-04 12:39:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 217 transitions. [2018-02-04 12:39:27,161 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 217 transitions. Word has length 41 [2018-02-04 12:39:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:27,162 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 217 transitions. [2018-02-04 12:39:27,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:39:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 217 transitions. [2018-02-04 12:39:27,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:39:27,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:27,163 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:27,163 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:27,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1902858493, now seen corresponding path program 1 times [2018-02-04 12:39:27,163 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:27,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:27,164 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:27,164 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:27,164 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:27,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:27,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:27,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:39:27,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:39:27,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:39:27,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:39:27,423 INFO L87 Difference]: Start difference. First operand 204 states and 217 transitions. Second operand 11 states. [2018-02-04 12:39:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:27,757 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2018-02-04 12:39:27,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:39:27,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-04 12:39:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:27,758 INFO L225 Difference]: With dead ends: 203 [2018-02-04 12:39:27,758 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 12:39:27,759 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-04 12:39:27,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 12:39:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-02-04 12:39:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-04 12:39:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 216 transitions. [2018-02-04 12:39:27,764 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 216 transitions. Word has length 41 [2018-02-04 12:39:27,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:27,764 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 216 transitions. [2018-02-04 12:39:27,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:39:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 216 transitions. [2018-02-04 12:39:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:39:27,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:27,765 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:27,765 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:27,766 INFO L82 PathProgramCache]: Analyzing trace with hash 873260496, now seen corresponding path program 1 times [2018-02-04 12:39:27,766 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:27,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:27,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:27,767 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:27,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:27,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:28,221 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-04 12:39:28,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:39:28,221 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-04 12:39:28,229 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:28,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:39:28,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:39:28,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:39:28,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:28,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:28,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:39:28,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-02-04 12:39:28,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:39:28,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:39:28,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:39:28,563 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-04 12:39:28,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:28,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:28,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2018-02-04 12:39:28,626 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-04 12:39:28,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 12:39:28,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:28,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:28,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:39:28,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:35 [2018-02-04 12:39:28,751 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-04 12:39:28,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 12:39:28,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:28,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:28,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:39:28,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-02-04 12:39:28,853 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-04 12:39:28,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:39:28,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2018-02-04 12:39:28,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 12:39:28,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 12:39:28,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 12:39:28,886 INFO L87 Difference]: Start difference. First operand 203 states and 216 transitions. Second operand 34 states. [2018-02-04 12:39:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:31,417 INFO L93 Difference]: Finished difference Result 291 states and 309 transitions. [2018-02-04 12:39:31,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 12:39:31,417 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2018-02-04 12:39:31,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:31,418 INFO L225 Difference]: With dead ends: 291 [2018-02-04 12:39:31,418 INFO L226 Difference]: Without dead ends: 291 [2018-02-04 12:39:31,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=348, Invalid=2304, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 12:39:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-04 12:39:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 212. [2018-02-04 12:39:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 12:39:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 224 transitions. [2018-02-04 12:39:31,427 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 224 transitions. Word has length 48 [2018-02-04 12:39:31,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:31,427 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 224 transitions. [2018-02-04 12:39:31,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 12:39:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 224 transitions. [2018-02-04 12:39:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:39:31,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:31,428 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:31,429 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:31,432 INFO L82 PathProgramCache]: Analyzing trace with hash 873260497, now seen corresponding path program 1 times [2018-02-04 12:39:31,432 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:31,432 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:31,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:31,433 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:31,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:31,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:31,911 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-04 12:39:31,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:39:31,911 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-04 12:39:31,916 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:31,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:39:31,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:39:31,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:31,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:31,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 12:39:32,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:39:32,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:39:32,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:39:32,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:39:32,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:39:32,213 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-02-04 12:39:32,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:39:32,313 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:39:32,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:39:32,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,321 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-04 12:39:32,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:36 [2018-02-04 12:39:32,383 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-04 12:39:32,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 12:39:32,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-04 12:39:32,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 12:39:32,436 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:39:32,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:36 [2018-02-04 12:39:32,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 12:39:32,542 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-04 12:39:32,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,553 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-04 12:39:32,555 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-04 12:39:32,555 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:32,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:39:32,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:17 [2018-02-04 12:39:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:32,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:39:32,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 35 [2018-02-04 12:39:32,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 12:39:32,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 12:39:32,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 12:39:32,645 INFO L87 Difference]: Start difference. First operand 212 states and 224 transitions. Second operand 36 states. [2018-02-04 12:39:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:34,342 INFO L93 Difference]: Finished difference Result 273 states and 287 transitions. [2018-02-04 12:39:34,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 12:39:34,342 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 48 [2018-02-04 12:39:34,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:34,343 INFO L225 Difference]: With dead ends: 273 [2018-02-04 12:39:34,343 INFO L226 Difference]: Without dead ends: 273 [2018-02-04 12:39:34,344 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-04 12:39:34,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-04 12:39:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 195. [2018-02-04 12:39:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 12:39:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 210 transitions. [2018-02-04 12:39:34,348 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 210 transitions. Word has length 48 [2018-02-04 12:39:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:34,349 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 210 transitions. [2018-02-04 12:39:34,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 12:39:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 210 transitions. [2018-02-04 12:39:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:39:34,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:34,350 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:34,350 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:34,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1302970133, now seen corresponding path program 1 times [2018-02-04 12:39:34,350 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:34,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:34,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:34,351 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:34,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:34,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:34,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:34,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:39:34,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:39:34,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:39:34,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:39:34,407 INFO L87 Difference]: Start difference. First operand 195 states and 210 transitions. Second operand 3 states. [2018-02-04 12:39:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:34,495 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2018-02-04 12:39:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:39:34,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-04 12:39:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:34,496 INFO L225 Difference]: With dead ends: 193 [2018-02-04 12:39:34,497 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 12:39:34,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:39:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 12:39:34,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-02-04 12:39:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 12:39:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 208 transitions. [2018-02-04 12:39:34,502 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 208 transitions. Word has length 48 [2018-02-04 12:39:34,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:34,502 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 208 transitions. [2018-02-04 12:39:34,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:39:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 208 transitions. [2018-02-04 12:39:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:39:34,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:34,504 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:34,505 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:34,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1302970134, now seen corresponding path program 1 times [2018-02-04 12:39:34,505 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:34,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:34,508 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:34,508 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:34,509 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:34,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:34,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:34,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:39:34,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:39:34,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:39:34,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:39:34,598 INFO L87 Difference]: Start difference. First operand 193 states and 208 transitions. Second operand 3 states. [2018-02-04 12:39:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:34,664 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2018-02-04 12:39:34,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:39:34,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-04 12:39:34,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:34,666 INFO L225 Difference]: With dead ends: 191 [2018-02-04 12:39:34,666 INFO L226 Difference]: Without dead ends: 191 [2018-02-04 12:39:34,666 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:39:34,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-04 12:39:34,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-02-04 12:39:34,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 12:39:34,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2018-02-04 12:39:34,673 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 206 transitions. Word has length 48 [2018-02-04 12:39:34,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:34,674 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 206 transitions. [2018-02-04 12:39:34,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:39:34,674 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 206 transitions. [2018-02-04 12:39:34,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 12:39:34,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:34,678 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:34,678 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:34,678 INFO L82 PathProgramCache]: Analyzing trace with hash 467934037, now seen corresponding path program 1 times [2018-02-04 12:39:34,678 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:34,678 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:34,679 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:34,679 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:34,679 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:34,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:34,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:34,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:39:34,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:39:34,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:39:34,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:39:34,841 INFO L87 Difference]: Start difference. First operand 191 states and 206 transitions. Second operand 11 states. [2018-02-04 12:39:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:35,564 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2018-02-04 12:39:35,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:39:35,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-02-04 12:39:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:35,565 INFO L225 Difference]: With dead ends: 275 [2018-02-04 12:39:35,565 INFO L226 Difference]: Without dead ends: 275 [2018-02-04 12:39:35,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:39:35,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-04 12:39:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 193. [2018-02-04 12:39:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 12:39:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 209 transitions. [2018-02-04 12:39:35,571 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 209 transitions. Word has length 55 [2018-02-04 12:39:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:35,571 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 209 transitions. [2018-02-04 12:39:35,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:39:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 209 transitions. [2018-02-04 12:39:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 12:39:35,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:35,572 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:35,572 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:35,572 INFO L82 PathProgramCache]: Analyzing trace with hash 467934038, now seen corresponding path program 1 times [2018-02-04 12:39:35,572 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:35,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:35,573 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:35,573 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:35,573 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:35,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:35,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:35,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 12:39:35,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:39:35,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:39:35,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:39:35,775 INFO L87 Difference]: Start difference. First operand 193 states and 209 transitions. Second operand 12 states. [2018-02-04 12:39:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:36,472 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2018-02-04 12:39:36,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:39:36,472 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-02-04 12:39:36,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:36,473 INFO L225 Difference]: With dead ends: 223 [2018-02-04 12:39:36,473 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 12:39:36,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:39:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 12:39:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2018-02-04 12:39:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 12:39:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2018-02-04 12:39:36,476 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 55 [2018-02-04 12:39:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:36,476 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2018-02-04 12:39:36,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:39:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2018-02-04 12:39:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 12:39:36,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:36,476 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:36,476 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:36,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1242217214, now seen corresponding path program 1 times [2018-02-04 12:39:36,477 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:36,477 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:36,477 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:36,477 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:36,477 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:36,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:36,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:36,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 12:39:36,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 12:39:36,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 12:39:36,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:39:36,617 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand 16 states. [2018-02-04 12:39:37,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:37,484 INFO L93 Difference]: Finished difference Result 233 states and 255 transitions. [2018-02-04 12:39:37,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 12:39:37,484 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-02-04 12:39:37,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:37,485 INFO L225 Difference]: With dead ends: 233 [2018-02-04 12:39:37,485 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 12:39:37,486 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 12:39:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 12:39:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 196. [2018-02-04 12:39:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 12:39:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 210 transitions. [2018-02-04 12:39:37,488 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 210 transitions. Word has length 58 [2018-02-04 12:39:37,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:37,488 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 210 transitions. [2018-02-04 12:39:37,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 12:39:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2018-02-04 12:39:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 12:39:37,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:37,489 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:37,489 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:37,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1552523800, now seen corresponding path program 1 times [2018-02-04 12:39:37,489 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:37,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:37,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:37,490 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:37,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:37,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:39:37,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:39:37,780 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-04 12:39:37,793 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:37,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:39:37,992 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-04 12:39:37,993 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-04 12:39:37,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:37,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:37,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:37,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-02-04 12:39:38,020 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-04 12:39:38,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:39:38,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 28 [2018-02-04 12:39:38,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 12:39:38,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 12:39:38,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:39:38,044 INFO L87 Difference]: Start difference. First operand 196 states and 210 transitions. Second operand 28 states. [2018-02-04 12:39:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:39,177 INFO L93 Difference]: Finished difference Result 204 states and 214 transitions. [2018-02-04 12:39:39,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 12:39:39,177 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-02-04 12:39:39,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:39,178 INFO L225 Difference]: With dead ends: 204 [2018-02-04 12:39:39,178 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 12:39:39,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=459, Invalid=3201, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 12:39:39,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 12:39:39,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 174. [2018-02-04 12:39:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-04 12:39:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 182 transitions. [2018-02-04 12:39:39,181 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 182 transitions. Word has length 60 [2018-02-04 12:39:39,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:39,181 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 182 transitions. [2018-02-04 12:39:39,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 12:39:39,181 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 182 transitions. [2018-02-04 12:39:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 12:39:39,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:39,182 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:39,182 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:39,182 INFO L82 PathProgramCache]: Analyzing trace with hash 11633541, now seen corresponding path program 1 times [2018-02-04 12:39:39,183 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:39,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:39,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:39,183 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:39,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:39,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:39:39,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:39,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 12:39:39,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 12:39:39,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 12:39:39,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:39:39,418 INFO L87 Difference]: Start difference. First operand 174 states and 182 transitions. Second operand 17 states. [2018-02-04 12:39:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:40,027 INFO L93 Difference]: Finished difference Result 265 states and 287 transitions. [2018-02-04 12:39:40,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 12:39:40,027 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-02-04 12:39:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:40,028 INFO L225 Difference]: With dead ends: 265 [2018-02-04 12:39:40,028 INFO L226 Difference]: Without dead ends: 265 [2018-02-04 12:39:40,028 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-04 12:39:40,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-04 12:39:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 210. [2018-02-04 12:39:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 12:39:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 227 transitions. [2018-02-04 12:39:40,031 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 227 transitions. Word has length 65 [2018-02-04 12:39:40,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:40,031 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 227 transitions. [2018-02-04 12:39:40,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 12:39:40,031 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 227 transitions. [2018-02-04 12:39:40,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 12:39:40,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:40,032 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:40,032 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:40,032 INFO L82 PathProgramCache]: Analyzing trace with hash 11633542, now seen corresponding path program 1 times [2018-02-04 12:39:40,032 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:40,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:40,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:40,033 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:40,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:40,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:39:40,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:40,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-04 12:39:40,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 12:39:40,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 12:39:40,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-02-04 12:39:40,372 INFO L87 Difference]: Start difference. First operand 210 states and 227 transitions. Second operand 20 states. [2018-02-04 12:39:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:41,390 INFO L93 Difference]: Finished difference Result 258 states and 278 transitions. [2018-02-04 12:39:41,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 12:39:41,392 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-02-04 12:39:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:41,393 INFO L225 Difference]: With dead ends: 258 [2018-02-04 12:39:41,393 INFO L226 Difference]: Without dead ends: 258 [2018-02-04 12:39:41,393 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-04 12:39:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-04 12:39:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 210. [2018-02-04 12:39:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 12:39:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 225 transitions. [2018-02-04 12:39:41,401 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 225 transitions. Word has length 65 [2018-02-04 12:39:41,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:41,402 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 225 transitions. [2018-02-04 12:39:41,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 12:39:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 225 transitions. [2018-02-04 12:39:41,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 12:39:41,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:41,403 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:41,403 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1238238810, now seen corresponding path program 1 times [2018-02-04 12:39:41,403 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:41,403 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:41,404 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:41,404 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:41,404 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:41,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:39:41,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:41,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:39:41,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:39:41,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:39:41,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:39:41,517 INFO L87 Difference]: Start difference. First operand 210 states and 225 transitions. Second operand 5 states. [2018-02-04 12:39:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:41,625 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-04 12:39:41,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:39:41,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-04 12:39:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:41,626 INFO L225 Difference]: With dead ends: 217 [2018-02-04 12:39:41,626 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 12:39:41,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:39:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 12:39:41,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-02-04 12:39:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 12:39:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 232 transitions. [2018-02-04 12:39:41,631 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 232 transitions. Word has length 67 [2018-02-04 12:39:41,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:41,631 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 232 transitions. [2018-02-04 12:39:41,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:39:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 232 transitions. [2018-02-04 12:39:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 12:39:41,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:41,632 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:41,632 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:41,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1238238809, now seen corresponding path program 1 times [2018-02-04 12:39:41,632 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:41,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:41,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:41,633 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:41,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:41,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:39:41,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:41,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:39:41,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:39:41,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:39:41,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:39:41,750 INFO L87 Difference]: Start difference. First operand 216 states and 232 transitions. Second operand 5 states. [2018-02-04 12:39:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:41,877 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2018-02-04 12:39:41,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:39:41,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-04 12:39:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:41,878 INFO L225 Difference]: With dead ends: 216 [2018-02-04 12:39:41,878 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 12:39:41,879 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:39:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 12:39:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-04 12:39:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 12:39:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2018-02-04 12:39:41,882 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 67 [2018-02-04 12:39:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:41,882 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2018-02-04 12:39:41,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:39:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2018-02-04 12:39:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 12:39:41,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:41,883 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:41,883 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:41,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1238184798, now seen corresponding path program 1 times [2018-02-04 12:39:41,883 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:41,884 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:41,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:41,884 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:41,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:41,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:39:41,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:41,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:39:41,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:39:41,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:39:41,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:39:41,924 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 5 states. [2018-02-04 12:39:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:41,939 INFO L93 Difference]: Finished difference Result 222 states and 237 transitions. [2018-02-04 12:39:41,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:39:41,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-04 12:39:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:41,941 INFO L225 Difference]: With dead ends: 222 [2018-02-04 12:39:41,941 INFO L226 Difference]: Without dead ends: 222 [2018-02-04 12:39:41,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:39:41,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-04 12:39:41,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-02-04 12:39:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-04 12:39:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 237 transitions. [2018-02-04 12:39:41,945 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 237 transitions. Word has length 67 [2018-02-04 12:39:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:41,945 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 237 transitions. [2018-02-04 12:39:41,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:39:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 237 transitions. [2018-02-04 12:39:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 12:39:41,946 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:41,946 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:41,946 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:41,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1101923251, now seen corresponding path program 1 times [2018-02-04 12:39:41,946 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:41,946 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:41,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:41,947 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:41,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:41,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:42,033 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-04 12:39:42,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:42,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:39:42,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:39:42,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:39:42,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:39:42,034 INFO L87 Difference]: Start difference. First operand 222 states and 237 transitions. Second operand 9 states. [2018-02-04 12:39:42,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:42,324 INFO L93 Difference]: Finished difference Result 244 states and 262 transitions. [2018-02-04 12:39:42,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:39:42,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-02-04 12:39:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:42,325 INFO L225 Difference]: With dead ends: 244 [2018-02-04 12:39:42,325 INFO L226 Difference]: Without dead ends: 244 [2018-02-04 12:39:42,325 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-04 12:39:42,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-04 12:39:42,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 237. [2018-02-04 12:39:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-04 12:39:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 259 transitions. [2018-02-04 12:39:42,329 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 259 transitions. Word has length 70 [2018-02-04 12:39:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:42,330 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 259 transitions. [2018-02-04 12:39:42,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:39:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 259 transitions. [2018-02-04 12:39:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 12:39:42,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:42,331 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:42,331 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:42,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1101923252, now seen corresponding path program 1 times [2018-02-04 12:39:42,332 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:42,332 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:42,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:42,332 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:42,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:42,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:42,471 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-04 12:39:42,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:42,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:39:42,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:39:42,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:39:42,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:39:42,472 INFO L87 Difference]: Start difference. First operand 237 states and 259 transitions. Second operand 9 states. [2018-02-04 12:39:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:42,750 INFO L93 Difference]: Finished difference Result 243 states and 261 transitions. [2018-02-04 12:39:42,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:39:42,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-02-04 12:39:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:42,751 INFO L225 Difference]: With dead ends: 243 [2018-02-04 12:39:42,751 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 12:39:42,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:39:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 12:39:42,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2018-02-04 12:39:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-04 12:39:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 258 transitions. [2018-02-04 12:39:42,756 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 258 transitions. Word has length 70 [2018-02-04 12:39:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:42,756 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 258 transitions. [2018-02-04 12:39:42,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:39:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 258 transitions. [2018-02-04 12:39:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 12:39:42,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:42,757 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-04 12:39:42,757 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:42,757 INFO L82 PathProgramCache]: Analyzing trace with hash -200117613, now seen corresponding path program 1 times [2018-02-04 12:39:42,757 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:42,757 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:42,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:42,758 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:42,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:42,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:42,831 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-04 12:39:42,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:42,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:39:42,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:39:42,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:39:42,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:39:42,832 INFO L87 Difference]: Start difference. First operand 237 states and 258 transitions. Second operand 10 states. [2018-02-04 12:39:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:43,120 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2018-02-04 12:39:43,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:39:43,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-02-04 12:39:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:43,121 INFO L225 Difference]: With dead ends: 249 [2018-02-04 12:39:43,121 INFO L226 Difference]: Without dead ends: 249 [2018-02-04 12:39:43,122 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-04 12:39:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-04 12:39:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 244. [2018-02-04 12:39:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 12:39:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 268 transitions. [2018-02-04 12:39:43,124 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 268 transitions. Word has length 71 [2018-02-04 12:39:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:43,124 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 268 transitions. [2018-02-04 12:39:43,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:39:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 268 transitions. [2018-02-04 12:39:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 12:39:43,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:43,125 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-04 12:39:43,125 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:43,125 INFO L82 PathProgramCache]: Analyzing trace with hash -200117612, now seen corresponding path program 1 times [2018-02-04 12:39:43,125 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:43,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:43,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:43,126 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:43,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:43,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:43,245 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-04 12:39:43,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:43,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 12:39:43,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:39:43,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:39:43,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:39:43,246 INFO L87 Difference]: Start difference. First operand 244 states and 268 transitions. Second operand 12 states. [2018-02-04 12:39:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:43,594 INFO L93 Difference]: Finished difference Result 248 states and 266 transitions. [2018-02-04 12:39:43,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:39:43,595 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-02-04 12:39:43,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:43,595 INFO L225 Difference]: With dead ends: 248 [2018-02-04 12:39:43,595 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 12:39:43,596 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-04 12:39:43,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 12:39:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2018-02-04 12:39:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 12:39:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 266 transitions. [2018-02-04 12:39:43,600 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 266 transitions. Word has length 71 [2018-02-04 12:39:43,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:43,601 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 266 transitions. [2018-02-04 12:39:43,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:39:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 266 transitions. [2018-02-04 12:39:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 12:39:43,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:43,602 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-04 12:39:43,602 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1908678729, now seen corresponding path program 1 times [2018-02-04 12:39:43,602 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:43,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:43,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:43,603 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:43,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:43,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:43,924 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-04 12:39:43,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:43,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-04 12:39:43,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 12:39:43,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 12:39:43,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:39:43,925 INFO L87 Difference]: Start difference. First operand 244 states and 266 transitions. Second operand 22 states. [2018-02-04 12:39:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:45,293 INFO L93 Difference]: Finished difference Result 294 states and 320 transitions. [2018-02-04 12:39:45,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 12:39:45,293 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-02-04 12:39:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:45,294 INFO L225 Difference]: With dead ends: 294 [2018-02-04 12:39:45,294 INFO L226 Difference]: Without dead ends: 294 [2018-02-04 12:39:45,294 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-04 12:39:45,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-04 12:39:45,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 240. [2018-02-04 12:39:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-04 12:39:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 261 transitions. [2018-02-04 12:39:45,298 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 261 transitions. Word has length 72 [2018-02-04 12:39:45,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:45,298 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 261 transitions. [2018-02-04 12:39:45,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 12:39:45,299 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 261 transitions. [2018-02-04 12:39:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 12:39:45,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:45,299 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:45,299 INFO L371 AbstractCegarLoop]: === Iteration 33 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:45,299 INFO L82 PathProgramCache]: Analyzing trace with hash 334330969, now seen corresponding path program 1 times [2018-02-04 12:39:45,300 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:45,300 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:45,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:45,300 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:45,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:45,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:39:45,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:45,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-04 12:39:45,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 12:39:45,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 12:39:45,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-02-04 12:39:45,974 INFO L87 Difference]: Start difference. First operand 240 states and 261 transitions. Second operand 27 states. [2018-02-04 12:39:47,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:47,913 INFO L93 Difference]: Finished difference Result 300 states and 326 transitions. [2018-02-04 12:39:47,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 12:39:47,946 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-02-04 12:39:47,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:47,947 INFO L225 Difference]: With dead ends: 300 [2018-02-04 12:39:47,947 INFO L226 Difference]: Without dead ends: 300 [2018-02-04 12:39:47,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=2751, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 12:39:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-04 12:39:47,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 251. [2018-02-04 12:39:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-04 12:39:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 276 transitions. [2018-02-04 12:39:47,953 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 276 transitions. Word has length 76 [2018-02-04 12:39:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:47,954 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 276 transitions. [2018-02-04 12:39:47,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 12:39:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 276 transitions. [2018-02-04 12:39:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 12:39:47,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:47,954 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:47,954 INFO L371 AbstractCegarLoop]: === Iteration 34 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:47,955 INFO L82 PathProgramCache]: Analyzing trace with hash 334330970, now seen corresponding path program 1 times [2018-02-04 12:39:47,955 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:47,955 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:47,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:47,956 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:47,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:47,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:48,439 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 24 DAG size of output 20 [2018-02-04 12:39:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:39:49,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:49,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-02-04 12:39:49,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 12:39:49,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 12:39:49,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:39:49,236 INFO L87 Difference]: Start difference. First operand 251 states and 276 transitions. Second operand 28 states. [2018-02-04 12:39:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:52,090 INFO L93 Difference]: Finished difference Result 342 states and 378 transitions. [2018-02-04 12:39:52,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 12:39:52,090 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2018-02-04 12:39:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:52,091 INFO L225 Difference]: With dead ends: 342 [2018-02-04 12:39:52,091 INFO L226 Difference]: Without dead ends: 342 [2018-02-04 12:39:52,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=322, Invalid=2434, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 12:39:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-04 12:39:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 297. [2018-02-04 12:39:52,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-04 12:39:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 325 transitions. [2018-02-04 12:39:52,095 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 325 transitions. Word has length 76 [2018-02-04 12:39:52,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:52,095 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 325 transitions. [2018-02-04 12:39:52,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 12:39:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 325 transitions. [2018-02-04 12:39:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 12:39:52,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:52,095 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:52,095 INFO L371 AbstractCegarLoop]: === Iteration 35 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:52,096 INFO L82 PathProgramCache]: Analyzing trace with hash -415915384, now seen corresponding path program 1 times [2018-02-04 12:39:52,096 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:52,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:52,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:52,096 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:52,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:52,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:39:52,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:52,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:39:52,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:39:52,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:39:52,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:39:52,328 INFO L87 Difference]: Start difference. First operand 297 states and 325 transitions. Second operand 8 states. [2018-02-04 12:39:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:52,537 INFO L93 Difference]: Finished difference Result 343 states and 390 transitions. [2018-02-04 12:39:52,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:39:52,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-02-04 12:39:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:52,539 INFO L225 Difference]: With dead ends: 343 [2018-02-04 12:39:52,539 INFO L226 Difference]: Without dead ends: 343 [2018-02-04 12:39:52,539 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:39:52,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-04 12:39:52,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 330. [2018-02-04 12:39:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-04 12:39:52,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 375 transitions. [2018-02-04 12:39:52,543 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 375 transitions. Word has length 81 [2018-02-04 12:39:52,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:52,543 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 375 transitions. [2018-02-04 12:39:52,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:39:52,544 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 375 transitions. [2018-02-04 12:39:52,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 12:39:52,544 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:52,544 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:52,544 INFO L371 AbstractCegarLoop]: === Iteration 36 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 12:39:52,545 INFO L82 PathProgramCache]: Analyzing trace with hash -415915383, now seen corresponding path program 1 times [2018-02-04 12:39:52,545 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:52,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:52,545 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:52,545 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:52,545 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:52,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:39:52,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:53,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-04 12:39:53,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 12:39:53,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 12:39:53,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2018-02-04 12:39:53,031 INFO L87 Difference]: Start difference. First operand 330 states and 375 transitions. Second operand 25 states. [2018-02-04 12:39:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:54,514 INFO L93 Difference]: Finished difference Result 369 states and 412 transitions. [2018-02-04 12:39:54,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 12:39:54,515 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 81 [2018-02-04 12:39:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:54,516 INFO L225 Difference]: With dead ends: 369 [2018-02-04 12:39:54,516 INFO L226 Difference]: Without dead ends: 369 [2018-02-04 12:39:54,516 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=240, Invalid=2516, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 12:39:54,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-02-04 12:39:54,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 339. [2018-02-04 12:39:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-04 12:39:54,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 385 transitions. [2018-02-04 12:39:54,521 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 385 transitions. Word has length 81 [2018-02-04 12:39:54,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:54,521 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 385 transitions. [2018-02-04 12:39:54,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 12:39:54,521 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 385 transitions. [2018-02-04 12:39:54,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 12:39:54,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:54,522 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:54,522 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-04 12:39:54,522 INFO L82 PathProgramCache]: Analyzing trace with hash 924539713, now seen corresponding path program 1 times [2018-02-04 12:39:54,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:54,522 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:54,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:54,523 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:54,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:54,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:39:54,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:54,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 12:39:54,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 12:39:54,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 12:39:54,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:39:54,796 INFO L87 Difference]: Start difference. First operand 339 states and 385 transitions. Second operand 14 states. [2018-02-04 12:39:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:55,383 INFO L93 Difference]: Finished difference Result 382 states and 436 transitions. [2018-02-04 12:39:55,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:39:55,384 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-02-04 12:39:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:55,386 INFO L225 Difference]: With dead ends: 382 [2018-02-04 12:39:55,386 INFO L226 Difference]: Without dead ends: 382 [2018-02-04 12:39:55,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:39:55,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-04 12:39:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 366. [2018-02-04 12:39:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-02-04 12:39:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 422 transitions. [2018-02-04 12:39:55,392 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 422 transitions. Word has length 85 [2018-02-04 12:39:55,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:55,392 INFO L432 AbstractCegarLoop]: Abstraction has 366 states and 422 transitions. [2018-02-04 12:39:55,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 12:39:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 422 transitions. [2018-02-04 12:39:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 12:39:55,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:55,393 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:55,393 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-04 12:39:55,393 INFO L82 PathProgramCache]: Analyzing trace with hash 924539714, now seen corresponding path program 1 times [2018-02-04 12:39:55,393 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:55,393 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:55,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:55,394 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:55,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:55,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:39:55,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:39:55,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-04 12:39:55,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 12:39:55,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 12:39:55,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:39:55,844 INFO L87 Difference]: Start difference. First operand 366 states and 422 transitions. Second operand 23 states. [2018-02-04 12:39:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:39:57,183 INFO L93 Difference]: Finished difference Result 397 states and 453 transitions. [2018-02-04 12:39:57,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 12:39:57,183 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-02-04 12:39:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:39:57,184 INFO L225 Difference]: With dead ends: 397 [2018-02-04 12:39:57,184 INFO L226 Difference]: Without dead ends: 397 [2018-02-04 12:39:57,184 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-04 12:39:57,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-04 12:39:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 366. [2018-02-04 12:39:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-02-04 12:39:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 421 transitions. [2018-02-04 12:39:57,188 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 421 transitions. Word has length 85 [2018-02-04 12:39:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:39:57,188 INFO L432 AbstractCegarLoop]: Abstraction has 366 states and 421 transitions. [2018-02-04 12:39:57,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 12:39:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 421 transitions. [2018-02-04 12:39:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 12:39:57,189 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:39:57,189 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:39:57,189 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-04 12:39:57,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1404039901, now seen corresponding path program 1 times [2018-02-04 12:39:57,189 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:39:57,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:39:57,190 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:57,190 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:57,190 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:39:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:57,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:39:58,213 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-04 12:39:58,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:39:58,213 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-04 12:39:58,220 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:39:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:39:58,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:39:58,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:39:58,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:58,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:58,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:39:58,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 12:39:58,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:58,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:58,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 12:39:58,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 12:39:58,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:58,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:39:58,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-02-04 12:39:58,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:39:58,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:39:58,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:58,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:58,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:39:58,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-04 12:39:58,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-02-04 12:39:58,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-04 12:39:58,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:58,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:58,700 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-04 12:39:58,703 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-04 12:39:58,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:58,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:58,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:39:58,742 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:41 [2018-02-04 12:39:58,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:39:58,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:39:58,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 12:39:58,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:58,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:39:58,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:59 [2018-02-04 12:39:59,017 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:39:59,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:39:59,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:39:59,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-04 12:39:59,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:59,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:39:59,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:57 [2018-02-04 12:39:59,079 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-04 12:39:59,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:39:59,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:59,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:59,097 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-04 12:39:59,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:39:59,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:59,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:59,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:39:59,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:71 [2018-02-04 12:39:59,169 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-04 12:39:59,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:39:59,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 12:39:59,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:59,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:59,197 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-04 12:39:59,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:39:59,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 12:39:59,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:39:59,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:39:59,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 12:39:59,218 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:97, output treesize:89 [2018-02-04 12:40:00,104 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-04 12:40:00,106 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-04 12:40:00,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:00,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:00,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 12:40:00,112 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:00,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:00,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 12:40:00,124 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:108, output treesize:71 [2018-02-04 12:40:00,370 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-04 12:40:00,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 12:40:00,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:00,378 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:40:00,378 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-04 12:40:00,378 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:00,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:00,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 12:40:00,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:00,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:00,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:00,392 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:77, output treesize:5 [2018-02-04 12:40:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:40:00,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:40:00,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 33] total 66 [2018-02-04 12:40:00,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 12:40:00,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 12:40:00,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4196, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 12:40:00,467 INFO L87 Difference]: Start difference. First operand 366 states and 421 transitions. Second operand 67 states. [2018-02-04 12:40:01,316 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 85 DAG size of output 43 [2018-02-04 12:40:28,708 WARN L146 SmtUtils]: Spent 4068ms on a formula simplification. DAG size of input: 71 DAG size of output 58 [2018-02-04 12:40:34,164 WARN L146 SmtUtils]: Spent 4054ms on a formula simplification. DAG size of input: 86 DAG size of output 73 [2018-02-04 12:40:38,337 WARN L146 SmtUtils]: Spent 4088ms on a formula simplification. DAG size of input: 93 DAG size of output 80 [2018-02-04 12:40:42,488 WARN L146 SmtUtils]: Spent 4072ms on a formula simplification. DAG size of input: 86 DAG size of output 73 [2018-02-04 12:40:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:40:46,414 INFO L93 Difference]: Finished difference Result 430 states and 482 transitions. [2018-02-04 12:40:46,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 12:40:46,415 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 86 [2018-02-04 12:40:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:40:46,416 INFO L225 Difference]: With dead ends: 430 [2018-02-04 12:40:46,416 INFO L226 Difference]: Without dead ends: 430 [2018-02-04 12:40:46,418 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3746 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=1282, Invalid=14213, Unknown=5, NotChecked=0, Total=15500 [2018-02-04 12:40:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-02-04 12:40:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 376. [2018-02-04 12:40:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-04 12:40:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 433 transitions. [2018-02-04 12:40:46,423 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 433 transitions. Word has length 86 [2018-02-04 12:40:46,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:40:46,423 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 433 transitions. [2018-02-04 12:40:46,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 12:40:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 433 transitions. [2018-02-04 12:40:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 12:40:46,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:40:46,423 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:40:46,423 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-04 12:40:46,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1404039900, now seen corresponding path program 1 times [2018-02-04 12:40:46,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:40:46,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:40:46,424 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:40:46,424 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:40:46,424 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:40:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:40:46,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:40:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:40:47,735 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:40:47,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2018-02-04 12:40:47,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 12:40:47,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 12:40:47,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1387, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 12:40:47,736 INFO L87 Difference]: Start difference. First operand 376 states and 433 transitions. Second operand 39 states. [2018-02-04 12:40:53,145 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 96 DAG size of output 83 [2018-02-04 12:40:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:40:53,305 INFO L93 Difference]: Finished difference Result 433 states and 485 transitions. [2018-02-04 12:40:53,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 12:40:53,305 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 86 [2018-02-04 12:40:53,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:40:53,306 INFO L225 Difference]: With dead ends: 433 [2018-02-04 12:40:53,306 INFO L226 Difference]: Without dead ends: 433 [2018-02-04 12:40:53,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=902, Invalid=8410, Unknown=0, NotChecked=0, Total=9312 [2018-02-04 12:40:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-02-04 12:40:53,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 376. [2018-02-04 12:40:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-04 12:40:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 432 transitions. [2018-02-04 12:40:53,312 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 432 transitions. Word has length 86 [2018-02-04 12:40:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:40:53,312 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 432 transitions. [2018-02-04 12:40:53,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 12:40:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 432 transitions. [2018-02-04 12:40:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 12:40:53,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:40:53,313 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-04 12:40:53,313 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-04 12:40:53,314 INFO L82 PathProgramCache]: Analyzing trace with hash 540132495, now seen corresponding path program 1 times [2018-02-04 12:40:53,314 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:40:53,314 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:40:53,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:40:53,314 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:40:53,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:40:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:40:53,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:40:54,631 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-04 12:40:54,631 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:40:54,631 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-04 12:40:54,636 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:40:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:40:54,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:40:54,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:40:54,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:40:54,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:54,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:54,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:40:54,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:16 [2018-02-04 12:40:55,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 12:40:55,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,023 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-04 12:40:55,024 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-04 12:40:55,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,025 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,027 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-04 12:40:55,027 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:10 [2018-02-04 12:40:55,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 12:40:55,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,194 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,202 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-04 12:40:55,202 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:38, output treesize:12 [2018-02-04 12:40:55,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:40:55,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:40:55,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:40:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:40:55,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,598 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-04 12:40:55,599 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:47 [2018-02-04 12:40:55,670 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-04 12:40:55,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:55,673 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-04 12:40:55,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,695 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-04 12:40:55,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:55,698 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-04 12:40:55,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2018-02-04 12:40:55,800 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-04 12:40:55,803 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-04 12:40:55,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:55,832 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-04 12:40:55,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 12:40:55,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 12:40:55,898 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-04 12:40:55,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:55,902 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-04 12:40:55,902 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,913 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,926 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-04 12:40:55,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 92 [2018-02-04 12:40:55,929 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:55,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:55,981 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-04 12:40:55,982 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-04 12:40:56,034 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:40:56,085 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-04 12:40:56,085 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:75, output treesize:327 [2018-02-04 12:40:56,480 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:40:56,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:56,519 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:40:56,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:40:56,569 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-04 12:40:56,569 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:410, output treesize:128 [2018-02-04 12:40:56,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:56,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:56,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:40:56,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:56,766 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-04 12:40:56,768 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-04 12:40:56,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:56,770 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:56,796 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-04 12:40:56,796 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:140, output treesize:115 [2018-02-04 12:40:56,925 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:56,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:56,926 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-04 12:40:56,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:56,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:56,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:56,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:56,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:56,952 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-04 12:40:56,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:56,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:40:56,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:126, output treesize:107 [2018-02-04 12:40:57,085 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-04 12:40:57,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:40:57,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:57,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:57,126 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-04 12:40:57,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:40:57,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:57,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:57,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:40:57,161 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:129, output treesize:121 [2018-02-04 12:40:57,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-04 12:40:57,291 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:57,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 12:40:57,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:57,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:57,336 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-04 12:40:57,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:57,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 12:40:57,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:57,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:57,383 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-04 12:40:57,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:147, output treesize:139 [2018-02-04 12:40:58,033 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:40:58,037 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-04 12:40:58,039 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-04 12:40:58,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:58,053 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:40:58,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:58,055 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-04 12:40:58,056 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-04 12:40:58,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:58,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 12:40:58,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:58,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:40:58,144 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-04 12:40:58,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:58,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 12:40:58,147 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:58,157 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-04 12:40:58,158 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:58,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:58,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:40:58,164 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-04 12:40:58,164 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:40:58,167 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:40:58,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:40:58,174 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:199, output treesize:16 [2018-02-04 12:40:58,461 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-04 12:40:58,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:40:58,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 35] total 73 [2018-02-04 12:40:58,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 12:40:58,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 12:40:58,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=5166, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 12:40:58,492 INFO L87 Difference]: Start difference. First operand 376 states and 432 transitions. Second operand 74 states. [2018-02-04 12:41:00,326 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 136 DAG size of output 92 [2018-02-04 12:41:00,546 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 112 DAG size of output 98 [2018-02-04 12:41:00,733 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 110 DAG size of output 94 [2018-02-04 12:41:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:41:15,540 INFO L93 Difference]: Finished difference Result 416 states and 466 transitions. [2018-02-04 12:41:15,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 12:41:15,540 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 102 [2018-02-04 12:41:15,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:41:15,541 INFO L225 Difference]: With dead ends: 416 [2018-02-04 12:41:15,541 INFO L226 Difference]: Without dead ends: 416 [2018-02-04 12:41:15,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3030 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1262, Invalid=14486, Unknown=2, NotChecked=0, Total=15750 [2018-02-04 12:41:15,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-02-04 12:41:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 373. [2018-02-04 12:41:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-02-04 12:41:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 425 transitions. [2018-02-04 12:41:15,547 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 425 transitions. Word has length 102 [2018-02-04 12:41:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:41:15,547 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 425 transitions. [2018-02-04 12:41:15,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 12:41:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 425 transitions. [2018-02-04 12:41:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 12:41:15,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:41:15,548 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-04 12:41:15,548 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-04 12:41:15,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1592718148, now seen corresponding path program 1 times [2018-02-04 12:41:15,549 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:41:15,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:41:15,549 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:41:15,549 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:41:15,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:41:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:41:15,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:41:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:41:15,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:41:15,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:41:15,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:41:15,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:41:15,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:41:15,757 INFO L87 Difference]: Start difference. First operand 373 states and 425 transitions. Second operand 7 states. [2018-02-04 12:41:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:41:15,960 INFO L93 Difference]: Finished difference Result 372 states and 424 transitions. [2018-02-04 12:41:15,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:41:15,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-02-04 12:41:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:41:15,962 INFO L225 Difference]: With dead ends: 372 [2018-02-04 12:41:15,962 INFO L226 Difference]: Without dead ends: 372 [2018-02-04 12:41:15,962 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:41:15,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-02-04 12:41:15,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2018-02-04 12:41:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-02-04 12:41:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 424 transitions. [2018-02-04 12:41:15,967 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 424 transitions. Word has length 92 [2018-02-04 12:41:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:41:15,967 INFO L432 AbstractCegarLoop]: Abstraction has 372 states and 424 transitions. [2018-02-04 12:41:15,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:41:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 424 transitions. [2018-02-04 12:41:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 12:41:15,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:41:15,968 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-04 12:41:15,968 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-04 12:41:15,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1592718147, now seen corresponding path program 1 times [2018-02-04 12:41:15,969 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:41:15,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:41:15,969 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:41:15,969 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:41:15,970 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:41:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:41:15,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:41:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:41:16,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:41:16,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:41:16,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:41:16,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:41:16,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:41:16,120 INFO L87 Difference]: Start difference. First operand 372 states and 424 transitions. Second operand 7 states. [2018-02-04 12:41:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:41:16,267 INFO L93 Difference]: Finished difference Result 371 states and 423 transitions. [2018-02-04 12:41:16,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:41:16,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-02-04 12:41:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:41:16,269 INFO L225 Difference]: With dead ends: 371 [2018-02-04 12:41:16,269 INFO L226 Difference]: Without dead ends: 371 [2018-02-04 12:41:16,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:41:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-02-04 12:41:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-02-04 12:41:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-02-04 12:41:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 423 transitions. [2018-02-04 12:41:16,273 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 423 transitions. Word has length 92 [2018-02-04 12:41:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:41:16,274 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 423 transitions. [2018-02-04 12:41:16,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:41:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 423 transitions. [2018-02-04 12:41:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 12:41:16,274 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:41:16,274 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-04 12:41:16,275 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-04 12:41:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2132545757, now seen corresponding path program 1 times [2018-02-04 12:41:16,275 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:41:16,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:41:16,275 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:41:16,276 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:41:16,276 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:41:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:41:16,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:41:16,859 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-04 12:41:16,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:41:16,882 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-04 12:41:16,887 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:41:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:41:16,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:41:17,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:41:17,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:41:17,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:17,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:41:17,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:41:17,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-02-04 12:41:17,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:17,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:17,393 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-04 12:41:17,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:17,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:41:17,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2018-02-04 12:41:17,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:17,487 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-04 12:41:17,489 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-04 12:41:17,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:17,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:41:17,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:41:17,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:41:17,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:17,514 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:41:17,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:41:17,522 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:45 [2018-02-04 12:41:17,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 12:41:17,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:17,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 12:41:17,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:17,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:41:17,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:17,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:17,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:17,593 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-04 12:41:17,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:17,606 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-04 12:41:17,606 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 12:41:17,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:41:17,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:41:17,631 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:63 [2018-02-04 12:41:18,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:18,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:18,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:18,291 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:18,294 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-04 12:41:18,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:18,305 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-04 12:41:18,306 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-04 12:41:18,341 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-04 12:41:18,341 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:18,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:18,361 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-04 12:41:18,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:18,379 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-04 12:41:18,379 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:18,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:41:18,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:41:18,406 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:111, output treesize:75 [2018-02-04 12:41:18,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:18,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:18,656 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-04 12:41:18,664 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2018-02-04 12:41:18,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:18,668 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-04 12:41:18,668 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-04 12:41:18,671 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-04 12:41:18,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:41:18,700 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-02-04 12:41:18,826 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-04 12:41:18,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:18,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:18,844 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-04 12:41:18,861 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-04 12:41:18,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:18,929 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-04 12:41:18,929 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:41:18,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:18,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:19,019 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-04 12:41:19,020 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 12:41:19,036 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-04 12:41:19,036 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:19,195 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-04 12:41:19,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:19,289 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-04 12:41:19,290 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-02-04 12:41:19,386 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-04 12:41:19,386 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 12:41:19,512 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-02-04 12:41:19,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:19,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:19,676 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-04 12:41:19,676 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 12:41:19,684 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-04 12:41:19,862 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-04 12:41:19,862 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:19,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:19,937 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-04 12:41:19,938 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-02-04 12:41:20,025 INFO L267 ElimStorePlain]: Start of recursive call 10: 7 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:41:20,124 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-04 12:41:20,128 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 12:41:20,128 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:20,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04 12:41:20,260 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:20,316 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-04 12:41:20,317 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-02-04 12:41:20,352 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:41:20,412 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-04 12:41:20,487 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-04 12:41:20,488 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:111, output treesize:497 [2018-02-04 12:41:21,062 WARN L146 SmtUtils]: Spent 439ms on a formula simplification. DAG size of input: 200 DAG size of output 140 [2018-02-04 12:41:21,455 WARN L143 SmtUtils]: Spent 239ms on a formula simplification that was a NOOP. DAG size: 140 [2018-02-04 12:41:21,775 WARN L143 SmtUtils]: Spent 205ms on a formula simplification that was a NOOP. DAG size: 140 [2018-02-04 12:41:21,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:21,782 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-04 12:41:21,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:21,790 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-04 12:41:21,791 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-04 12:41:21,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 12:41:21,801 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:21,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:41:21,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:21,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:21,910 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-04 12:41:21,926 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-04 12:41:21,929 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-04 12:41:22,212 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-04 12:41:22,213 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:22,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:22,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:22,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:22,471 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-04 12:41:22,472 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-02-04 12:41:22,748 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-04 12:41:22,748 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 12:41:22,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:22,754 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-04 12:41:22,754 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 12:41:22,762 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-04 12:41:22,763 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-04 12:41:22,764 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-04 12:41:22,764 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:23,012 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-04 12:41:23,013 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:23,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, 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-04 12:41:23,222 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:23,440 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-04 12:41:23,440 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-02-04 12:41:23,669 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-04 12:41:23,670 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:23,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:23,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:23,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:23,880 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-04 12:41:23,880 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:24,092 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-04 12:41:24,093 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-04 12:41:24,310 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-04 12:41:24,311 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-04 12:41:24,552 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-04 12:41:24,553 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-04 12:41:24,837 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-04 12:41:24,837 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-04 12:41:25,113 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-04 12:41:25,113 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-04 12:41:25,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, 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-04 12:41:25,390 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-04 12:41:25,666 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-04 12:41:25,667 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-04 12:41:25,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 46 treesize of output 34 [2018-02-04 12:41:25,990 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:26,276 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-04 12:41:26,276 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:26,571 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-04 12:41:26,571 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:26,898 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-04 12:41:26,898 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:27,251 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-04 12:41:27,251 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-04 12:41:27,552 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-04 12:41:27,552 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:27,833 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-04 12:41:27,833 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:28,109 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-04 12:41:28,109 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:28,111 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-04 12:41:28,111 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:28,112 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-04 12:41:28,112 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:28,113 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-04 12:41:28,113 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:28,349 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-04 12:41:28,349 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:28,599 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-04 12:41:28,599 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-04 12:41:28,827 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-04 12:41:28,827 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:29,060 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-04 12:41:29,061 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-04 12:41:29,379 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-04 12:41:29,796 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-04 12:41:29,798 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-04 12:41:29,798 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:29,837 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-04 12:41:29,837 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:29,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-04 12:41:29,875 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:29,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-04 12:41:29,911 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:29,945 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-04 12:41:29,945 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:29,970 INFO L267 ElimStorePlain]: Start of recursive call 40: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:41:30,371 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-04 12:41:30,373 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-04 12:41:30,374 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:30,396 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-04 12:41:30,396 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:30,417 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-04 12:41:30,417 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:30,436 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-04 12:41:30,436 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-04 12:41:30,454 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-04 12:41:30,455 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-04 12:41:30,472 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-04 12:41:30,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:30,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:30,885 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-04 12:41:30,886 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-04 12:41:30,887 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:30,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, 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-04 12:41:30,906 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-04 12:41:30,922 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-04 12:41:30,922 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:30,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:41:30,942 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-04 12:41:30,942 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:30,959 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-04 12:41:30,959 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-04 12:41:30,975 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-04 12:41:31,378 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-04 12:41:31,379 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-04 12:41:31,379 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-02-04 12:41:31,385 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-04 12:41:31,385 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-04 12:41:31,389 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-04 12:41:31,776 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-04 12:41:31,777 INFO L202 ElimStorePlain]: Needed 60 recursive calls to eliminate 25 variables, input treesize:523, output treesize:451 [2018-02-04 12:41:32,148 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-04 12:41:32,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:41:32,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 40] total 69 [2018-02-04 12:41:32,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 12:41:32,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 12:41:32,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=4376, Unknown=3, NotChecked=134, Total=4830 [2018-02-04 12:41:32,191 INFO L87 Difference]: Start difference. First operand 371 states and 423 transitions. Second operand 70 states. [2018-02-04 12:41:36,007 WARN L146 SmtUtils]: Spent 592ms on a formula simplification. DAG size of input: 150 DAG size of output 146 [2018-02-04 12:41:56,569 WARN L146 SmtUtils]: Spent 20483ms on a formula simplification. DAG size of input: 162 DAG size of output 148 [2018-02-04 12:42:08,610 WARN L146 SmtUtils]: Spent 11947ms on a formula simplification. DAG size of input: 210 DAG size of output 155 [2018-02-04 12:42:08,933 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 220 DAG size of output 158 [2018-02-04 12:42:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:42:11,919 INFO L93 Difference]: Finished difference Result 436 states and 487 transitions. [2018-02-04 12:42:11,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 12:42:11,920 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 95 [2018-02-04 12:42:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:42:11,921 INFO L225 Difference]: With dead ends: 436 [2018-02-04 12:42:11,921 INFO L226 Difference]: Without dead ends: 436 [2018-02-04 12:42:11,922 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5042 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=1409, Invalid=15332, Unknown=33, NotChecked=256, Total=17030 [2018-02-04 12:42:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-04 12:42:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 395. [2018-02-04 12:42:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-04 12:42:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 461 transitions. [2018-02-04 12:42:11,927 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 461 transitions. Word has length 95 [2018-02-04 12:42:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:42:11,928 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 461 transitions. [2018-02-04 12:42:11,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 12:42:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 461 transitions. [2018-02-04 12:42:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 12:42:11,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:42:11,928 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-04 12:42:11,928 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-04 12:42:11,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2132545758, now seen corresponding path program 1 times [2018-02-04 12:42:11,928 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:42:11,929 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:42:11,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:42:11,929 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:42:11,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:42:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:42:11,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:42:13,108 WARN L146 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 113 DAG size of output 69 [2018-02-04 12:42:13,328 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-04 12:42:13,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:42:13,328 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-04 12:42:13,333 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:42:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:42:13,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:42:13,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 6 treesize of output 5 [2018-02-04 12:42:13,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:13,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:13,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:42:13,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 12:42:13,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:13,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:13,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 12:42:13,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 12:42:13,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:13,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:42:13,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-02-04 12:42:13,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:42:13,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 12:42:13,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:13,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:13,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:42:13,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-04 12:42:13,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-02-04 12:42:13,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-04 12:42:13,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:13,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:13,804 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-04 12:42:13,807 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-04 12:42:13,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:13,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:13,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:42:13,827 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:38 [2018-02-04 12:42:14,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 12:42:14,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:14,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:42:14,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:64 [2018-02-04 12:42:14,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-04 12:42:14,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:14,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:42:14,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:65 [2018-02-04 12:42:14,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,235 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-04 12:42:14,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, 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-04 12:42:14,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:14,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:14,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,260 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-04 12:42:14,262 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-04 12:42:14,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:14,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:14,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:42:14,277 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:75 [2018-02-04 12:42:14,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,350 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-04 12:42:14,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,360 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-04 12:42:14,361 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-04 12:42:14,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:14,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,427 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-04 12:42:14,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:14,437 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-04 12:42:14,438 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 12:42:14,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:14,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:42:14,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:113, output treesize:100 [2018-02-04 12:42:15,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:15,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:15,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:15,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:15,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:15,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:15,945 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-04 12:42:15,961 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-04 12:42:15,965 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-04 12:42:16,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:16,174 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-04 12:42:16,174 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:16,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:16,176 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-04 12:42:16,177 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:16,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:16,179 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-04 12:42:16,179 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:16,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:16,181 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-04 12:42:16,182 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:16,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:16,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 83 treesize of output 73 [2018-02-04 12:42:16,184 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:16,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:16,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, 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-04 12:42:16,187 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:16,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:16,189 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-04 12:42:16,189 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:16,331 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-04 12:42:16,332 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-04 12:42:16,334 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-04 12:42:16,334 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:16,343 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-04 12:42:16,344 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-02-04 12:42:16,345 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-04 12:42:16,345 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:16,355 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-04 12:42:16,356 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-02-04 12:42:16,366 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-04 12:42:16,366 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-02-04 12:42:16,372 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-04 12:42:16,373 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-02-04 12:42:16,523 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-04 12:42:16,523 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:16,554 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-04 12:42:16,555 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-02-04 12:42:16,565 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-04 12:42:16,566 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-02-04 12:42:16,568 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-04 12:42:16,568 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:16,578 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-04 12:42:16,579 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-02-04 12:42:16,585 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-04 12:42:16,585 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-02-04 12:42:16,596 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-04 12:42:16,596 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-02-04 12:42:16,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-04 12:42:16,703 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-04 12:42:16,773 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-04 12:42:16,774 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:16,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:16,840 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-04 12:42:16,841 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:16,902 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-04 12:42:16,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:16,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:16,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:16,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:16,987 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-04 12:42:16,996 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2018-02-04 12:42:16,996 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,008 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-04 12:42:17,008 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,018 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-04 12:42:17,018 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,026 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-04 12:42:17,027 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,032 INFO L267 ElimStorePlain]: Start of recursive call 28: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,038 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-04 12:42:17,051 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-04 12:42:17,053 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-04 12:42:17,072 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-04 12:42:17,072 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,081 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-04 12:42:17,082 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,090 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-04 12:42:17,090 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,095 INFO L267 ElimStorePlain]: Start of recursive call 33: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,100 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,102 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-04 12:42:17,104 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-04 12:42:17,104 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,129 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-04 12:42:17,129 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,139 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-04 12:42:17,139 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,147 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-04 12:42:17,147 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,152 INFO L267 ElimStorePlain]: Start of recursive call 38: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,158 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-04 12:42:17,167 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2018-02-04 12:42:17,168 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,192 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-04 12:42:17,193 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,212 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-04 12:42:17,212 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,220 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-04 12:42:17,220 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,225 INFO L267 ElimStorePlain]: Start of recursive call 43: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,232 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-04 12:42:17,244 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-04 12:42:17,246 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-04 12:42:17,275 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-04 12:42:17,275 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,286 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-04 12:42:17,286 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,294 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-04 12:42:17,294 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,301 INFO L267 ElimStorePlain]: Start of recursive call 48: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,308 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,309 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-04 12:42:17,320 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2018-02-04 12:42:17,320 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,333 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-04 12:42:17,334 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,344 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-04 12:42:17,345 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,354 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-04 12:42:17,354 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,359 INFO L267 ElimStorePlain]: Start of recursive call 53: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,367 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-04 12:42:17,377 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2018-02-04 12:42:17,377 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,391 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-04 12:42:17,391 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,402 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-04 12:42:17,402 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,411 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-04 12:42:17,411 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,418 INFO L267 ElimStorePlain]: Start of recursive call 58: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,423 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-04 12:42:17,425 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-04 12:42:17,425 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,435 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-04 12:42:17,436 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,443 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-04 12:42:17,443 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,447 INFO L267 ElimStorePlain]: Start of recursive call 63: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:42:17,504 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-04 12:42:17,504 INFO L202 ElimStorePlain]: Needed 66 recursive calls to eliminate 6 variables, input treesize:165, output treesize:34 [2018-02-04 12:42:17,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,862 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-04 12:42:17,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:17,909 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-04 12:42:17,912 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-04 12:42:18,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:18,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:18,045 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:42:18,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:18,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:18,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:18,050 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:18,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:18,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:18,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:18,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:18,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:18,064 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-04 12:42:18,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:18,080 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:42:18,080 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:42:18,119 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-04 12:42:18,120 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-02-04 12:42:18,294 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-04 12:42:30,428 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 12:42:30,428 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 12:42:30,432 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 12:42:30,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:42:30 BoogieIcfgContainer [2018-02-04 12:42:30,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:42:30,433 INFO L168 Benchmark]: Toolchain (without parser) took 188812.26 ms. Allocated memory was 401.1 MB in the beginning and 1.3 GB in the end (delta: 895.5 MB). Free memory was 357.6 MB in the beginning and 910.0 MB in the end (delta: -552.5 MB). Peak memory consumption was 343.0 MB. Max. memory is 5.3 GB. [2018-02-04 12:42:30,435 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 401.1 MB. Free memory is still 362.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:42:30,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.53 ms. Allocated memory is still 401.1 MB. Free memory was 357.6 MB in the beginning and 344.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:42:30,435 INFO L168 Benchmark]: Boogie Preprocessor took 34.55 ms. Allocated memory is still 401.1 MB. Free memory is still 344.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:42:30,435 INFO L168 Benchmark]: RCFGBuilder took 411.49 ms. Allocated memory is still 401.1 MB. Free memory was 341.6 MB in the beginning and 297.9 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 5.3 GB. [2018-02-04 12:42:30,435 INFO L168 Benchmark]: TraceAbstraction took 188195.92 ms. Allocated memory was 401.1 MB in the beginning and 1.3 GB in the end (delta: 895.5 MB). Free memory was 297.9 MB in the beginning and 910.0 MB in the end (delta: -612.1 MB). Peak memory consumption was 283.4 MB. Max. memory is 5.3 GB. [2018-02-04 12:42:30,436 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 401.1 MB. Free memory is still 362.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.53 ms. Allocated memory is still 401.1 MB. Free memory was 357.6 MB in the beginning and 344.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.55 ms. Allocated memory is still 401.1 MB. Free memory is still 344.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 411.49 ms. Allocated memory is still 401.1 MB. Free memory was 341.6 MB in the beginning and 297.9 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 188195.92 ms. Allocated memory was 401.1 MB in the beginning and 1.3 GB in the end (delta: 895.5 MB). Free memory was 297.9 MB in the beginning and 910.0 MB in the end (delta: -612.1 MB). Peak memory consumption was 283.4 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, 188.1s OverallTime, 45 OverallIterations, 2 TraceHistogramMax, 133.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5900 SDtfs, 10837 SDslu, 32835 SDs, 0 SdLazy, 65894 SolverSat, 3286 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 46.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1781 GetRequests, 472 SyntacticMatches, 41 SemanticMatches, 1268 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19328 ImplicationChecksByTransitivity, 97.9s 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, 34.5s 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-04_12-42-30-444.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-04_12-42-30-444.csv Completed graceful shutdown