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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/test-0134_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:59:08,093 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:59:08,095 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:59:08,107 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:59:08,107 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:59:08,108 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:59:08,109 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:59:08,111 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:59:08,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:59:08,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:59:08,113 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:59:08,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:59:08,114 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:59:08,115 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:59:08,116 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:59:08,118 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:59:08,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:59:08,122 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:59:08,123 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:59:08,125 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:59:08,127 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:59:08,127 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:59:08,127 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:59:08,128 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:59:08,129 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:59:08,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:59:08,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:59:08,131 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:59:08,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:59:08,131 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:59:08,132 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:59:08,132 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:59:08,142 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:59:08,143 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:59:08,144 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:59:08,144 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:59:08,144 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:59:08,144 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:59:08,144 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:59:08,145 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:59:08,145 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:59:08,145 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:59:08,146 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:59:08,146 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:59:08,146 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:59:08,146 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:59:08,146 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:59:08,147 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:59:08,147 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:59:08,147 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:59:08,147 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:59:08,147 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:59:08,148 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:59:08,148 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:59:08,148 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:59:08,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:59:08,149 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:59:08,149 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:59:08,149 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:59:08,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:59:08,149 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:59:08,150 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:59:08,150 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:59:08,150 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:59:08,151 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:59:08,151 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:59:08,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:59:08,201 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:59:08,205 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:59:08,206 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:59:08,207 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:59:08,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0134_true-valid-memsafety.i [2018-01-24 11:59:08,385 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:59:08,391 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:59:08,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:59:08,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:59:08,397 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:59:08,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:59:08" (1/1) ... [2018-01-24 11:59:08,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6546250d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:59:08, skipping insertion in model container [2018-01-24 11:59:08,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:59:08" (1/1) ... [2018-01-24 11:59:08,421 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:59:08,463 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:59:08,586 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:59:08,608 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:59:08,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:59:08 WrapperNode [2018-01-24 11:59:08,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:59:08,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:59:08,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:59:08,622 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:59:08,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:59:08" (1/1) ... [2018-01-24 11:59:08,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:59:08" (1/1) ... [2018-01-24 11:59:08,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:59:08" (1/1) ... [2018-01-24 11:59:08,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:59:08" (1/1) ... [2018-01-24 11:59:08,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:59:08" (1/1) ... [2018-01-24 11:59:08,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:59:08" (1/1) ... [2018-01-24 11:59:08,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:59:08" (1/1) ... [2018-01-24 11:59:08,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:59:08,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:59:08,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:59:08,664 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:59:08,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:59:08" (1/1) ... No working directory specified, using /storage/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-01-24 11:59:08,714 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:59:08,715 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:59:08,715 INFO L136 BoogieDeclarations]: Found implementation of procedure list_empty [2018-01-24 11:59:08,715 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-24 11:59:08,715 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-01-24 11:59:08,715 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-01-24 11:59:08,715 INFO L136 BoogieDeclarations]: Found implementation of procedure list_del [2018-01-24 11:59:08,715 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-01-24 11:59:08,715 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-01-24 11:59:08,715 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-01-24 11:59:08,715 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-01-24 11:59:08,716 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-01-24 11:59:08,716 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_seek_max [2018-01-24 11:59:08,716 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-01-24 11:59:08,716 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:59:08,716 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:59:08,716 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:59:08,716 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 11:59:08,716 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 11:59:08,716 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:59:08,716 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:59:08,717 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:59:08,717 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 11:59:08,717 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 11:59:08,717 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:59:08,717 INFO L128 BoogieDeclarations]: Found specification of procedure list_empty [2018-01-24 11:59:08,717 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-24 11:59:08,717 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-01-24 11:59:08,717 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-01-24 11:59:08,717 INFO L128 BoogieDeclarations]: Found specification of procedure list_del [2018-01-24 11:59:08,718 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-01-24 11:59:08,718 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-01-24 11:59:08,718 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-01-24 11:59:08,718 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-01-24 11:59:08,718 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-01-24 11:59:08,718 INFO L128 BoogieDeclarations]: Found specification of procedure gl_seek_max [2018-01-24 11:59:08,718 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-01-24 11:59:08,718 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:59:08,718 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:59:08,718 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:59:09,248 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:59:09,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:59:09 BoogieIcfgContainer [2018-01-24 11:59:09,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:59:09,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:59:09,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:59:09,251 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:59:09,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:59:08" (1/3) ... [2018-01-24 11:59:09,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b44d579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:59:09, skipping insertion in model container [2018-01-24 11:59:09,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:59:08" (2/3) ... [2018-01-24 11:59:09,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b44d579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:59:09, skipping insertion in model container [2018-01-24 11:59:09,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:59:09" (3/3) ... [2018-01-24 11:59:09,254 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0134_true-valid-memsafety.i [2018-01-24 11:59:09,261 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:59:09,268 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-24 11:59:09,321 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:59:09,321 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:59:09,322 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:59:09,322 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:59:09,322 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:59:09,322 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:59:09,322 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:59:09,322 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:59:09,323 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:59:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2018-01-24 11:59:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 11:59:09,354 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:09,355 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 11:59:09,355 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-01-24 11:59:09,360 INFO L82 PathProgramCache]: Analyzing trace with hash 8457694, now seen corresponding path program 1 times [2018-01-24 11:59:09,363 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:09,363 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:09,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:09,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:09,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:09,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:09,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:09,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:59:09,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:59:09,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:59:09,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:59:09,630 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 3 states. [2018-01-24 11:59:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:09,878 INFO L93 Difference]: Finished difference Result 350 states and 392 transitions. [2018-01-24 11:59:09,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:59:09,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 11:59:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:09,896 INFO L225 Difference]: With dead ends: 350 [2018-01-24 11:59:09,896 INFO L226 Difference]: Without dead ends: 179 [2018-01-24 11:59:09,902 INFO L525 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-01-24 11:59:09,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-24 11:59:09,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-01-24 11:59:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-24 11:59:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-01-24 11:59:09,953 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 4 [2018-01-24 11:59:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:09,954 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-01-24 11:59:09,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:59:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-01-24 11:59:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 11:59:09,954 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:09,954 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 11:59:09,954 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-01-24 11:59:09,955 INFO L82 PathProgramCache]: Analyzing trace with hash 8457695, now seen corresponding path program 1 times [2018-01-24 11:59:09,955 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:09,955 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:09,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:09,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:09,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:09,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:10,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:10,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:10,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:59:10,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:59:10,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:59:10,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:59:10,031 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 3 states. [2018-01-24 11:59:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:10,150 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2018-01-24 11:59:10,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:59:10,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 11:59:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:10,153 INFO L225 Difference]: With dead ends: 182 [2018-01-24 11:59:10,153 INFO L226 Difference]: Without dead ends: 180 [2018-01-24 11:59:10,154 INFO L525 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-01-24 11:59:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-24 11:59:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-01-24 11:59:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-24 11:59:10,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2018-01-24 11:59:10,174 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 4 [2018-01-24 11:59:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:10,174 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2018-01-24 11:59:10,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:59:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2018-01-24 11:59:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:59:10,175 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:10,175 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:59:10,175 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-01-24 11:59:10,176 INFO L82 PathProgramCache]: Analyzing trace with hash 809839361, now seen corresponding path program 1 times [2018-01-24 11:59:10,176 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:10,176 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:10,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:10,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:10,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:10,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:10,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:10,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:59:10,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:59:10,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:59:10,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:59:10,260 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand 4 states. [2018-01-24 11:59:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:10,434 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2018-01-24 11:59:10,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:59:10,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 11:59:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:10,437 INFO L225 Difference]: With dead ends: 176 [2018-01-24 11:59:10,437 INFO L226 Difference]: Without dead ends: 175 [2018-01-24 11:59:10,437 INFO L525 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-01-24 11:59:10,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-24 11:59:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-01-24 11:59:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-24 11:59:10,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2018-01-24 11:59:10,452 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 16 [2018-01-24 11:59:10,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:10,453 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2018-01-24 11:59:10,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:59:10,453 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2018-01-24 11:59:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:59:10,453 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:10,453 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:59:10,454 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-01-24 11:59:10,454 INFO L82 PathProgramCache]: Analyzing trace with hash 809839362, now seen corresponding path program 1 times [2018-01-24 11:59:10,454 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:10,454 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:10,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:10,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:10,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:10,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:10,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:10,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:59:10,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:59:10,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:59:10,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:59:10,560 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 4 states. [2018-01-24 11:59:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:10,683 INFO L93 Difference]: Finished difference Result 175 states and 188 transitions. [2018-01-24 11:59:10,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:59:10,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 11:59:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:10,684 INFO L225 Difference]: With dead ends: 175 [2018-01-24 11:59:10,684 INFO L226 Difference]: Without dead ends: 174 [2018-01-24 11:59:10,685 INFO L525 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-01-24 11:59:10,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-24 11:59:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-01-24 11:59:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-24 11:59:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-01-24 11:59:10,698 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 16 [2018-01-24 11:59:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:10,698 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-01-24 11:59:10,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:59:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-01-24 11:59:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:59:10,699 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:10,700 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:59:10,700 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-01-24 11:59:10,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1093319294, now seen corresponding path program 1 times [2018-01-24 11:59:10,700 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:10,701 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:10,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:10,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:10,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:10,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:10,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:10,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:59:10,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:59:10,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:59:10,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:59:10,842 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 7 states. [2018-01-24 11:59:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:11,134 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2018-01-24 11:59:11,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:59:11,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 11:59:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:11,136 INFO L225 Difference]: With dead ends: 183 [2018-01-24 11:59:11,136 INFO L226 Difference]: Without dead ends: 182 [2018-01-24 11:59:11,136 INFO L525 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-01-24 11:59:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-24 11:59:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-01-24 11:59:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-24 11:59:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2018-01-24 11:59:11,148 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 19 [2018-01-24 11:59:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:11,148 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2018-01-24 11:59:11,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:59:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2018-01-24 11:59:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:59:11,149 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:11,150 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:59:11,150 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-01-24 11:59:11,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1093319295, now seen corresponding path program 1 times [2018-01-24 11:59:11,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:11,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:11,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:11,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:11,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:11,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:11,331 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:11,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:59:11,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:59:11,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:59:11,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:59:11,332 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand 9 states. [2018-01-24 11:59:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:11,817 INFO L93 Difference]: Finished difference Result 181 states and 194 transitions. [2018-01-24 11:59:11,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:59:11,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 11:59:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:11,819 INFO L225 Difference]: With dead ends: 181 [2018-01-24 11:59:11,819 INFO L226 Difference]: Without dead ends: 177 [2018-01-24 11:59:11,819 INFO L525 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-01-24 11:59:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-24 11:59:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-01-24 11:59:11,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-24 11:59:11,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2018-01-24 11:59:11,831 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 19 [2018-01-24 11:59:11,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:11,831 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2018-01-24 11:59:11,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:59:11,831 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2018-01-24 11:59:11,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:59:11,832 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:11,832 INFO L322 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-01-24 11:59:11,832 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-01-24 11:59:11,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1956678693, now seen corresponding path program 1 times [2018-01-24 11:59:11,833 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:11,833 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:11,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:11,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:11,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:11,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:11,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:11,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 11:59:11,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 11:59:11,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 11:59:11,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:59:11,986 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 10 states. [2018-01-24 11:59:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:12,334 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2018-01-24 11:59:12,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 11:59:12,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 11:59:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:12,336 INFO L225 Difference]: With dead ends: 204 [2018-01-24 11:59:12,336 INFO L226 Difference]: Without dead ends: 203 [2018-01-24 11:59:12,337 INFO L525 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-01-24 11:59:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-24 11:59:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 195. [2018-01-24 11:59:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-24 11:59:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 216 transitions. [2018-01-24 11:59:12,350 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 216 transitions. Word has length 22 [2018-01-24 11:59:12,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:12,350 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 216 transitions. [2018-01-24 11:59:12,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 11:59:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2018-01-24 11:59:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:59:12,351 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:12,351 INFO L322 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-01-24 11:59:12,351 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-01-24 11:59:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1956678692, now seen corresponding path program 1 times [2018-01-24 11:59:12,351 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:12,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:12,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:12,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:12,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:12,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:12,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:12,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 11:59:12,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:59:12,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:59:12,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:59:12,646 INFO L87 Difference]: Start difference. First operand 195 states and 216 transitions. Second operand 11 states. [2018-01-24 11:59:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:13,752 INFO L93 Difference]: Finished difference Result 363 states and 387 transitions. [2018-01-24 11:59:13,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 11:59:13,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-01-24 11:59:13,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:13,755 INFO L225 Difference]: With dead ends: 363 [2018-01-24 11:59:13,755 INFO L226 Difference]: Without dead ends: 362 [2018-01-24 11:59:13,756 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-01-24 11:59:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-01-24 11:59:13,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 290. [2018-01-24 11:59:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-01-24 11:59:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 356 transitions. [2018-01-24 11:59:13,776 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 356 transitions. Word has length 22 [2018-01-24 11:59:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:13,777 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 356 transitions. [2018-01-24 11:59:13,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:59:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 356 transitions. [2018-01-24 11:59:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:59:13,778 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:13,778 INFO L322 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-01-24 11:59:13,778 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-01-24 11:59:13,778 INFO L82 PathProgramCache]: Analyzing trace with hash -527497365, now seen corresponding path program 1 times [2018-01-24 11:59:13,778 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:13,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:13,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:13,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:13,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:13,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:13,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:13,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:59:13,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:59:13,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:59:13,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:59:13,900 INFO L87 Difference]: Start difference. First operand 290 states and 356 transitions. Second operand 7 states. [2018-01-24 11:59:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:14,290 INFO L93 Difference]: Finished difference Result 304 states and 370 transitions. [2018-01-24 11:59:14,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:59:14,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 11:59:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:14,294 INFO L225 Difference]: With dead ends: 304 [2018-01-24 11:59:14,294 INFO L226 Difference]: Without dead ends: 302 [2018-01-24 11:59:14,295 INFO L525 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-01-24 11:59:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-01-24 11:59:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 206. [2018-01-24 11:59:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-24 11:59:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2018-01-24 11:59:14,315 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 23 [2018-01-24 11:59:14,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:14,315 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2018-01-24 11:59:14,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:59:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2018-01-24 11:59:14,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:59:14,316 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:14,316 INFO L322 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-01-24 11:59:14,316 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-01-24 11:59:14,317 INFO L82 PathProgramCache]: Analyzing trace with hash -527497364, now seen corresponding path program 1 times [2018-01-24 11:59:14,317 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:14,317 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:14,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:14,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:14,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:14,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:14,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:14,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:59:14,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:59:14,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:59:14,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:59:14,452 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand 8 states. [2018-01-24 11:59:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:14,858 INFO L93 Difference]: Finished difference Result 212 states and 227 transitions. [2018-01-24 11:59:14,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:59:14,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-24 11:59:14,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:14,861 INFO L225 Difference]: With dead ends: 212 [2018-01-24 11:59:14,861 INFO L226 Difference]: Without dead ends: 210 [2018-01-24 11:59:14,861 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:59:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-24 11:59:14,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 206. [2018-01-24 11:59:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-24 11:59:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 223 transitions. [2018-01-24 11:59:14,880 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 223 transitions. Word has length 23 [2018-01-24 11:59:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:14,881 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 223 transitions. [2018-01-24 11:59:14,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:59:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 223 transitions. [2018-01-24 11:59:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 11:59:14,882 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:14,882 INFO L322 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-01-24 11:59:14,882 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-01-24 11:59:14,882 INFO L82 PathProgramCache]: Analyzing trace with hash -118827570, now seen corresponding path program 1 times [2018-01-24 11:59:14,882 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:14,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:14,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:14,884 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:14,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:14,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:14,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:14,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:59:14,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:59:14,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:59:14,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:59:14,945 INFO L87 Difference]: Start difference. First operand 206 states and 223 transitions. Second operand 5 states. [2018-01-24 11:59:15,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:15,141 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2018-01-24 11:59:15,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:59:15,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 11:59:15,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:15,143 INFO L225 Difference]: With dead ends: 206 [2018-01-24 11:59:15,144 INFO L226 Difference]: Without dead ends: 205 [2018-01-24 11:59:15,144 INFO L525 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-01-24 11:59:15,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-24 11:59:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-01-24 11:59:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-01-24 11:59:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 220 transitions. [2018-01-24 11:59:15,161 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 220 transitions. Word has length 25 [2018-01-24 11:59:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:15,161 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 220 transitions. [2018-01-24 11:59:15,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:59:15,161 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 220 transitions. [2018-01-24 11:59:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 11:59:15,162 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:15,162 INFO L322 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-01-24 11:59:15,162 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-01-24 11:59:15,163 INFO L82 PathProgramCache]: Analyzing trace with hash -118827569, now seen corresponding path program 1 times [2018-01-24 11:59:15,163 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:15,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:15,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:15,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:15,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:15,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:15,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:15,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:59:15,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:59:15,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:59:15,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:59:15,322 INFO L87 Difference]: Start difference. First operand 205 states and 220 transitions. Second operand 8 states. [2018-01-24 11:59:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:15,474 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2018-01-24 11:59:15,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:59:15,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 11:59:15,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:15,477 INFO L225 Difference]: With dead ends: 208 [2018-01-24 11:59:15,477 INFO L226 Difference]: Without dead ends: 207 [2018-01-24 11:59:15,478 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:59:15,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-24 11:59:15,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-01-24 11:59:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-01-24 11:59:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 218 transitions. [2018-01-24 11:59:15,497 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 218 transitions. Word has length 25 [2018-01-24 11:59:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:15,497 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 218 transitions. [2018-01-24 11:59:15,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:59:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 218 transitions. [2018-01-24 11:59:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 11:59:15,499 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:15,499 INFO L322 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-01-24 11:59:15,499 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-01-24 11:59:15,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1902858492, now seen corresponding path program 1 times [2018-01-24 11:59:15,499 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:15,500 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:15,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:15,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:15,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:15,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:15,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:15,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:59:15,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:59:15,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:59:15,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:59:15,646 INFO L87 Difference]: Start difference. First operand 205 states and 218 transitions. Second operand 9 states. [2018-01-24 11:59:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:16,293 INFO L93 Difference]: Finished difference Result 205 states and 218 transitions. [2018-01-24 11:59:16,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:59:16,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-01-24 11:59:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:16,295 INFO L225 Difference]: With dead ends: 205 [2018-01-24 11:59:16,295 INFO L226 Difference]: Without dead ends: 204 [2018-01-24 11:59:16,296 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-01-24 11:59:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-24 11:59:16,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-01-24 11:59:16,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-24 11:59:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 217 transitions. [2018-01-24 11:59:16,313 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 217 transitions. Word has length 41 [2018-01-24 11:59:16,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:16,314 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 217 transitions. [2018-01-24 11:59:16,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:59:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 217 transitions. [2018-01-24 11:59:16,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 11:59:16,315 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:16,316 INFO L322 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-01-24 11:59:16,316 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-01-24 11:59:16,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1902858493, now seen corresponding path program 1 times [2018-01-24 11:59:16,316 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:16,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:16,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:16,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:16,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:16,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:16,493 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:16,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 11:59:16,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:59:16,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:59:16,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:59:16,495 INFO L87 Difference]: Start difference. First operand 204 states and 217 transitions. Second operand 11 states. [2018-01-24 11:59:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:17,178 INFO L93 Difference]: Finished difference Result 204 states and 217 transitions. [2018-01-24 11:59:17,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:59:17,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-01-24 11:59:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:17,181 INFO L225 Difference]: With dead ends: 204 [2018-01-24 11:59:17,181 INFO L226 Difference]: Without dead ends: 203 [2018-01-24 11:59:17,182 INFO L525 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-01-24 11:59:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-24 11:59:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-01-24 11:59:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-24 11:59:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 216 transitions. [2018-01-24 11:59:17,198 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 216 transitions. Word has length 41 [2018-01-24 11:59:17,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:17,199 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 216 transitions. [2018-01-24 11:59:17,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:59:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 216 transitions. [2018-01-24 11:59:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 11:59:17,200 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:17,200 INFO L322 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-01-24 11:59:17,200 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-01-24 11:59:17,201 INFO L82 PathProgramCache]: Analyzing trace with hash 873260496, now seen corresponding path program 1 times [2018-01-24 11:59:17,201 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:17,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:17,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:17,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:17,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:17,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:17,528 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:59:17,528 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:59:17,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:17,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:59:18,496 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-01-24 11:59:18,499 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-01-24 11:59:18,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:18,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:18,515 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-01-24 11:59:18,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-01-24 11:59:18,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:59:18,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:59:18,756 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:59:18,759 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-01-24 11:59:18,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:18,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:18,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2018-01-24 11:59:18,893 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-01-24 11:59:18,898 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-01-24 11:59:18,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:18,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:18,917 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-01-24 11:59:18,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:35 [2018-01-24 11:59:19,125 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-01-24 11:59:19,128 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-01-24 11:59:19,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:19,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:19,150 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-01-24 11:59:19,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-01-24 11:59:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:19,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:59:19,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2018-01-24 11:59:19,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-24 11:59:19,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-24 11:59:19,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 11:59:19,369 INFO L87 Difference]: Start difference. First operand 203 states and 216 transitions. Second operand 34 states. [2018-01-24 11:59:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:21,367 INFO L93 Difference]: Finished difference Result 292 states and 310 transitions. [2018-01-24 11:59:21,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-24 11:59:21,367 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2018-01-24 11:59:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:21,369 INFO L225 Difference]: With dead ends: 292 [2018-01-24 11:59:21,369 INFO L226 Difference]: Without dead ends: 291 [2018-01-24 11:59:21,370 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=348, Invalid=2304, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 11:59:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-01-24 11:59:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 212. [2018-01-24 11:59:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-24 11:59:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 224 transitions. [2018-01-24 11:59:21,395 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 224 transitions. Word has length 48 [2018-01-24 11:59:21,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:21,396 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 224 transitions. [2018-01-24 11:59:21,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-24 11:59:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 224 transitions. [2018-01-24 11:59:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 11:59:21,397 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:21,397 INFO L322 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-01-24 11:59:21,397 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-01-24 11:59:21,397 INFO L82 PathProgramCache]: Analyzing trace with hash 873260497, now seen corresponding path program 1 times [2018-01-24 11:59:21,397 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:21,398 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:21,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:21,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:21,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:21,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:21,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:59:21,860 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:59:21,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:21,916 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:59:21,987 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-01-24 11:59:21,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:21,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:21,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 11:59:22,224 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-01-24 11:59:22,226 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-01-24 11:59:22,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,242 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-01-24 11:59:22,244 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-01-24 11:59:22,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,252 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-01-24 11:59:22,252 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-01-24 11:59:22,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:59:22,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:59:22,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:59:22,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,383 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-01-24 11:59:22,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:36 [2018-01-24 11:59:22,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-01-24 11:59:22,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-24 11:59:22,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,479 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-01-24 11:59:22,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 12 treesize of output 1 [2018-01-24 11:59:22,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,492 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-01-24 11:59:22,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:36 [2018-01-24 11:59:22,634 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-01-24 11:59:22,636 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-01-24 11:59:22,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,646 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-01-24 11:59:22,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 11:59:22,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:22,655 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-01-24 11:59:22,655 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:17 [2018-01-24 11:59:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:22,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:59:22,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 37 [2018-01-24 11:59:22,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-24 11:59:22,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-24 11:59:22,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 11:59:22,761 INFO L87 Difference]: Start difference. First operand 212 states and 224 transitions. Second operand 38 states. [2018-01-24 11:59:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:24,830 INFO L93 Difference]: Finished difference Result 274 states and 288 transitions. [2018-01-24 11:59:24,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-24 11:59:24,831 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 48 [2018-01-24 11:59:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:24,833 INFO L225 Difference]: With dead ends: 274 [2018-01-24 11:59:24,833 INFO L226 Difference]: Without dead ends: 273 [2018-01-24 11:59:24,834 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=411, Invalid=3129, Unknown=0, NotChecked=0, Total=3540 [2018-01-24 11:59:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-01-24 11:59:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 195. [2018-01-24 11:59:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-24 11:59:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 210 transitions. [2018-01-24 11:59:24,857 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 210 transitions. Word has length 48 [2018-01-24 11:59:24,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:24,858 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 210 transitions. [2018-01-24 11:59:24,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-24 11:59:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 210 transitions. [2018-01-24 11:59:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 11:59:24,859 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:24,859 INFO L322 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-01-24 11:59:24,859 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-01-24 11:59:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1302970133, now seen corresponding path program 1 times [2018-01-24 11:59:24,859 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:24,860 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:24,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:24,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:24,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:24,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:24,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:24,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:59:24,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:59:24,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:59:24,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:59:24,907 INFO L87 Difference]: Start difference. First operand 195 states and 210 transitions. Second operand 3 states. [2018-01-24 11:59:25,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:25,001 INFO L93 Difference]: Finished difference Result 195 states and 210 transitions. [2018-01-24 11:59:25,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:59:25,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-01-24 11:59:25,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:25,003 INFO L225 Difference]: With dead ends: 195 [2018-01-24 11:59:25,003 INFO L226 Difference]: Without dead ends: 193 [2018-01-24 11:59:25,004 INFO L525 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-01-24 11:59:25,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-24 11:59:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-01-24 11:59:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-24 11:59:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 208 transitions. [2018-01-24 11:59:25,024 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 208 transitions. Word has length 48 [2018-01-24 11:59:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:25,025 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 208 transitions. [2018-01-24 11:59:25,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:59:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 208 transitions. [2018-01-24 11:59:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 11:59:25,026 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:25,026 INFO L322 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-01-24 11:59:25,026 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-01-24 11:59:25,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1302970134, now seen corresponding path program 1 times [2018-01-24 11:59:25,027 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:25,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:25,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:25,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:25,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:25,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:25,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:25,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:59:25,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:59:25,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:59:25,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:59:25,096 INFO L87 Difference]: Start difference. First operand 193 states and 208 transitions. Second operand 3 states. [2018-01-24 11:59:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:25,193 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2018-01-24 11:59:25,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:59:25,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-01-24 11:59:25,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:25,195 INFO L225 Difference]: With dead ends: 193 [2018-01-24 11:59:25,195 INFO L226 Difference]: Without dead ends: 191 [2018-01-24 11:59:25,196 INFO L525 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-01-24 11:59:25,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-24 11:59:25,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-01-24 11:59:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-24 11:59:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2018-01-24 11:59:25,215 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 206 transitions. Word has length 48 [2018-01-24 11:59:25,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:25,216 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 206 transitions. [2018-01-24 11:59:25,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:59:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 206 transitions. [2018-01-24 11:59:25,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 11:59:25,217 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:25,217 INFO L322 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-01-24 11:59:25,217 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-01-24 11:59:25,217 INFO L82 PathProgramCache]: Analyzing trace with hash 467934037, now seen corresponding path program 1 times [2018-01-24 11:59:25,217 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:25,217 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:25,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:25,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:25,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:25,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:25,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:25,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 11:59:25,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:59:25,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:59:25,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:59:25,477 INFO L87 Difference]: Start difference. First operand 191 states and 206 transitions. Second operand 11 states. [2018-01-24 11:59:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:26,315 INFO L93 Difference]: Finished difference Result 277 states and 303 transitions. [2018-01-24 11:59:26,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 11:59:26,315 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-01-24 11:59:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:26,317 INFO L225 Difference]: With dead ends: 277 [2018-01-24 11:59:26,317 INFO L226 Difference]: Without dead ends: 275 [2018-01-24 11:59:26,317 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-01-24 11:59:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-01-24 11:59:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 193. [2018-01-24 11:59:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-24 11:59:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 209 transitions. [2018-01-24 11:59:26,340 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 209 transitions. Word has length 55 [2018-01-24 11:59:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:26,341 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 209 transitions. [2018-01-24 11:59:26,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:59:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 209 transitions. [2018-01-24 11:59:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 11:59:26,342 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:26,342 INFO L322 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-01-24 11:59:26,342 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-01-24 11:59:26,342 INFO L82 PathProgramCache]: Analyzing trace with hash 467934038, now seen corresponding path program 1 times [2018-01-24 11:59:26,342 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:26,342 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:26,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:26,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:26,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:26,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:26,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:26,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 11:59:26,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:59:26,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:59:26,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:59:26,681 INFO L87 Difference]: Start difference. First operand 193 states and 209 transitions. Second operand 12 states. [2018-01-24 11:59:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:27,504 INFO L93 Difference]: Finished difference Result 225 states and 241 transitions. [2018-01-24 11:59:27,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:59:27,504 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-01-24 11:59:27,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:27,506 INFO L225 Difference]: With dead ends: 225 [2018-01-24 11:59:27,506 INFO L226 Difference]: Without dead ends: 223 [2018-01-24 11:59:27,506 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-01-24 11:59:27,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-24 11:59:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2018-01-24 11:59:27,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-24 11:59:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2018-01-24 11:59:27,525 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 55 [2018-01-24 11:59:27,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:27,525 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2018-01-24 11:59:27,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:59:27,525 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2018-01-24 11:59:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-24 11:59:27,526 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:27,526 INFO L322 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-01-24 11:59:27,526 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-01-24 11:59:27,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1242217214, now seen corresponding path program 1 times [2018-01-24 11:59:27,526 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:27,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:27,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:27,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:27,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:27,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:27,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:27,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 11:59:27,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 11:59:27,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 11:59:27,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-01-24 11:59:27,795 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand 16 states. [2018-01-24 11:59:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:28,937 INFO L93 Difference]: Finished difference Result 238 states and 261 transitions. [2018-01-24 11:59:28,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-24 11:59:28,938 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-01-24 11:59:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:28,939 INFO L225 Difference]: With dead ends: 238 [2018-01-24 11:59:28,939 INFO L226 Difference]: Without dead ends: 233 [2018-01-24 11:59:28,939 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2018-01-24 11:59:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-24 11:59:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 196. [2018-01-24 11:59:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-24 11:59:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 210 transitions. [2018-01-24 11:59:28,956 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 210 transitions. Word has length 58 [2018-01-24 11:59:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:28,956 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 210 transitions. [2018-01-24 11:59:28,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 11:59:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2018-01-24 11:59:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 11:59:28,957 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:28,957 INFO L322 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-01-24 11:59:28,957 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-01-24 11:59:28,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1552523800, now seen corresponding path program 1 times [2018-01-24 11:59:28,957 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:28,957 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:28,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:28,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:28,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:28,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:29,510 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:59:29,510 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:59:29,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:29,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:59:29,700 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-01-24 11:59:29,702 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-01-24 11:59:29,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:29,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:29,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:29,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-24 11:59:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:29,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:59:29,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 28 [2018-01-24 11:59:29,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 11:59:29,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 11:59:29,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2018-01-24 11:59:29,762 INFO L87 Difference]: Start difference. First operand 196 states and 210 transitions. Second operand 28 states. [2018-01-24 11:59:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:31,313 INFO L93 Difference]: Finished difference Result 221 states and 232 transitions. [2018-01-24 11:59:31,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-24 11:59:31,313 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-01-24 11:59:31,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:31,315 INFO L225 Difference]: With dead ends: 221 [2018-01-24 11:59:31,315 INFO L226 Difference]: Without dead ends: 192 [2018-01-24 11:59:31,316 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=458, Invalid=3202, Unknown=0, NotChecked=0, Total=3660 [2018-01-24 11:59:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-24 11:59:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 174. [2018-01-24 11:59:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-24 11:59:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 182 transitions. [2018-01-24 11:59:31,332 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 182 transitions. Word has length 60 [2018-01-24 11:59:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:31,332 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 182 transitions. [2018-01-24 11:59:31,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 11:59:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 182 transitions. [2018-01-24 11:59:31,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-24 11:59:31,332 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:31,332 INFO L322 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-01-24 11:59:31,333 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-01-24 11:59:31,333 INFO L82 PathProgramCache]: Analyzing trace with hash 11633541, now seen corresponding path program 1 times [2018-01-24 11:59:31,333 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:31,333 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:31,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:31,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:31,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:31,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 11:59:31,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:31,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 11:59:31,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:59:31,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:59:31,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:59:31,645 INFO L87 Difference]: Start difference. First operand 174 states and 182 transitions. Second operand 17 states. [2018-01-24 11:59:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:32,409 INFO L93 Difference]: Finished difference Result 267 states and 289 transitions. [2018-01-24 11:59:32,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 11:59:32,409 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-01-24 11:59:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:32,411 INFO L225 Difference]: With dead ends: 267 [2018-01-24 11:59:32,411 INFO L226 Difference]: Without dead ends: 265 [2018-01-24 11:59:32,412 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-01-24 11:59:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-01-24 11:59:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 210. [2018-01-24 11:59:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-24 11:59:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 227 transitions. [2018-01-24 11:59:32,444 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 227 transitions. Word has length 65 [2018-01-24 11:59:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:32,444 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 227 transitions. [2018-01-24 11:59:32,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:59:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 227 transitions. [2018-01-24 11:59:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-24 11:59:32,445 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:32,445 INFO L322 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-01-24 11:59:32,445 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-01-24 11:59:32,446 INFO L82 PathProgramCache]: Analyzing trace with hash 11633542, now seen corresponding path program 1 times [2018-01-24 11:59:32,446 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:32,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:32,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:32,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:32,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:32,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 11:59:33,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:33,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-01-24 11:59:33,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 11:59:33,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 11:59:33,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:59:33,031 INFO L87 Difference]: Start difference. First operand 210 states and 227 transitions. Second operand 19 states. [2018-01-24 11:59:34,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:34,097 INFO L93 Difference]: Finished difference Result 260 states and 280 transitions. [2018-01-24 11:59:34,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-24 11:59:34,097 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-01-24 11:59:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:34,099 INFO L225 Difference]: With dead ends: 260 [2018-01-24 11:59:34,099 INFO L226 Difference]: Without dead ends: 258 [2018-01-24 11:59:34,100 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=1057, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 11:59:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-01-24 11:59:34,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 210. [2018-01-24 11:59:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-24 11:59:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 225 transitions. [2018-01-24 11:59:34,161 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 225 transitions. Word has length 65 [2018-01-24 11:59:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:34,162 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 225 transitions. [2018-01-24 11:59:34,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 11:59:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 225 transitions. [2018-01-24 11:59:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-24 11:59:34,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:34,163 INFO L322 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-01-24 11:59:34,163 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-01-24 11:59:34,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1238238810, now seen corresponding path program 1 times [2018-01-24 11:59:34,163 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:34,164 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:34,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:34,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:34,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:34,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 11:59:34,247 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:34,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:59:34,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:59:34,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:59:34,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:59:34,249 INFO L87 Difference]: Start difference. First operand 210 states and 225 transitions. Second operand 5 states. [2018-01-24 11:59:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:34,401 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2018-01-24 11:59:34,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:59:34,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-01-24 11:59:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:34,403 INFO L225 Difference]: With dead ends: 218 [2018-01-24 11:59:34,403 INFO L226 Difference]: Without dead ends: 217 [2018-01-24 11:59:34,403 INFO L525 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-01-24 11:59:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-24 11:59:34,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-01-24 11:59:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-24 11:59:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 232 transitions. [2018-01-24 11:59:34,438 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 232 transitions. Word has length 67 [2018-01-24 11:59:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:34,438 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 232 transitions. [2018-01-24 11:59:34,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:59:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 232 transitions. [2018-01-24 11:59:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-24 11:59:34,439 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:34,439 INFO L322 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-01-24 11:59:34,439 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-01-24 11:59:34,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1238238809, now seen corresponding path program 1 times [2018-01-24 11:59:34,440 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:34,440 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:34,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:34,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:34,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:34,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 11:59:34,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:34,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:59:34,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:59:34,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:59:34,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:59:34,541 INFO L87 Difference]: Start difference. First operand 216 states and 232 transitions. Second operand 5 states. [2018-01-24 11:59:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:34,801 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-01-24 11:59:34,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:59:34,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-01-24 11:59:34,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:34,803 INFO L225 Difference]: With dead ends: 217 [2018-01-24 11:59:34,804 INFO L226 Difference]: Without dead ends: 216 [2018-01-24 11:59:34,804 INFO L525 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-01-24 11:59:34,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-01-24 11:59:34,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-01-24 11:59:34,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-24 11:59:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2018-01-24 11:59:34,839 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 67 [2018-01-24 11:59:34,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:34,840 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2018-01-24 11:59:34,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:59:34,840 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2018-01-24 11:59:34,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-24 11:59:34,841 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:34,841 INFO L322 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-01-24 11:59:34,841 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-01-24 11:59:34,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1238184798, now seen corresponding path program 1 times [2018-01-24 11:59:34,841 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:34,842 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:34,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:34,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:34,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:34,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 11:59:34,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:34,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:59:34,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:59:34,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:59:34,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:59:34,900 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 5 states. [2018-01-24 11:59:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:34,957 INFO L93 Difference]: Finished difference Result 352 states and 375 transitions. [2018-01-24 11:59:34,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:59:34,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-01-24 11:59:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:34,959 INFO L225 Difference]: With dead ends: 352 [2018-01-24 11:59:34,959 INFO L226 Difference]: Without dead ends: 222 [2018-01-24 11:59:34,960 INFO L525 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-01-24 11:59:34,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-24 11:59:34,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-01-24 11:59:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-24 11:59:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 237 transitions. [2018-01-24 11:59:34,993 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 237 transitions. Word has length 67 [2018-01-24 11:59:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:34,993 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 237 transitions. [2018-01-24 11:59:34,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:59:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 237 transitions. [2018-01-24 11:59:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-24 11:59:34,994 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:34,994 INFO L322 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-01-24 11:59:34,994 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-01-24 11:59:34,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1101923251, now seen corresponding path program 1 times [2018-01-24 11:59:34,995 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:34,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:34,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:34,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:34,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:35,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:35,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 11:59:35,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:35,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:59:35,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:59:35,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:59:35,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:59:35,150 INFO L87 Difference]: Start difference. First operand 222 states and 237 transitions. Second operand 9 states. [2018-01-24 11:59:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:35,401 INFO L93 Difference]: Finished difference Result 245 states and 263 transitions. [2018-01-24 11:59:35,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:59:35,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-01-24 11:59:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:35,402 INFO L225 Difference]: With dead ends: 245 [2018-01-24 11:59:35,403 INFO L226 Difference]: Without dead ends: 244 [2018-01-24 11:59:35,403 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:59:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-01-24 11:59:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 237. [2018-01-24 11:59:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-24 11:59:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 259 transitions. [2018-01-24 11:59:35,425 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 259 transitions. Word has length 70 [2018-01-24 11:59:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:35,425 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 259 transitions. [2018-01-24 11:59:35,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:59:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 259 transitions. [2018-01-24 11:59:35,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-24 11:59:35,426 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:35,426 INFO L322 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-01-24 11:59:35,426 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-01-24 11:59:35,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1101923252, now seen corresponding path program 1 times [2018-01-24 11:59:35,426 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:35,426 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:35,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:35,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:35,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:35,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 11:59:35,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:35,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:59:35,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:59:35,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:59:35,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:59:35,615 INFO L87 Difference]: Start difference. First operand 237 states and 259 transitions. Second operand 9 states. [2018-01-24 11:59:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:36,524 INFO L93 Difference]: Finished difference Result 244 states and 262 transitions. [2018-01-24 11:59:36,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:59:36,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-01-24 11:59:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:36,559 INFO L225 Difference]: With dead ends: 244 [2018-01-24 11:59:36,559 INFO L226 Difference]: Without dead ends: 243 [2018-01-24 11:59:36,560 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:59:36,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-24 11:59:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2018-01-24 11:59:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-24 11:59:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 258 transitions. [2018-01-24 11:59:36,595 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 258 transitions. Word has length 70 [2018-01-24 11:59:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:36,595 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 258 transitions. [2018-01-24 11:59:36,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:59:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 258 transitions. [2018-01-24 11:59:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-24 11:59:36,596 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:36,596 INFO L322 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-01-24 11:59:36,597 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-01-24 11:59:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash -200117613, now seen corresponding path program 1 times [2018-01-24 11:59:36,597 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:36,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:36,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:36,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:36,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:36,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 11:59:36,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:36,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 11:59:36,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 11:59:36,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 11:59:36,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:59:36,688 INFO L87 Difference]: Start difference. First operand 237 states and 258 transitions. Second operand 10 states. [2018-01-24 11:59:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:37,025 INFO L93 Difference]: Finished difference Result 250 states and 270 transitions. [2018-01-24 11:59:37,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:59:37,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-01-24 11:59:37,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:37,027 INFO L225 Difference]: With dead ends: 250 [2018-01-24 11:59:37,027 INFO L226 Difference]: Without dead ends: 249 [2018-01-24 11:59:37,027 INFO L525 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-01-24 11:59:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-01-24 11:59:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 244. [2018-01-24 11:59:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-24 11:59:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 268 transitions. [2018-01-24 11:59:37,056 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 268 transitions. Word has length 71 [2018-01-24 11:59:37,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:37,056 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 268 transitions. [2018-01-24 11:59:37,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 11:59:37,056 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 268 transitions. [2018-01-24 11:59:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-24 11:59:37,057 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:37,057 INFO L322 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-01-24 11:59:37,057 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-01-24 11:59:37,058 INFO L82 PathProgramCache]: Analyzing trace with hash -200117612, now seen corresponding path program 1 times [2018-01-24 11:59:37,058 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:37,058 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:37,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:37,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:37,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:37,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 11:59:37,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:59:37,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 11:59:37,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:59:37,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:59:37,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:59:37,281 INFO L87 Difference]: Start difference. First operand 244 states and 268 transitions. Second operand 12 states. [2018-01-24 11:59:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:59:37,686 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2018-01-24 11:59:37,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:59:37,687 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-01-24 11:59:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:59:37,688 INFO L225 Difference]: With dead ends: 249 [2018-01-24 11:59:37,688 INFO L226 Difference]: Without dead ends: 248 [2018-01-24 11:59:37,688 INFO L525 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-01-24 11:59:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-24 11:59:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2018-01-24 11:59:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-24 11:59:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 266 transitions. [2018-01-24 11:59:37,712 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 266 transitions. Word has length 71 [2018-01-24 11:59:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:59:37,712 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 266 transitions. [2018-01-24 11:59:37,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:59:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 266 transitions. [2018-01-24 11:59:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-24 11:59:37,713 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:59:37,713 INFO L322 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-01-24 11:59:37,713 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-01-24 11:59:37,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1908678729, now seen corresponding path program 1 times [2018-01-24 11:59:37,714 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:59:37,714 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:59:37,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:37,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:37,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:59:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:37,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:59:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 11:59:38,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:59:38,147 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:59:38,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:59:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:59:38,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:59:38,375 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-01-24 11:59:38,376 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-01-24 11:59:38,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:38,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:38,381 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-01-24 11:59:38,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-01-24 11:59:38,457 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:59:38,458 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:59:38,458 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-01-24 11:59:38,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:38,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:38,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-01-24 11:59:38,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-01-24 11:59:38,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 11:59:38,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:38,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:38,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:38,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-24 11:59:38,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-01-24 11:59:38,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:59:38,536 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-01-24 11:59:38,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:59:38,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:59:38,551 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-01-24 11:59:38,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-01-24 11:59:39,086 WARN L143 SmtUtils]: Spent 189ms on a formula simplification that was a NOOP. DAG size: 33 [2018-01-24 11:59:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:59:39,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:59:39,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 36 [2018-01-24 11:59:39,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-24 11:59:39,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-24 11:59:39,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1140, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 11:59:39,372 INFO L87 Difference]: Start difference. First operand 244 states and 266 transitions. Second operand 36 states. Received shutdown request... [2018-01-24 11:59:54,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 11:59:54,174 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 11:59:54,181 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 11:59:54,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:59:54 BoogieIcfgContainer [2018-01-24 11:59:54,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:59:54,182 INFO L168 Benchmark]: Toolchain (without parser) took 45797.17 ms. Allocated memory was 309.3 MB in the beginning and 747.1 MB in the end (delta: 437.8 MB). Free memory was 267.3 MB in the beginning and 605.7 MB in the end (delta: -338.4 MB). Peak memory consumption was 99.3 MB. Max. memory is 5.3 GB. [2018-01-24 11:59:54,183 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 309.3 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:59:54,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.48 ms. Allocated memory is still 309.3 MB. Free memory was 266.3 MB in the beginning and 254.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:59:54,184 INFO L168 Benchmark]: Boogie Preprocessor took 41.23 ms. Allocated memory is still 309.3 MB. Free memory was 254.2 MB in the beginning and 252.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:59:54,184 INFO L168 Benchmark]: RCFGBuilder took 584.62 ms. Allocated memory is still 309.3 MB. Free memory was 252.2 MB in the beginning and 210.2 MB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:59:54,184 INFO L168 Benchmark]: TraceAbstraction took 44932.52 ms. Allocated memory was 309.3 MB in the beginning and 747.1 MB in the end (delta: 437.8 MB). Free memory was 210.2 MB in the beginning and 605.7 MB in the end (delta: -395.6 MB). Peak memory consumption was 42.2 MB. Max. memory is 5.3 GB. [2018-01-24 11:59:54,186 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.16 ms. Allocated memory is still 309.3 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 230.48 ms. Allocated memory is still 309.3 MB. Free memory was 266.3 MB in the beginning and 254.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.23 ms. Allocated memory is still 309.3 MB. Free memory was 254.2 MB in the beginning and 252.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 584.62 ms. Allocated memory is still 309.3 MB. Free memory was 252.2 MB in the beginning and 210.2 MB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 44932.52 ms. Allocated memory was 309.3 MB in the beginning and 747.1 MB in the end (delta: 437.8 MB). Free memory was 210.2 MB in the beginning and 605.7 MB in the end (delta: -395.6 MB). Peak memory consumption was 42.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 714). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (244states) and interpolant automaton (currently 16 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 179 locations, 55 error locations. TIMEOUT Result, 44.8s OverallTime, 32 OverallIterations, 2 TraceHistogramMax, 33.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4412 SDtfs, 5048 SDslu, 18364 SDs, 0 SdLazy, 19911 SolverSat, 1107 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 21.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 816 GetRequests, 256 SyntacticMatches, 15 SemanticMatches, 545 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3357 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=8, 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, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 636 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 1633 NumberOfCodeBlocks, 1633 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1597 ConstructedInterpolants, 49 QuantifiedInterpolants, 612413 SizeOfPredicates, 74 NumberOfNonLiveVariables, 1318 ConjunctsInSsa, 232 ConjunctsInUnsatCore, 36 InterpolantComputations, 29 PerfectInterpolantSequences, 116/151 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0134_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-59-54-197.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0134_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-59-54-197.csv Completed graceful shutdown