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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/test-0134_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:04:55,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:04:55,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:04:55,794 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:04:55,794 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:04:55,795 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:04:55,796 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:04:55,798 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:04:55,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:04:55,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:04:55,802 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:04:55,802 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:04:55,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:04:55,804 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:04:55,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:04:55,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:04:55,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:04:55,811 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:04:55,812 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:04:55,813 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:04:55,815 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:04:55,816 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:04:55,816 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:04:55,817 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:04:55,818 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:04:55,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:04:55,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:04:55,820 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:04:55,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:04:55,820 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:04:55,821 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:04:55,821 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:04:55,831 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:04:55,831 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:04:55,832 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:04:55,832 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:04:55,832 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:04:55,833 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:04:55,833 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:04:55,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:04:55,834 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:04:55,834 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:04:55,834 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:04:55,834 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:04:55,834 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:04:55,835 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:04:55,835 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:04:55,835 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:04:55,835 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:04:55,835 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:04:55,835 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:04:55,836 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:04:55,836 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:04:55,836 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:04:55,836 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:04:55,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:04:55,837 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:04:55,837 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:04:55,837 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:04:55,837 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:04:55,837 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:04:55,838 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:04:55,838 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:04:55,838 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:04:55,839 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:04:55,839 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:04:55,874 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:04:55,886 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:04:55,890 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:04:55,892 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:04:55,892 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:04:55,893 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 13:04:56,078 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:04:56,085 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:04:56,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:04:56,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:04:56,094 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:04:56,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:04:56" (1/1) ... [2018-01-24 13:04:56,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f990bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:04:56, skipping insertion in model container [2018-01-24 13:04:56,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:04:56" (1/1) ... [2018-01-24 13:04:56,119 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:04:56,162 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:04:56,312 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:04:56,338 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:04:56,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:04:56 WrapperNode [2018-01-24 13:04:56,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:04:56,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:04:56,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:04:56,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:04:56,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:04:56" (1/1) ... [2018-01-24 13:04:56,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:04:56" (1/1) ... [2018-01-24 13:04:56,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:04:56" (1/1) ... [2018-01-24 13:04:56,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:04:56" (1/1) ... [2018-01-24 13:04:56,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:04:56" (1/1) ... [2018-01-24 13:04:56,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:04:56" (1/1) ... [2018-01-24 13:04:56,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:04:56" (1/1) ... [2018-01-24 13:04:56,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:04:56,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:04:56,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:04:56,396 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:04:56,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:04:56" (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 13:04:56,444 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:04:56,444 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:04:56,444 INFO L136 BoogieDeclarations]: Found implementation of procedure list_empty [2018-01-24 13:04:56,444 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-24 13:04:56,444 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-01-24 13:04:56,444 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-01-24 13:04:56,444 INFO L136 BoogieDeclarations]: Found implementation of procedure list_del [2018-01-24 13:04:56,444 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-01-24 13:04:56,444 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-01-24 13:04:56,445 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-01-24 13:04:56,445 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-01-24 13:04:56,445 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-01-24 13:04:56,445 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_seek_max [2018-01-24 13:04:56,445 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-01-24 13:04:56,445 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:04:56,445 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:04:56,446 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:04:56,446 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:04:56,446 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:04:56,446 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:04:56,446 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:04:56,446 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:04:56,446 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:04:56,447 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 13:04:56,447 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:04:56,447 INFO L128 BoogieDeclarations]: Found specification of procedure list_empty [2018-01-24 13:04:56,447 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-24 13:04:56,447 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-01-24 13:04:56,447 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-01-24 13:04:56,448 INFO L128 BoogieDeclarations]: Found specification of procedure list_del [2018-01-24 13:04:56,448 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-01-24 13:04:56,448 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-01-24 13:04:56,448 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-01-24 13:04:56,448 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-01-24 13:04:56,448 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-01-24 13:04:56,448 INFO L128 BoogieDeclarations]: Found specification of procedure gl_seek_max [2018-01-24 13:04:56,448 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-01-24 13:04:56,448 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:04:56,448 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:04:56,449 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:04:57,065 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:04:57,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:04:57 BoogieIcfgContainer [2018-01-24 13:04:57,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:04:57,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:04:57,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:04:57,069 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:04:57,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:04:56" (1/3) ... [2018-01-24 13:04:57,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f313f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:04:57, skipping insertion in model container [2018-01-24 13:04:57,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:04:56" (2/3) ... [2018-01-24 13:04:57,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f313f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:04:57, skipping insertion in model container [2018-01-24 13:04:57,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:04:57" (3/3) ... [2018-01-24 13:04:57,074 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0134_true-valid-memsafety.i [2018-01-24 13:04:57,081 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:04:57,087 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-24 13:04:57,139 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:04:57,139 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:04:57,139 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:04:57,139 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:04:57,140 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:04:57,140 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:04:57,140 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:04:57,140 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:04:57,141 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:04:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2018-01-24 13:04:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 13:04:57,171 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:57,172 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 13:04:57,172 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 13:04:57,177 INFO L82 PathProgramCache]: Analyzing trace with hash 8457694, now seen corresponding path program 1 times [2018-01-24 13:04:57,180 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:57,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:57,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:57,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:57,234 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:57,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:04:57,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:04:57,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:04:57,338 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:04:57,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:04:57,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:04:57,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:04:57,437 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 3 states. [2018-01-24 13:04:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:57,755 INFO L93 Difference]: Finished difference Result 350 states and 392 transitions. [2018-01-24 13:04:57,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:04:57,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 13:04:57,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:57,771 INFO L225 Difference]: With dead ends: 350 [2018-01-24 13:04:57,772 INFO L226 Difference]: Without dead ends: 179 [2018-01-24 13:04:57,777 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 13:04:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-24 13:04:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-01-24 13:04:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-24 13:04:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-01-24 13:04:57,829 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 4 [2018-01-24 13:04:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:04:57,830 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-01-24 13:04:57,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:04:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-01-24 13:04:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 13:04:57,831 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:57,831 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 13:04:57,831 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 13:04:57,831 INFO L82 PathProgramCache]: Analyzing trace with hash 8457695, now seen corresponding path program 1 times [2018-01-24 13:04:57,831 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:57,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:57,833 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:57,833 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:57,833 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:57,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:04:57,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:04:57,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:04:57,881 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:04:57,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:04:57,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:04:57,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:04:57,883 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 3 states. [2018-01-24 13:04:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:58,017 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2018-01-24 13:04:58,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:04:58,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 13:04:58,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:58,020 INFO L225 Difference]: With dead ends: 182 [2018-01-24 13:04:58,020 INFO L226 Difference]: Without dead ends: 180 [2018-01-24 13:04:58,021 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 13:04:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-24 13:04:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-01-24 13:04:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-24 13:04:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2018-01-24 13:04:58,041 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 4 [2018-01-24 13:04:58,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:04:58,041 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2018-01-24 13:04:58,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:04:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2018-01-24 13:04:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:04:58,042 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:58,042 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:04:58,042 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 13:04:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash 809839361, now seen corresponding path program 1 times [2018-01-24 13:04:58,043 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:58,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:58,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:58,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:58,044 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:58,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:58,114 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 13:04:58,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:04:58,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:04:58,115 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:04:58,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:04:58,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:04:58,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:04:58,116 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand 4 states. [2018-01-24 13:04:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:58,330 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2018-01-24 13:04:58,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:04:58,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 13:04:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:58,331 INFO L225 Difference]: With dead ends: 176 [2018-01-24 13:04:58,331 INFO L226 Difference]: Without dead ends: 175 [2018-01-24 13:04:58,332 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 13:04:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-24 13:04:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-01-24 13:04:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-24 13:04:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2018-01-24 13:04:58,347 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 16 [2018-01-24 13:04:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:04:58,384 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2018-01-24 13:04:58,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:04:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2018-01-24 13:04:58,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:04:58,384 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:58,384 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:04:58,385 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 13:04:58,385 INFO L82 PathProgramCache]: Analyzing trace with hash 809839362, now seen corresponding path program 1 times [2018-01-24 13:04:58,385 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:58,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:58,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:58,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:58,386 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:58,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:58,485 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 13:04:58,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:04:58,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:04:58,485 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:04:58,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:04:58,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:04:58,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:04:58,486 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 4 states. [2018-01-24 13:04:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:58,622 INFO L93 Difference]: Finished difference Result 175 states and 188 transitions. [2018-01-24 13:04:58,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:04:58,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 13:04:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:58,625 INFO L225 Difference]: With dead ends: 175 [2018-01-24 13:04:58,625 INFO L226 Difference]: Without dead ends: 174 [2018-01-24 13:04:58,625 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 13:04:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-24 13:04:58,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-01-24 13:04:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-24 13:04:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-01-24 13:04:58,638 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 16 [2018-01-24 13:04:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:04:58,638 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-01-24 13:04:58,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:04:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-01-24 13:04:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:04:58,639 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:58,640 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 13:04:58,640 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 13:04:58,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1093319294, now seen corresponding path program 1 times [2018-01-24 13:04:58,640 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:58,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:58,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:58,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:58,642 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:58,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:58,733 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 13:04:58,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:04:58,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:04:58,734 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:04:58,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:04:58,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:04:58,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:04:58,735 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 7 states. [2018-01-24 13:04:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:59,039 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2018-01-24 13:04:59,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:04:59,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 13:04:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:59,041 INFO L225 Difference]: With dead ends: 183 [2018-01-24 13:04:59,041 INFO L226 Difference]: Without dead ends: 182 [2018-01-24 13:04:59,042 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 13:04:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-24 13:04:59,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-01-24 13:04:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-24 13:04:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2018-01-24 13:04:59,052 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 19 [2018-01-24 13:04:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:04:59,052 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2018-01-24 13:04:59,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:04:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2018-01-24 13:04:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:04:59,053 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:59,053 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 13:04:59,053 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 13:04:59,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1093319295, now seen corresponding path program 1 times [2018-01-24 13:04:59,054 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:59,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:59,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:59,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:59,055 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:59,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:59,205 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 13:04:59,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:04:59,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:04:59,205 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:04:59,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:04:59,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:04:59,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:04:59,207 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand 9 states. [2018-01-24 13:04:59,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:04:59,615 INFO L93 Difference]: Finished difference Result 181 states and 194 transitions. [2018-01-24 13:04:59,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:04:59,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 13:04:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:04:59,616 INFO L225 Difference]: With dead ends: 181 [2018-01-24 13:04:59,616 INFO L226 Difference]: Without dead ends: 177 [2018-01-24 13:04:59,617 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 13:04:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-24 13:04:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-01-24 13:04:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-24 13:04:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2018-01-24 13:04:59,629 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 19 [2018-01-24 13:04:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:04:59,629 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2018-01-24 13:04:59,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:04:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2018-01-24 13:04:59,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 13:04:59,630 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:04:59,630 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 13:04:59,630 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 13:04:59,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1956678693, now seen corresponding path program 1 times [2018-01-24 13:04:59,631 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:04:59,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:59,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:04:59,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:04:59,631 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:04:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:04:59,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:04:59,810 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 13:04:59,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:04:59,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 13:04:59,811 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:04:59,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 13:04:59,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 13:04:59,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:04:59,812 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 10 states. [2018-01-24 13:05:00,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:05:00,153 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2018-01-24 13:05:00,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 13:05:00,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 13:05:00,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:05:00,155 INFO L225 Difference]: With dead ends: 204 [2018-01-24 13:05:00,155 INFO L226 Difference]: Without dead ends: 203 [2018-01-24 13:05:00,156 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 13:05:00,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-24 13:05:00,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 195. [2018-01-24 13:05:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-24 13:05:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 216 transitions. [2018-01-24 13:05:00,169 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 216 transitions. Word has length 22 [2018-01-24 13:05:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:05:00,169 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 216 transitions. [2018-01-24 13:05:00,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 13:05:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2018-01-24 13:05:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 13:05:00,170 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:05:00,170 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 13:05:00,170 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 13:05:00,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1956678692, now seen corresponding path program 1 times [2018-01-24 13:05:00,170 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:05:00,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:00,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:05:00,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:00,171 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:05:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:05:00,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:05:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:05:00,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:05:00,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 13:05:00,426 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:05:00,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:05:00,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:05:00,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:05:00,426 INFO L87 Difference]: Start difference. First operand 195 states and 216 transitions. Second operand 11 states. [2018-01-24 13:05:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:05:01,434 INFO L93 Difference]: Finished difference Result 363 states and 387 transitions. [2018-01-24 13:05:01,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 13:05:01,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-01-24 13:05:01,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:05:01,437 INFO L225 Difference]: With dead ends: 363 [2018-01-24 13:05:01,437 INFO L226 Difference]: Without dead ends: 362 [2018-01-24 13:05:01,438 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 13:05:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-01-24 13:05:01,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 290. [2018-01-24 13:05:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-01-24 13:05:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 356 transitions. [2018-01-24 13:05:01,462 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 356 transitions. Word has length 22 [2018-01-24 13:05:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:05:01,463 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 356 transitions. [2018-01-24 13:05:01,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:05:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 356 transitions. [2018-01-24 13:05:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 13:05:01,464 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:05:01,464 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 13:05:01,464 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 13:05:01,464 INFO L82 PathProgramCache]: Analyzing trace with hash -527497365, now seen corresponding path program 1 times [2018-01-24 13:05:01,464 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:05:01,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:01,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:05:01,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:01,466 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:05:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:05:01,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:05:01,537 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 13:05:01,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:05:01,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:05:01,538 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:05:01,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:05:01,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:05:01,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:05:01,538 INFO L87 Difference]: Start difference. First operand 290 states and 356 transitions. Second operand 7 states. [2018-01-24 13:05:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:05:01,914 INFO L93 Difference]: Finished difference Result 304 states and 370 transitions. [2018-01-24 13:05:01,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:05:01,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 13:05:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:05:01,917 INFO L225 Difference]: With dead ends: 304 [2018-01-24 13:05:01,917 INFO L226 Difference]: Without dead ends: 302 [2018-01-24 13:05:01,918 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:05:01,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-01-24 13:05:01,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 206. [2018-01-24 13:05:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-24 13:05:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2018-01-24 13:05:01,935 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 23 [2018-01-24 13:05:01,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:05:01,935 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2018-01-24 13:05:01,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:05:01,935 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2018-01-24 13:05:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 13:05:01,936 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:05:01,936 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 13:05:01,936 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 13:05:01,936 INFO L82 PathProgramCache]: Analyzing trace with hash -527497364, now seen corresponding path program 1 times [2018-01-24 13:05:01,936 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:05:01,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:01,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:05:01,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:01,938 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:05:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:05:01,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:05:02,067 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 13:05:02,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:05:02,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:05:02,067 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:05:02,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:05:02,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:05:02,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:05:02,068 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand 8 states. [2018-01-24 13:05:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:05:02,397 INFO L93 Difference]: Finished difference Result 212 states and 227 transitions. [2018-01-24 13:05:02,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:05:02,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-24 13:05:02,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:05:02,399 INFO L225 Difference]: With dead ends: 212 [2018-01-24 13:05:02,399 INFO L226 Difference]: Without dead ends: 210 [2018-01-24 13:05:02,399 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 13:05:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-24 13:05:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 206. [2018-01-24 13:05:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-24 13:05:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 223 transitions. [2018-01-24 13:05:02,412 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 223 transitions. Word has length 23 [2018-01-24 13:05:02,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:05:02,413 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 223 transitions. [2018-01-24 13:05:02,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:05:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 223 transitions. [2018-01-24 13:05:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 13:05:02,413 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:05:02,413 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 13:05:02,413 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 13:05:02,414 INFO L82 PathProgramCache]: Analyzing trace with hash -118827570, now seen corresponding path program 1 times [2018-01-24 13:05:02,414 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:05:02,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:02,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:05:02,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:02,414 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:05:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:05:02,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:05:02,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 13:05:02,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:05:02,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:05:02,451 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:05:02,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:05:02,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:05:02,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:05:02,452 INFO L87 Difference]: Start difference. First operand 206 states and 223 transitions. Second operand 5 states. [2018-01-24 13:05:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:05:03,019 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2018-01-24 13:05:03,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:05:03,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 13:05:03,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:05:03,021 INFO L225 Difference]: With dead ends: 206 [2018-01-24 13:05:03,021 INFO L226 Difference]: Without dead ends: 205 [2018-01-24 13:05:03,021 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 13:05:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-24 13:05:03,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-01-24 13:05:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-01-24 13:05:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 220 transitions. [2018-01-24 13:05:03,034 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 220 transitions. Word has length 25 [2018-01-24 13:05:03,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:05:03,034 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 220 transitions. [2018-01-24 13:05:03,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:05:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 220 transitions. [2018-01-24 13:05:03,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 13:05:03,035 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:05:03,035 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 13:05:03,035 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 13:05:03,035 INFO L82 PathProgramCache]: Analyzing trace with hash -118827569, now seen corresponding path program 1 times [2018-01-24 13:05:03,035 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:05:03,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:03,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:05:03,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:03,037 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:05:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:05:03,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:05:03,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:05:03,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:05:03,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:05:03,292 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:05:03,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:05:03,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:05:03,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:05:03,293 INFO L87 Difference]: Start difference. First operand 205 states and 220 transitions. Second operand 8 states. [2018-01-24 13:05:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:05:03,474 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2018-01-24 13:05:03,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:05:03,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 13:05:03,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:05:03,496 INFO L225 Difference]: With dead ends: 208 [2018-01-24 13:05:03,496 INFO L226 Difference]: Without dead ends: 207 [2018-01-24 13:05:03,496 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:05:03,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-24 13:05:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-01-24 13:05:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-01-24 13:05:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 218 transitions. [2018-01-24 13:05:03,509 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 218 transitions. Word has length 25 [2018-01-24 13:05:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:05:03,510 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 218 transitions. [2018-01-24 13:05:03,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:05:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 218 transitions. [2018-01-24 13:05:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 13:05:03,511 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:05:03,511 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 13:05:03,511 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 13:05:03,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1902858492, now seen corresponding path program 1 times [2018-01-24 13:05:03,512 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:05:03,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:03,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:05:03,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:03,513 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:05:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:05:03,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:05:03,587 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 13:05:03,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:05:03,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:05:03,588 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:05:03,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:05:03,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:05:03,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:05:03,589 INFO L87 Difference]: Start difference. First operand 205 states and 218 transitions. Second operand 9 states. [2018-01-24 13:05:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:05:03,986 INFO L93 Difference]: Finished difference Result 205 states and 218 transitions. [2018-01-24 13:05:03,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:05:03,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-01-24 13:05:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:05:03,988 INFO L225 Difference]: With dead ends: 205 [2018-01-24 13:05:03,988 INFO L226 Difference]: Without dead ends: 204 [2018-01-24 13:05:03,988 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-01-24 13:05:03,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-24 13:05:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-01-24 13:05:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-24 13:05:04,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 217 transitions. [2018-01-24 13:05:04,001 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 217 transitions. Word has length 41 [2018-01-24 13:05:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:05:04,002 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 217 transitions. [2018-01-24 13:05:04,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:05:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 217 transitions. [2018-01-24 13:05:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 13:05:04,003 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:05:04,003 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 13:05:04,004 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 13:05:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1902858493, now seen corresponding path program 1 times [2018-01-24 13:05:04,004 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:05:04,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:04,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:05:04,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:04,005 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:05:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:05:04,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:05:04,121 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 13:05:04,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:05:04,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 13:05:04,121 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:05:04,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:05:04,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:05:04,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:05:04,122 INFO L87 Difference]: Start difference. First operand 204 states and 217 transitions. Second operand 11 states. [2018-01-24 13:05:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:05:04,540 INFO L93 Difference]: Finished difference Result 204 states and 217 transitions. [2018-01-24 13:05:04,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:05:04,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-01-24 13:05:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:05:04,541 INFO L225 Difference]: With dead ends: 204 [2018-01-24 13:05:04,541 INFO L226 Difference]: Without dead ends: 203 [2018-01-24 13:05:04,542 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 13:05:04,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-24 13:05:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-01-24 13:05:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-24 13:05:04,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 216 transitions. [2018-01-24 13:05:04,554 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 216 transitions. Word has length 41 [2018-01-24 13:05:04,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:05:04,554 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 216 transitions. [2018-01-24 13:05:04,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:05:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 216 transitions. [2018-01-24 13:05:04,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 13:05:04,556 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:05:04,556 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 13:05:04,556 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 13:05:04,556 INFO L82 PathProgramCache]: Analyzing trace with hash 873260496, now seen corresponding path program 1 times [2018-01-24 13:05:04,556 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:05:04,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:04,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:05:04,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:05:04,558 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:05:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:05:04,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:05:05,092 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 13:05:05,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:05:05,092 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 13:05:05,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:05:05,099 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:05:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:05:05,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:05:05,701 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 13:05:05,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:05:05,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:05,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:05:05,725 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 13:05:05,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-01-24 13:05:05,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:05:05,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:05:05,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:05:05,909 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 13:05:05,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:05,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:05:05,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2018-01-24 13:05:06,027 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 13:05:06,030 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 13:05:06,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:06,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:05:06,043 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 13:05:06,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:35 [2018-01-24 13:05:06,193 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 13:05:06,195 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 13:05:06,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:06,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:05:06,228 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 13:05:06,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-01-24 13:05:06,365 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 13:05:06,365 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:05:06,413 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:05:06,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:05:06,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:05:06,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-01-24 13:05:07,125 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:07,126 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 7 variables, input treesize:55, output treesize:1 [2018-01-24 13:05:07,257 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-01-24 13:05:07,339 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 9 treesize of output 8 [2018-01-24 13:05:07,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:07,350 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 21 treesize of output 17 [2018-01-24 13:05:07,352 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 17 treesize of output 8 [2018-01-24 13:05:07,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:07,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:05:07,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:05:07,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:05:07,369 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:21 [2018-01-24 13:05:07,550 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-24 13:05:07,628 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-24 13:05:07,733 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-01-24 13:05:07,756 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 9 treesize of output 8 [2018-01-24 13:05:07,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:07,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-01-24 13:05:07,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 13:05:07,783 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:05:07,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-01-24 13:05:07,805 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:07,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2018-01-24 13:05:07,825 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:05:07,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 13:05:07,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-01-24 13:05:07,883 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 6 treesize of output 1 [2018-01-24 13:05:07,884 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:07,893 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:05:07,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 10 xjuncts. [2018-01-24 13:05:07,990 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-01-24 13:05:08,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-24 13:05:08,011 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:08,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-01-24 13:05:08,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 13:05:08,034 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:05:08,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-01-24 13:05:08,043 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:08,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2018-01-24 13:05:08,055 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:05:08,063 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 13:05:08,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-01-24 13:05:08,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-01-24 13:05:08,067 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:08,070 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:05:08,090 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 10 xjuncts. [2018-01-24 13:05:08,287 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-01-24 13:05:08,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-24 13:05:08,310 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:08,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-01-24 13:05:08,327 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 6 treesize of output 1 [2018-01-24 13:05:08,328 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:08,330 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:05:08,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-01-24 13:05:08,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2018-01-24 13:05:08,344 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:05:08,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-01-24 13:05:08,357 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-24 13:05:08,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-01-24 13:05:08,366 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:05:08,374 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 13:05:08,393 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 10 xjuncts. [2018-01-24 13:05:08,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 51 dim-0 vars, and 27 xjuncts. [2018-01-24 13:05:08,659 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 8 variables, input treesize:161, output treesize:814 [2018-01-24 13:05:08,662 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-24 13:05:08,913 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 27933 conjuctions. This might take some time... [2018-01-24 13:05:09,260 INFO L170 XnfTransformerHelper]: Simplified to disjunction of 58 conjuctions. [2018-01-24 13:05:46,800 WARN L146 SmtUtils]: Spent 37023ms on a formula simplification. DAG size of input: 364 DAG size of output 55 [2018-01-24 13:05:46,811 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-24 13:05:47,034 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 54459 conjuctions. This might take some time... [2018-01-24 13:05:50,356 INFO L170 XnfTransformerHelper]: Simplified to disjunction of 360 conjuctions. [2018-01-24 13:05:50,425 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 360 Received shutdown request... [2018-01-24 13:05:57,556 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 13:05:57,557 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 13:05:57,562 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 13:05:57,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:05:57 BoogieIcfgContainer [2018-01-24 13:05:57,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:05:57,563 INFO L168 Benchmark]: Toolchain (without parser) took 61484.88 ms. Allocated memory was 306.7 MB in the beginning and 1.2 GB in the end (delta: 860.9 MB). Free memory was 266.6 MB in the beginning and 1.0 GB in the end (delta: -743.6 MB). Peak memory consumption was 772.4 MB. Max. memory is 5.3 GB. [2018-01-24 13:05:57,565 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 306.7 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:05:57,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.27 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 253.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:05:57,565 INFO L168 Benchmark]: Boogie Preprocessor took 43.59 ms. Allocated memory is still 306.7 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:05:57,566 INFO L168 Benchmark]: RCFGBuilder took 670.40 ms. Allocated memory is still 306.7 MB. Free memory was 251.6 MB in the beginning and 209.6 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:05:57,566 INFO L168 Benchmark]: TraceAbstraction took 60495.45 ms. Allocated memory was 306.7 MB in the beginning and 1.2 GB in the end (delta: 860.9 MB). Free memory was 209.6 MB in the beginning and 1.0 GB in the end (delta: -800.6 MB). Peak memory consumption was 715.4 MB. Max. memory is 5.3 GB. [2018-01-24 13:05:57,568 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.23 ms. Allocated memory is still 306.7 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 265.27 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 253.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.59 ms. Allocated memory is still 306.7 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 670.40 ms. Allocated memory is still 306.7 MB. Free memory was 251.6 MB in the beginning and 209.6 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60495.45 ms. Allocated memory was 306.7 MB in the beginning and 1.2 GB in the end (delta: 860.9 MB). Free memory was 209.6 MB in the beginning and 1.0 GB in the end (delta: -800.6 MB). Peak memory consumption was 715.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 714). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while CnfTransformerHelper was transforming 360 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 179 locations, 55 error locations. TIMEOUT Result, 60.4s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2028 SDtfs, 1875 SDslu, 5980 SDs, 0 SdLazy, 4601 SolverSat, 230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.4s 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.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 189 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 43424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-05-57-578.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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-05-57-578.csv Completed graceful shutdown