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_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0137_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:55:25,841 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:55:25,843 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:55:25,857 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:55:25,857 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:55:25,858 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:55:25,859 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:55:25,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:55:25,863 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:55:25,863 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:55:25,864 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:55:25,864 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:55:25,864 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:55:25,865 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:55:25,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:55:25,868 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:55:25,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:55:25,872 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:55:25,874 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:55:25,875 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:55:25,877 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:55:25,877 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:55:25,878 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:55:25,879 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:55:25,879 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:55:25,881 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:55:25,881 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:55:25,881 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:55:25,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:55:25,882 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:55:25,882 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:55:25,883 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 16:55:25,892 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:55:25,893 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:55:25,894 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:55:25,894 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:55:25,894 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:55:25,894 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:55:25,894 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:55:25,895 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:55:25,895 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:55:25,896 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:55:25,896 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:55:25,896 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:55:25,896 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:55:25,896 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:55:25,896 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:55:25,897 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:55:25,897 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:55:25,897 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:55:25,897 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:55:25,897 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:55:25,898 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:55:25,898 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:55:25,898 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:55:25,898 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:55:25,898 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:55:25,899 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:55:25,899 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:55:25,899 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:55:25,899 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:55:25,900 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:55:25,900 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:55:25,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:55:25,900 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:55:25,900 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:55:25,901 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:55:25,901 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:55:25,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:55:25,947 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:55:25,950 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:55:25,951 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:55:25,952 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:55:25,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0137_false-valid-deref.i [2018-01-24 16:55:26,111 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:55:26,117 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:55:26,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:55:26,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:55:26,122 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:55:26,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:55:26" (1/1) ... [2018-01-24 16:55:26,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63efad59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:55:26, skipping insertion in model container [2018-01-24 16:55:26,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:55:26" (1/1) ... [2018-01-24 16:55:26,140 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:55:26,180 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:55:26,301 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:55:26,323 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:55:26,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:55:26 WrapperNode [2018-01-24 16:55:26,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:55:26,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:55:26,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:55:26,335 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:55:26,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:55:26" (1/1) ... [2018-01-24 16:55:26,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:55:26" (1/1) ... [2018-01-24 16:55:26,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:55:26" (1/1) ... [2018-01-24 16:55:26,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:55:26" (1/1) ... [2018-01-24 16:55:26,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:55:26" (1/1) ... [2018-01-24 16:55:26,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:55:26" (1/1) ... [2018-01-24 16:55:26,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:55:26" (1/1) ... [2018-01-24 16:55:26,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:55:26,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:55:26,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:55:26,378 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:55:26,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:55:26" (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 16:55:26,430 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:55:26,430 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:55:26,430 INFO L136 BoogieDeclarations]: Found implementation of procedure list_empty [2018-01-24 16:55:26,430 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-24 16:55:26,430 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-01-24 16:55:26,430 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-01-24 16:55:26,431 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-01-24 16:55:26,431 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-01-24 16:55:26,431 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-01-24 16:55:26,431 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-01-24 16:55:26,431 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-01-24 16:55:26,431 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_seek_max [2018-01-24 16:55:26,431 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-01-24 16:55:26,431 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:55:26,431 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:55:26,431 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:55:26,432 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:55:26,432 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:55:26,432 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:55:26,432 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:55:26,432 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:55:26,432 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:55:26,432 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 16:55:26,432 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:55:26,433 INFO L128 BoogieDeclarations]: Found specification of procedure list_empty [2018-01-24 16:55:26,433 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-24 16:55:26,433 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-01-24 16:55:26,433 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-01-24 16:55:26,433 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-01-24 16:55:26,433 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-01-24 16:55:26,434 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-01-24 16:55:26,434 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-01-24 16:55:26,434 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-01-24 16:55:26,434 INFO L128 BoogieDeclarations]: Found specification of procedure gl_seek_max [2018-01-24 16:55:26,434 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-01-24 16:55:26,434 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:55:26,435 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:55:26,435 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:55:27,048 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:55:27,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:55:27 BoogieIcfgContainer [2018-01-24 16:55:27,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:55:27,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:55:27,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:55:27,052 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:55:27,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:55:26" (1/3) ... [2018-01-24 16:55:27,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6e52b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:55:27, skipping insertion in model container [2018-01-24 16:55:27,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:55:26" (2/3) ... [2018-01-24 16:55:27,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6e52b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:55:27, skipping insertion in model container [2018-01-24 16:55:27,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:55:27" (3/3) ... [2018-01-24 16:55:27,056 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0137_false-valid-deref.i [2018-01-24 16:55:27,062 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:55:27,068 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-01-24 16:55:27,108 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:55:27,108 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:55:27,108 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:55:27,109 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:55:27,109 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:55:27,109 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:55:27,109 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:55:27,109 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:55:27,110 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:55:27,135 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states. [2018-01-24 16:55:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 16:55:27,139 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:27,139 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 16:55:27,140 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:27,143 INFO L82 PathProgramCache]: Analyzing trace with hash 8574872, now seen corresponding path program 1 times [2018-01-24 16:55:27,145 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:27,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:27,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:27,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:27,185 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:27,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:27,288 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 16:55:27,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:55:27,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:55:27,290 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:55:27,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:55:27,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:55:27,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:55:27,305 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 3 states. [2018-01-24 16:55:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:55:27,627 INFO L93 Difference]: Finished difference Result 366 states and 406 transitions. [2018-01-24 16:55:27,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:55:27,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 16:55:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:55:27,641 INFO L225 Difference]: With dead ends: 366 [2018-01-24 16:55:27,641 INFO L226 Difference]: Without dead ends: 186 [2018-01-24 16:55:27,647 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 16:55:27,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-24 16:55:27,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-01-24 16:55:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-24 16:55:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-01-24 16:55:27,697 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 4 [2018-01-24 16:55:27,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:55:27,698 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-01-24 16:55:27,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:55:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-01-24 16:55:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 16:55:27,698 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:27,698 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 16:55:27,699 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:27,699 INFO L82 PathProgramCache]: Analyzing trace with hash 8574873, now seen corresponding path program 1 times [2018-01-24 16:55:27,699 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:27,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:27,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:27,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:27,701 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:27,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:27,755 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 16:55:27,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:55:27,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:55:27,756 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:55:27,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:55:27,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:55:27,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:55:27,758 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 3 states. [2018-01-24 16:55:27,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:55:27,901 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2018-01-24 16:55:27,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:55:27,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 16:55:27,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:55:27,904 INFO L225 Difference]: With dead ends: 189 [2018-01-24 16:55:27,904 INFO L226 Difference]: Without dead ends: 187 [2018-01-24 16:55:27,905 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 16:55:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-24 16:55:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-01-24 16:55:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-24 16:55:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2018-01-24 16:55:27,925 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 4 [2018-01-24 16:55:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:55:27,925 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2018-01-24 16:55:27,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:55:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2018-01-24 16:55:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 16:55:27,926 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:27,927 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:55:27,927 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:27,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1609065266, now seen corresponding path program 1 times [2018-01-24 16:55:27,927 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:27,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:27,928 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:27,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:27,929 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:27,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:28,016 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 16:55:28,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:55:28,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:55:28,017 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:55:28,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:55:28,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:55:28,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:55:28,018 INFO L87 Difference]: Start difference. First operand 183 states and 194 transitions. Second operand 4 states. [2018-01-24 16:55:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:55:28,185 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2018-01-24 16:55:28,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:55:28,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 16:55:28,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:55:28,187 INFO L225 Difference]: With dead ends: 183 [2018-01-24 16:55:28,187 INFO L226 Difference]: Without dead ends: 182 [2018-01-24 16:55:28,188 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 16:55:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-24 16:55:28,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-01-24 16:55:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-24 16:55:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-01-24 16:55:28,204 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 16 [2018-01-24 16:55:28,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:55:28,204 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-01-24 16:55:28,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:55:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-01-24 16:55:28,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 16:55:28,205 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:28,205 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:55:28,206 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:28,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1609065267, now seen corresponding path program 1 times [2018-01-24 16:55:28,206 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:28,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:28,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:28,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:28,207 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:28,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:28,316 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 16:55:28,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:55:28,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:55:28,316 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:55:28,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:55:28,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:55:28,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:55:28,317 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 4 states. [2018-01-24 16:55:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:55:28,437 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2018-01-24 16:55:28,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:55:28,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 16:55:28,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:55:28,439 INFO L225 Difference]: With dead ends: 182 [2018-01-24 16:55:28,439 INFO L226 Difference]: Without dead ends: 181 [2018-01-24 16:55:28,439 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 16:55:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-24 16:55:28,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-01-24 16:55:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-24 16:55:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2018-01-24 16:55:28,452 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 16 [2018-01-24 16:55:28,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:55:28,453 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2018-01-24 16:55:28,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:55:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2018-01-24 16:55:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:55:28,453 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:28,454 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 16:55:28,454 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:28,454 INFO L82 PathProgramCache]: Analyzing trace with hash -466429743, now seen corresponding path program 1 times [2018-01-24 16:55:28,454 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:28,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:28,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:28,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:28,455 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:28,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:28,568 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 16:55:28,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:55:28,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:55:28,568 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:55:28,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:55:28,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:55:28,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:55:28,569 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand 7 states. [2018-01-24 16:55:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:55:28,838 INFO L93 Difference]: Finished difference Result 190 states and 200 transitions. [2018-01-24 16:55:28,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:55:28,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 16:55:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:55:28,840 INFO L225 Difference]: With dead ends: 190 [2018-01-24 16:55:28,840 INFO L226 Difference]: Without dead ends: 189 [2018-01-24 16:55:28,840 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 16:55:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-24 16:55:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-01-24 16:55:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-24 16:55:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2018-01-24 16:55:28,851 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 19 [2018-01-24 16:55:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:55:28,851 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2018-01-24 16:55:28,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:55:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2018-01-24 16:55:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:55:28,852 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:28,852 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 16:55:28,853 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash -466429742, now seen corresponding path program 1 times [2018-01-24 16:55:28,853 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:28,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:28,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:28,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:28,854 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:28,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:28,953 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 16:55:28,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:55:28,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:55:28,953 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:55:28,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:55:28,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:55:28,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:55:28,955 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand 7 states. [2018-01-24 16:55:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:55:29,381 INFO L93 Difference]: Finished difference Result 188 states and 199 transitions. [2018-01-24 16:55:29,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:55:29,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 16:55:29,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:55:29,383 INFO L225 Difference]: With dead ends: 188 [2018-01-24 16:55:29,383 INFO L226 Difference]: Without dead ends: 182 [2018-01-24 16:55:29,383 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:55:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-24 16:55:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-01-24 16:55:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-24 16:55:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-01-24 16:55:29,394 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 19 [2018-01-24 16:55:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:55:29,394 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-01-24 16:55:29,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:55:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-01-24 16:55:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:55:29,395 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:29,396 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 16:55:29,396 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:29,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1189060692, now seen corresponding path program 1 times [2018-01-24 16:55:29,396 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:29,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:29,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:29,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:29,397 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:29,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:29,547 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 16:55:29,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:55:29,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:55:29,548 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:55:29,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:55:29,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:55:29,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:55:29,549 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 10 states. [2018-01-24 16:55:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:55:29,936 INFO L93 Difference]: Finished difference Result 209 states and 221 transitions. [2018-01-24 16:55:29,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 16:55:29,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 16:55:29,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:55:29,938 INFO L225 Difference]: With dead ends: 209 [2018-01-24 16:55:29,939 INFO L226 Difference]: Without dead ends: 208 [2018-01-24 16:55:29,939 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 16:55:29,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-01-24 16:55:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 200. [2018-01-24 16:55:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-01-24 16:55:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 219 transitions. [2018-01-24 16:55:29,956 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 219 transitions. Word has length 22 [2018-01-24 16:55:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:55:29,956 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 219 transitions. [2018-01-24 16:55:29,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:55:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 219 transitions. [2018-01-24 16:55:29,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:55:29,957 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:29,957 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 16:55:29,957 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1189060691, now seen corresponding path program 1 times [2018-01-24 16:55:29,957 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:29,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:29,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:29,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:29,958 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:29,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:30,229 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 16:55:30,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:55:30,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:55:30,229 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:55:30,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 16:55:30,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 16:55:30,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:55:30,230 INFO L87 Difference]: Start difference. First operand 200 states and 219 transitions. Second operand 11 states. [2018-01-24 16:55:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:55:31,510 INFO L93 Difference]: Finished difference Result 373 states and 393 transitions. [2018-01-24 16:55:31,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 16:55:31,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-01-24 16:55:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:55:31,514 INFO L225 Difference]: With dead ends: 373 [2018-01-24 16:55:31,514 INFO L226 Difference]: Without dead ends: 372 [2018-01-24 16:55:31,515 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 16:55:31,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-01-24 16:55:31,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 296. [2018-01-24 16:55:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-01-24 16:55:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 362 transitions. [2018-01-24 16:55:31,538 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 362 transitions. Word has length 22 [2018-01-24 16:55:31,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:55:31,538 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 362 transitions. [2018-01-24 16:55:31,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 16:55:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 362 transitions. [2018-01-24 16:55:31,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:55:31,539 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:31,539 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 16:55:31,539 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:31,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1793824186, now seen corresponding path program 1 times [2018-01-24 16:55:31,540 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:31,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:31,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:31,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:31,541 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:31,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:31,630 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 16:55:31,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:55:31,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:55:31,631 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:55:31,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:55:31,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:55:31,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:55:31,632 INFO L87 Difference]: Start difference. First operand 296 states and 362 transitions. Second operand 7 states. [2018-01-24 16:55:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:55:32,097 INFO L93 Difference]: Finished difference Result 310 states and 376 transitions. [2018-01-24 16:55:32,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:55:32,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 16:55:32,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:55:32,100 INFO L225 Difference]: With dead ends: 310 [2018-01-24 16:55:32,100 INFO L226 Difference]: Without dead ends: 308 [2018-01-24 16:55:32,100 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 16:55:32,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-01-24 16:55:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 211. [2018-01-24 16:55:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-24 16:55:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 230 transitions. [2018-01-24 16:55:32,119 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 230 transitions. Word has length 23 [2018-01-24 16:55:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:55:32,119 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 230 transitions. [2018-01-24 16:55:32,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:55:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 230 transitions. [2018-01-24 16:55:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:55:32,120 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:32,121 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 16:55:32,121 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:32,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1793824187, now seen corresponding path program 1 times [2018-01-24 16:55:32,121 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:32,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:32,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:32,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:32,122 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:32,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:32,253 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 16:55:32,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:55:32,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:55:32,253 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:55:32,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:55:32,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:55:32,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:55:32,254 INFO L87 Difference]: Start difference. First operand 211 states and 230 transitions. Second operand 8 states. [2018-01-24 16:55:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:55:32,790 INFO L93 Difference]: Finished difference Result 217 states and 230 transitions. [2018-01-24 16:55:32,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:55:32,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-24 16:55:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:55:32,791 INFO L225 Difference]: With dead ends: 217 [2018-01-24 16:55:32,791 INFO L226 Difference]: Without dead ends: 215 [2018-01-24 16:55:32,792 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 16:55:32,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-24 16:55:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2018-01-24 16:55:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-24 16:55:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 226 transitions. [2018-01-24 16:55:32,805 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 226 transitions. Word has length 23 [2018-01-24 16:55:32,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:55:32,805 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 226 transitions. [2018-01-24 16:55:32,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:55:32,805 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions. [2018-01-24 16:55:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:55:32,806 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:32,806 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 16:55:32,806 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:32,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1583156317, now seen corresponding path program 1 times [2018-01-24 16:55:32,807 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:32,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:32,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:32,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:32,808 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:32,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:32,871 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 16:55:32,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:55:32,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:55:32,871 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:55:32,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:55:32,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:55:32,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:55:32,872 INFO L87 Difference]: Start difference. First operand 211 states and 226 transitions. Second operand 5 states. [2018-01-24 16:55:33,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:55:33,110 INFO L93 Difference]: Finished difference Result 211 states and 226 transitions. [2018-01-24 16:55:33,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:55:33,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 16:55:33,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:55:33,112 INFO L225 Difference]: With dead ends: 211 [2018-01-24 16:55:33,112 INFO L226 Difference]: Without dead ends: 210 [2018-01-24 16:55:33,113 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 16:55:33,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-24 16:55:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-01-24 16:55:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-24 16:55:33,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2018-01-24 16:55:33,127 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 25 [2018-01-24 16:55:33,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:55:33,128 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2018-01-24 16:55:33,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:55:33,128 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2018-01-24 16:55:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:55:33,129 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:33,129 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 16:55:33,129 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:33,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1583156318, now seen corresponding path program 1 times [2018-01-24 16:55:33,129 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:33,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:33,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:33,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:33,130 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:33,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:33,284 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 16:55:33,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:55:33,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:55:33,285 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:55:33,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:55:33,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:55:33,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:55:33,286 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand 8 states. [2018-01-24 16:55:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:55:33,577 INFO L93 Difference]: Finished difference Result 213 states and 223 transitions. [2018-01-24 16:55:33,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:55:33,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 16:55:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:55:33,578 INFO L225 Difference]: With dead ends: 213 [2018-01-24 16:55:33,578 INFO L226 Difference]: Without dead ends: 212 [2018-01-24 16:55:33,578 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:55:33,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-24 16:55:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-01-24 16:55:33,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-24 16:55:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 221 transitions. [2018-01-24 16:55:33,592 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 221 transitions. Word has length 25 [2018-01-24 16:55:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:55:33,592 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 221 transitions. [2018-01-24 16:55:33,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:55:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 221 transitions. [2018-01-24 16:55:33,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 16:55:33,594 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:33,594 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 16:55:33,594 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:33,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1201783090, now seen corresponding path program 1 times [2018-01-24 16:55:33,594 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:33,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:33,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:33,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:33,596 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:33,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:33,722 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 16:55:33,722 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:55:33,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:55:33,722 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:55:33,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:55:33,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:55:33,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:55:33,723 INFO L87 Difference]: Start difference. First operand 210 states and 221 transitions. Second operand 9 states. [2018-01-24 16:55:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:55:34,105 INFO L93 Difference]: Finished difference Result 210 states and 221 transitions. [2018-01-24 16:55:34,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:55:34,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-01-24 16:55:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:55:34,107 INFO L225 Difference]: With dead ends: 210 [2018-01-24 16:55:34,107 INFO L226 Difference]: Without dead ends: 209 [2018-01-24 16:55:34,108 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-01-24 16:55:34,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-24 16:55:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-01-24 16:55:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-24 16:55:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 220 transitions. [2018-01-24 16:55:34,119 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 220 transitions. Word has length 41 [2018-01-24 16:55:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:55:34,120 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 220 transitions. [2018-01-24 16:55:34,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:55:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 220 transitions. [2018-01-24 16:55:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 16:55:34,121 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:34,121 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 16:55:34,121 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:34,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1201783091, now seen corresponding path program 1 times [2018-01-24 16:55:34,121 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:34,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:34,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:34,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:34,122 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:34,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:34,285 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 16:55:34,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:55:34,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:55:34,286 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:55:34,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 16:55:34,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 16:55:34,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:55:34,286 INFO L87 Difference]: Start difference. First operand 209 states and 220 transitions. Second operand 11 states. [2018-01-24 16:55:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:55:34,654 INFO L93 Difference]: Finished difference Result 209 states and 220 transitions. [2018-01-24 16:55:34,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:55:34,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-01-24 16:55:34,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:55:34,655 INFO L225 Difference]: With dead ends: 209 [2018-01-24 16:55:34,656 INFO L226 Difference]: Without dead ends: 208 [2018-01-24 16:55:34,656 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 16:55:34,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-01-24 16:55:34,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-01-24 16:55:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-24 16:55:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 219 transitions. [2018-01-24 16:55:34,668 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 219 transitions. Word has length 41 [2018-01-24 16:55:34,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:55:34,668 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 219 transitions. [2018-01-24 16:55:34,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 16:55:34,668 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 219 transitions. [2018-01-24 16:55:34,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 16:55:34,669 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:55:34,670 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 16:55:34,670 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 16:55:34,670 INFO L82 PathProgramCache]: Analyzing trace with hash 856902849, now seen corresponding path program 1 times [2018-01-24 16:55:34,670 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:55:34,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:34,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:34,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:55:34,671 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:55:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:34,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:55:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:55:35,055 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:55:35,055 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:55:35,056 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-01-24 16:55:35,057 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [4], [7], [10], [13], [102], [104], [106], [111], [145], [146], [147], [150], [153], [165], [166], [170], [171], [175], [176], [177], [182], [184], [188], [238], [244], [245], [250], [251], [252], [253], [254], [256], [257] [2018-01-24 16:55:35,103 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:55:35,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:55:35,514 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:55:35,516 INFO L268 AbstractInterpreter]: Visited 36 different actions 60 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 16:55:35,529 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:55:35,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:55:35,529 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 16:55:35,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:55:35,544 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:55:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:55:35,610 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:55:36,337 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 16:55:36,340 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 16:55:36,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:55:36,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:55:36,355 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 16:55:36,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-01-24 16:55:36,481 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:55:36,484 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:55:36,485 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:55:36,486 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 16:55:36,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:55:36,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:55:36,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2018-01-24 16:55:36,609 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 16:55:36,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 16:55:36,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:55:36,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:55:36,630 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 16:55:36,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:35 [2018-01-24 16:55:36,787 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 16:55:36,790 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 16:55:36,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:55:36,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:55:36,801 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 16:55:36,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-01-24 16:55:36,938 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 16:55:36,938 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:55:36,983 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 16:55:36,987 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 16:55:36,992 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 16:55:36,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-01-24 16:55:37,287 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-24 16:55:37,287 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 7 variables, input treesize:55, output treesize:1 [2018-01-24 16:55:37,377 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 16:55:37,396 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 16:55:37,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:55:37,430 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 16:55:37,432 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 16:55:37,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:55:37,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:55:37,444 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 16:55:37,449 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 16:55:37,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:21 [2018-01-24 16:55:37,806 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 16:55:37,823 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 16:55:37,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:55:37,845 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 16:55:37,855 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 16:55:37,855 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 16:55:37,866 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 16:55:37,867 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 16:55:37,879 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 16:55:37,880 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:55:37,888 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 16:55:37,890 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 16:55:37,892 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 16:55:37,892 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:55:37,897 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:55:37,917 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 16:55:37,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-01-24 16:55:37,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-24 16:55:37,937 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 16:55:37,956 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 16:55:37,958 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 16:55:37,958 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 16:55:37,967 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 16:55:37,967 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 16:55:37,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 16:55:37,979 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 16:55:37,986 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 16:55:37,987 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 16:55:37,989 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 16:55:37,989 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 16:55:37,992 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:55:38,011 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 16:55:38,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 34 dim-0 vars, and 19 xjuncts. [2018-01-24 16:55:38,196 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:161, output treesize:607 [2018-01-24 16:55:38,198 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 19 [2018-01-24 16:55:38,291 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 6702 conjuctions. This might take some time... [2018-01-24 16:55:38,379 INFO L170 XnfTransformerHelper]: Simplified to disjunction of 76 conjuctions. [2018-01-24 16:55:38,396 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 75 [2018-01-24 16:55:42,754 WARN L152 XnfTransformerHelper]: Simplifying conjuction of 166676 disjunctions. This might take some time... [2018-01-24 16:55:50,360 INFO L170 XnfTransformerHelper]: Simplified to conjuction of 100 disjunctions. [2018-01-24 16:55:50,376 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 53 treesize of output 46 [2018-01-24 16:55:50,377 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:223) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:386) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 16:55:50,380 INFO L168 Benchmark]: Toolchain (without parser) took 24268.06 ms. Allocated memory was 298.8 MB in the beginning and 1.3 GB in the end (delta: 977.8 MB). Free memory was 258.9 MB in the beginning and 599.9 MB in the end (delta: -341.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-01-24 16:55:50,381 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 298.8 MB. Free memory is still 264.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:55:50,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.82 ms. Allocated memory is still 298.8 MB. Free memory was 257.9 MB in the beginning and 246.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:55:50,381 INFO L168 Benchmark]: Boogie Preprocessor took 42.87 ms. Allocated memory is still 298.8 MB. Free memory was 246.0 MB in the beginning and 244.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:55:50,381 INFO L168 Benchmark]: RCFGBuilder took 670.54 ms. Allocated memory is still 298.8 MB. Free memory was 244.0 MB in the beginning and 199.9 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:55:50,382 INFO L168 Benchmark]: TraceAbstraction took 23329.50 ms. Allocated memory was 298.8 MB in the beginning and 1.3 GB in the end (delta: 977.8 MB). Free memory was 199.9 MB in the beginning and 599.9 MB in the end (delta: -400.0 MB). Peak memory consumption was 973.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:55:50,383 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.11 ms. Allocated memory is still 298.8 MB. Free memory is still 264.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.82 ms. Allocated memory is still 298.8 MB. Free memory was 257.9 MB in the beginning and 246.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.87 ms. Allocated memory is still 298.8 MB. Free memory was 246.0 MB in the beginning and 244.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 670.54 ms. Allocated memory is still 298.8 MB. Free memory was 244.0 MB in the beginning and 199.9 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 23329.50 ms. Allocated memory was 298.8 MB in the beginning and 1.3 GB in the end (delta: 977.8 MB). Free memory was 199.9 MB in the beginning and 599.9 MB in the end (delta: -400.0 MB). Peak memory consumption was 973.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 35 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 440 LocStat_NO_SUPPORTING_DISEQUALITIES : 139 LocStat_NO_DISJUNCTIONS : -70 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 48 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 118 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 49 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.696467 RENAME_VARIABLES(MILLISECONDS) : 0.009490 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.350427 PROJECTAWAY(MILLISECONDS) : 1.110063 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001633 DISJOIN(MILLISECONDS) : 0.356603 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.021351 ADD_EQUALITY(MILLISECONDS) : 0.041044 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018199 #CONJOIN_DISJUNCTIVE : 104 #RENAME_VARIABLES : 208 #UNFREEZE : 0 #CONJOIN : 280 #PROJECTAWAY : 169 #ADD_WEAK_EQUALITY : 47 #DISJOIN : 30 #RENAME_VARIABLES_DISJUNCTIVE : 205 #ADD_EQUALITY : 147 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0137_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-55-50-390.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0137_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-55-50-390.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0137_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-55-50-390.csv Received shutdown request...