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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0137_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:49:52,071 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:49:52,073 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:49:52,085 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:49:52,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:49:52,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:49:52,086 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:49:52,088 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:49:52,089 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:49:52,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:49:52,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:49:52,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:49:52,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:49:52,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:49:52,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:49:52,095 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:49:52,097 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:49:52,098 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:49:52,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:49:52,100 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:49:52,102 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:49:52,102 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:49:52,102 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:49:52,103 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:49:52,104 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:49:52,105 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:49:52,105 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:49:52,106 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:49:52,106 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:49:52,106 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:49:52,106 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:49:52,107 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:49:52,116 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:49:52,116 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:49:52,117 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:49:52,117 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:49:52,117 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:49:52,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:49:52,117 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:49:52,117 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:49:52,117 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:49:52,117 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:49:52,118 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:49:52,118 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:49:52,118 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:49:52,118 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:49:52,118 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:49:52,118 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:49:52,118 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:49:52,118 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:49:52,118 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:49:52,118 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:49:52,119 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:49:52,119 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:49:52,119 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:49:52,119 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:49:52,119 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:49:52,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:49:52,154 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:49:52,156 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:49:52,157 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:49:52,158 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:49:52,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0137_false-valid-deref.i [2018-02-02 08:49:52,312 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:49:52,313 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:49:52,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:49:52,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:49:52,317 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:49:52,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:49:52" (1/1) ... [2018-02-02 08:49:52,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19495381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:52, skipping insertion in model container [2018-02-02 08:49:52,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:49:52" (1/1) ... [2018-02-02 08:49:52,330 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:49:52,358 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:49:52,453 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:49:52,472 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:49:52,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:52 WrapperNode [2018-02-02 08:49:52,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:49:52,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:49:52,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:49:52,482 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:49:52,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:52" (1/1) ... [2018-02-02 08:49:52,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:52" (1/1) ... [2018-02-02 08:49:52,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:52" (1/1) ... [2018-02-02 08:49:52,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:52" (1/1) ... [2018-02-02 08:49:52,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:52" (1/1) ... [2018-02-02 08:49:52,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:52" (1/1) ... [2018-02-02 08:49:52,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:52" (1/1) ... [2018-02-02 08:49:52,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:49:52,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:49:52,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:49:52,514 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:49:52,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:52" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:49:52,555 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:49:52,555 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:49:52,555 INFO L136 BoogieDeclarations]: Found implementation of procedure list_empty [2018-02-02 08:49:52,555 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-02 08:49:52,555 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-02-02 08:49:52,555 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-02-02 08:49:52,555 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-02-02 08:49:52,555 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-02-02 08:49:52,556 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-02-02 08:49:52,556 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-02-02 08:49:52,556 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-02-02 08:49:52,556 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_seek_max [2018-02-02 08:49:52,556 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-02-02 08:49:52,556 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:49:52,556 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 08:49:52,556 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 08:49:52,556 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 08:49:52,556 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 08:49:52,556 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:49:52,556 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:49:52,557 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:49:52,557 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 08:49:52,557 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 08:49:52,557 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:49:52,557 INFO L128 BoogieDeclarations]: Found specification of procedure list_empty [2018-02-02 08:49:52,557 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-02 08:49:52,557 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-02-02 08:49:52,557 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-02-02 08:49:52,557 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-02-02 08:49:52,557 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-02-02 08:49:52,557 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-02-02 08:49:52,557 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-02-02 08:49:52,557 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-02-02 08:49:52,557 INFO L128 BoogieDeclarations]: Found specification of procedure gl_seek_max [2018-02-02 08:49:52,558 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-02-02 08:49:52,558 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:49:52,558 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:49:52,558 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:49:52,980 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:49:52,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:49:52 BoogieIcfgContainer [2018-02-02 08:49:52,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:49:52,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:49:52,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:49:52,983 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:49:52,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:49:52" (1/3) ... [2018-02-02 08:49:52,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d79f1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:49:52, skipping insertion in model container [2018-02-02 08:49:52,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:49:52" (2/3) ... [2018-02-02 08:49:52,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d79f1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:49:52, skipping insertion in model container [2018-02-02 08:49:52,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:49:52" (3/3) ... [2018-02-02 08:49:52,985 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0137_false-valid-deref.i [2018-02-02 08:49:52,991 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:49:52,996 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-02-02 08:49:53,019 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:49:53,019 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:49:53,019 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:49:53,019 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:49:53,019 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:49:53,020 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:49:53,020 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:49:53,020 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:49:53,020 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:49:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states. [2018-02-02 08:49:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 08:49:53,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:53,038 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 08:49:53,038 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-02-02 08:49:53,041 INFO L82 PathProgramCache]: Analyzing trace with hash 8574872, now seen corresponding path program 1 times [2018-02-02 08:49:53,042 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:53,042 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:53,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:53,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:53,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:53,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:53,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:53,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:49:53,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:49:53,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:49:53,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:49:53,209 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 3 states. [2018-02-02 08:49:53,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:53,335 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2018-02-02 08:49:53,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:49:53,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 08:49:53,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:53,343 INFO L225 Difference]: With dead ends: 189 [2018-02-02 08:49:53,343 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 08:49:53,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:49:53,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 08:49:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-02-02 08:49:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 08:49:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-02-02 08:49:53,375 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 4 [2018-02-02 08:49:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:53,376 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-02-02 08:49:53,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:49:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-02-02 08:49:53,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 08:49:53,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:53,376 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 08:49:53,377 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-02-02 08:49:53,377 INFO L82 PathProgramCache]: Analyzing trace with hash 8574873, now seen corresponding path program 1 times [2018-02-02 08:49:53,377 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:53,377 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:53,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:53,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:53,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:53,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:53,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:53,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:53,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:49:53,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:49:53,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:49:53,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:49:53,443 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 3 states. [2018-02-02 08:49:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:53,539 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2018-02-02 08:49:53,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:49:53,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 08:49:53,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:53,541 INFO L225 Difference]: With dead ends: 187 [2018-02-02 08:49:53,541 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 08:49:53,541 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:49:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 08:49:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-02-02 08:49:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 08:49:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2018-02-02 08:49:53,553 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 4 [2018-02-02 08:49:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:53,554 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2018-02-02 08:49:53,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:49:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2018-02-02 08:49:53,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 08:49:53,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:53,555 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:53,555 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-02-02 08:49:53,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1609065266, now seen corresponding path program 1 times [2018-02-02 08:49:53,555 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:53,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:53,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:53,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:53,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:53,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:53,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:53,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:49:53,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:49:53,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:49:53,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:49:53,606 INFO L87 Difference]: Start difference. First operand 183 states and 194 transitions. Second operand 4 states. [2018-02-02 08:49:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:53,727 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2018-02-02 08:49:53,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:49:53,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 08:49:53,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:53,729 INFO L225 Difference]: With dead ends: 182 [2018-02-02 08:49:53,729 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 08:49:53,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:49:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 08:49:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-02-02 08:49:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 08:49:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-02-02 08:49:53,735 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 16 [2018-02-02 08:49:53,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:53,735 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-02-02 08:49:53,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:49:53,735 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-02-02 08:49:53,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 08:49:53,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:53,735 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:53,735 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-02-02 08:49:53,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1609065267, now seen corresponding path program 1 times [2018-02-02 08:49:53,736 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:53,736 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:53,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:53,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:53,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:53,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:53,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:53,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:49:53,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:49:53,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:49:53,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:49:53,799 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 4 states. [2018-02-02 08:49:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:53,919 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-02-02 08:49:53,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:49:53,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 08:49:53,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:53,920 INFO L225 Difference]: With dead ends: 181 [2018-02-02 08:49:53,920 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 08:49:53,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:49:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 08:49:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-02-02 08:49:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 08:49:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2018-02-02 08:49:53,927 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 16 [2018-02-02 08:49:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:53,927 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2018-02-02 08:49:53,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:49:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2018-02-02 08:49:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 08:49:53,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:53,928 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:53,928 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-02-02 08:49:53,928 INFO L82 PathProgramCache]: Analyzing trace with hash -466429743, now seen corresponding path program 1 times [2018-02-02 08:49:53,929 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:53,929 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:53,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:53,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:53,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:53,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:54,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:54,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:49:54,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:49:54,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:49:54,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:49:54,009 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand 7 states. [2018-02-02 08:49:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:54,219 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2018-02-02 08:49:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:49:54,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 08:49:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:54,220 INFO L225 Difference]: With dead ends: 189 [2018-02-02 08:49:54,220 INFO L226 Difference]: Without dead ends: 189 [2018-02-02 08:49:54,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:49:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-02 08:49:54,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-02-02 08:49:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-02-02 08:49:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2018-02-02 08:49:54,225 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 19 [2018-02-02 08:49:54,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:54,225 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2018-02-02 08:49:54,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:49:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2018-02-02 08:49:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 08:49:54,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:54,225 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:54,225 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-02-02 08:49:54,226 INFO L82 PathProgramCache]: Analyzing trace with hash -466429742, now seen corresponding path program 1 times [2018-02-02 08:49:54,226 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:54,226 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:54,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:54,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:54,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:54,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:54,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:54,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:49:54,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:49:54,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:49:54,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:49:54,292 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand 7 states. [2018-02-02 08:49:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:54,601 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-02-02 08:49:54,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:49:54,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 08:49:54,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:54,603 INFO L225 Difference]: With dead ends: 182 [2018-02-02 08:49:54,603 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 08:49:54,604 INFO L554 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-02-02 08:49:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 08:49:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-02-02 08:49:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 08:49:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-02-02 08:49:54,612 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 19 [2018-02-02 08:49:54,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:54,612 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-02-02 08:49:54,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:49:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-02-02 08:49:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 08:49:54,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:54,613 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:54,613 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-02-02 08:49:54,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1189060692, now seen corresponding path program 1 times [2018-02-02 08:49:54,614 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:54,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:54,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:54,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:54,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:54,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:54,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:54,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 08:49:54,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 08:49:54,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 08:49:54,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:49:54,744 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 10 states. [2018-02-02 08:49:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:55,059 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2018-02-02 08:49:55,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:49:55,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 08:49:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:55,060 INFO L225 Difference]: With dead ends: 208 [2018-02-02 08:49:55,060 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 08:49:55,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-02-02 08:49:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 08:49:55,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 200. [2018-02-02 08:49:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-02 08:49:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 219 transitions. [2018-02-02 08:49:55,066 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 219 transitions. Word has length 22 [2018-02-02 08:49:55,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:55,067 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 219 transitions. [2018-02-02 08:49:55,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 08:49:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 219 transitions. [2018-02-02 08:49:55,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 08:49:55,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:55,068 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:55,071 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-02-02 08:49:55,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1189060691, now seen corresponding path program 1 times [2018-02-02 08:49:55,071 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:55,071 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:55,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:55,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:55,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:55,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:55,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:55,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 08:49:55,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 08:49:55,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 08:49:55,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:49:55,242 INFO L87 Difference]: Start difference. First operand 200 states and 219 transitions. Second operand 11 states. [2018-02-02 08:49:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:56,043 INFO L93 Difference]: Finished difference Result 372 states and 392 transitions. [2018-02-02 08:49:56,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:49:56,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-02 08:49:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:56,045 INFO L225 Difference]: With dead ends: 372 [2018-02-02 08:49:56,046 INFO L226 Difference]: Without dead ends: 372 [2018-02-02 08:49:56,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-02 08:49:56,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-02-02 08:49:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 296. [2018-02-02 08:49:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-02 08:49:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 362 transitions. [2018-02-02 08:49:56,056 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 362 transitions. Word has length 22 [2018-02-02 08:49:56,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:56,057 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 362 transitions. [2018-02-02 08:49:56,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 08:49:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 362 transitions. [2018-02-02 08:49:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:49:56,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:56,058 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:56,058 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-02-02 08:49:56,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1793824186, now seen corresponding path program 1 times [2018-02-02 08:49:56,058 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:56,058 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:56,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:56,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:56,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:56,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:56,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:56,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:49:56,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:49:56,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:49:56,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:49:56,125 INFO L87 Difference]: Start difference. First operand 296 states and 362 transitions. Second operand 7 states. [2018-02-02 08:49:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:56,325 INFO L93 Difference]: Finished difference Result 308 states and 370 transitions. [2018-02-02 08:49:56,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:49:56,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 08:49:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:56,327 INFO L225 Difference]: With dead ends: 308 [2018-02-02 08:49:56,327 INFO L226 Difference]: Without dead ends: 308 [2018-02-02 08:49:56,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:49:56,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-02 08:49:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 211. [2018-02-02 08:49:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 08:49:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 230 transitions. [2018-02-02 08:49:56,334 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 230 transitions. Word has length 23 [2018-02-02 08:49:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:56,334 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 230 transitions. [2018-02-02 08:49:56,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:49:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 230 transitions. [2018-02-02 08:49:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:49:56,335 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:56,335 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:56,335 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-02-02 08:49:56,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1793824187, now seen corresponding path program 1 times [2018-02-02 08:49:56,335 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:56,335 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:56,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:56,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:56,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:56,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:56,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:56,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:49:56,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:49:56,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:49:56,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:49:56,428 INFO L87 Difference]: Start difference. First operand 211 states and 230 transitions. Second operand 8 states. [2018-02-02 08:49:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:56,671 INFO L93 Difference]: Finished difference Result 215 states and 226 transitions. [2018-02-02 08:49:56,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:49:56,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-02 08:49:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:56,672 INFO L225 Difference]: With dead ends: 215 [2018-02-02 08:49:56,672 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 08:49:56,673 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:49:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 08:49:56,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2018-02-02 08:49:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 08:49:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 226 transitions. [2018-02-02 08:49:56,677 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 226 transitions. Word has length 23 [2018-02-02 08:49:56,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:56,677 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 226 transitions. [2018-02-02 08:49:56,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:49:56,677 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions. [2018-02-02 08:49:56,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:49:56,678 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:56,678 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:56,678 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-02-02 08:49:56,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1583156317, now seen corresponding path program 1 times [2018-02-02 08:49:56,678 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:56,679 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:56,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:56,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:56,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:56,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:56,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:56,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:49:56,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:49:56,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:49:56,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:49:56,711 INFO L87 Difference]: Start difference. First operand 211 states and 226 transitions. Second operand 5 states. [2018-02-02 08:49:56,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:56,842 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2018-02-02 08:49:56,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:49:56,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 08:49:56,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:56,843 INFO L225 Difference]: With dead ends: 210 [2018-02-02 08:49:56,843 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 08:49:56,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:49:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 08:49:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-02-02 08:49:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 08:49:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2018-02-02 08:49:56,848 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 25 [2018-02-02 08:49:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:56,849 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2018-02-02 08:49:56,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:49:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2018-02-02 08:49:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:49:56,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:56,849 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:56,849 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-02-02 08:49:56,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1583156318, now seen corresponding path program 1 times [2018-02-02 08:49:56,850 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:56,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:56,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:56,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:56,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:56,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:56,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:56,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:49:56,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:49:56,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:49:56,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:49:56,909 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand 8 states. [2018-02-02 08:49:57,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:57,084 INFO L93 Difference]: Finished difference Result 212 states and 221 transitions. [2018-02-02 08:49:57,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:49:57,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-02 08:49:57,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:57,085 INFO L225 Difference]: With dead ends: 212 [2018-02-02 08:49:57,085 INFO L226 Difference]: Without dead ends: 212 [2018-02-02 08:49:57,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:49:57,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-02 08:49:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-02-02 08:49:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 08:49:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 221 transitions. [2018-02-02 08:49:57,091 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 221 transitions. Word has length 25 [2018-02-02 08:49:57,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:57,092 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 221 transitions. [2018-02-02 08:49:57,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:49:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 221 transitions. [2018-02-02 08:49:57,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 08:49:57,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:57,093 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:57,093 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-02-02 08:49:57,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1201783090, now seen corresponding path program 1 times [2018-02-02 08:49:57,093 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:57,093 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:57,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:57,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:57,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:57,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:57,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:57,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:49:57,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:49:57,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:49:57,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:49:57,170 INFO L87 Difference]: Start difference. First operand 210 states and 221 transitions. Second operand 9 states. [2018-02-02 08:49:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:57,445 INFO L93 Difference]: Finished difference Result 209 states and 220 transitions. [2018-02-02 08:49:57,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:49:57,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-02 08:49:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:57,446 INFO L225 Difference]: With dead ends: 209 [2018-02-02 08:49:57,446 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 08:49:57,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:49:57,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 08:49:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-02-02 08:49:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 08:49:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 220 transitions. [2018-02-02 08:49:57,453 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 220 transitions. Word has length 41 [2018-02-02 08:49:57,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:57,454 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 220 transitions. [2018-02-02 08:49:57,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:49:57,454 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 220 transitions. [2018-02-02 08:49:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 08:49:57,457 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:57,458 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:57,458 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-02-02 08:49:57,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1201783091, now seen corresponding path program 1 times [2018-02-02 08:49:57,458 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:57,458 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:57,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:57,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:57,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:57,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:57,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:49:57,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 08:49:57,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 08:49:57,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 08:49:57,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:49:57,573 INFO L87 Difference]: Start difference. First operand 209 states and 220 transitions. Second operand 11 states. [2018-02-02 08:49:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:49:57,953 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2018-02-02 08:49:57,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:49:57,954 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 08:49:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:49:57,955 INFO L225 Difference]: With dead ends: 208 [2018-02-02 08:49:57,955 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 08:49:57,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-02-02 08:49:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 08:49:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-02-02 08:49:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 08:49:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 219 transitions. [2018-02-02 08:49:57,960 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 219 transitions. Word has length 41 [2018-02-02 08:49:57,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:49:57,961 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 219 transitions. [2018-02-02 08:49:57,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 08:49:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 219 transitions. [2018-02-02 08:49:57,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 08:49:57,962 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:49:57,962 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:49:57,962 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-02-02 08:49:57,962 INFO L82 PathProgramCache]: Analyzing trace with hash 856902849, now seen corresponding path program 1 times [2018-02-02 08:49:57,962 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:49:57,962 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:49:57,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:57,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:57,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:49:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:57,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:49:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:58,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:49:58,496 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:49:58,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:49:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:49:58,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:49:58,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:49:58,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:49:58,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:58,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:49:58,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:49:58,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-02-02 08:49:58,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:49:58,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:49:58,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:49:58,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2018-02-02 08:49:58,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:58,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:49:58,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2018-02-02 08:49:58,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-02 08:49:58,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-02 08:49:58,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:58,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:49:58,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:49:58,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:35 [2018-02-02 08:49:59,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-02 08:49:59,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-02 08:49:59,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:49:59,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:49:59,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 08:49:59,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-02-02 08:49:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:49:59,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:49:59,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2018-02-02 08:49:59,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 08:49:59,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 08:49:59,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 08:49:59,147 INFO L87 Difference]: Start difference. First operand 208 states and 219 transitions. Second operand 35 states. [2018-02-02 08:50:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:00,759 INFO L93 Difference]: Finished difference Result 299 states and 314 transitions. [2018-02-02 08:50:00,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 08:50:00,759 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 48 [2018-02-02 08:50:00,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:00,760 INFO L225 Difference]: With dead ends: 299 [2018-02-02 08:50:00,760 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 08:50:00,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=289, Invalid=1967, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 08:50:00,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 08:50:00,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 217. [2018-02-02 08:50:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 08:50:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 227 transitions. [2018-02-02 08:50:00,765 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 227 transitions. Word has length 48 [2018-02-02 08:50:00,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:00,765 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 227 transitions. [2018-02-02 08:50:00,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 08:50:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 227 transitions. [2018-02-02 08:50:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 08:50:00,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:00,766 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:00,766 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__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-02-02 08:50:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash 856902850, now seen corresponding path program 1 times [2018-02-02 08:50:00,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:00,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:00,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:00,767 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:00,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:00,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:50:01,196 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:50:01,196 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:50:01,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:01,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:50:01,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:50:01,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-02 08:50:01,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:50:01,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:50:01,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:50:01,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:50:01,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 08:50:01,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-02-02 08:50:01,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:01,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:01,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:50:01,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-02 08:50:01,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:36 [2018-02-02 08:50:01,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-02-02 08:50:01,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-02 08:50:01,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-02 08:50:01,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-02 08:50:01,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:50:01,863 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:36 [2018-02-02 08:50:01,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-02 08:50:01,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-02-02 08:50:01,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-02-02 08:50:01,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-02-02 08:50:01,978 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:01,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:50:01,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:17 [2018-02-02 08:50:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:50:02,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:50:02,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 36 [2018-02-02 08:50:02,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 08:50:02,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 08:50:02,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 08:50:02,050 INFO L87 Difference]: Start difference. First operand 217 states and 227 transitions. Second operand 37 states. [2018-02-02 08:50:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:04,903 INFO L93 Difference]: Finished difference Result 260 states and 273 transitions. [2018-02-02 08:50:04,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 08:50:04,903 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 48 [2018-02-02 08:50:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:04,905 INFO L225 Difference]: With dead ends: 260 [2018-02-02 08:50:04,905 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 08:50:04,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=425, Invalid=2881, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 08:50:04,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 08:50:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 194. [2018-02-02 08:50:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 08:50:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 203 transitions. [2018-02-02 08:50:04,909 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 203 transitions. Word has length 48 [2018-02-02 08:50:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:04,910 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 203 transitions. [2018-02-02 08:50:04,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 08:50:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 203 transitions. [2018-02-02 08:50:04,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 08:50:04,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:04,910 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:04,910 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__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-02-02 08:50:04,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1348377315, now seen corresponding path program 1 times [2018-02-02 08:50:04,911 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:04,911 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:04,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:04,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:04,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:04,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:50:04,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:04,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:50:04,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:50:04,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:50:04,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:50:04,946 INFO L87 Difference]: Start difference. First operand 194 states and 203 transitions. Second operand 3 states. [2018-02-02 08:50:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:04,998 INFO L93 Difference]: Finished difference Result 188 states and 197 transitions. [2018-02-02 08:50:04,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:50:04,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-02 08:50:04,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:04,999 INFO L225 Difference]: With dead ends: 188 [2018-02-02 08:50:04,999 INFO L226 Difference]: Without dead ends: 188 [2018-02-02 08:50:05,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:50:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-02 08:50:05,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-02-02 08:50:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 08:50:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 197 transitions. [2018-02-02 08:50:05,004 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 197 transitions. Word has length 48 [2018-02-02 08:50:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:05,004 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 197 transitions. [2018-02-02 08:50:05,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:50:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 197 transitions. [2018-02-02 08:50:05,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 08:50:05,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:05,007 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:05,007 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__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-02-02 08:50:05,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1348377314, now seen corresponding path program 1 times [2018-02-02 08:50:05,008 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:05,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:05,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:05,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:05,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:05,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:50:05,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:05,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:50:05,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:50:05,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:50:05,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:50:05,062 INFO L87 Difference]: Start difference. First operand 188 states and 197 transitions. Second operand 3 states. [2018-02-02 08:50:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:05,111 INFO L93 Difference]: Finished difference Result 182 states and 191 transitions. [2018-02-02 08:50:05,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:50:05,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-02 08:50:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:05,112 INFO L225 Difference]: With dead ends: 182 [2018-02-02 08:50:05,112 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 08:50:05,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:50:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 08:50:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-02-02 08:50:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 08:50:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 191 transitions. [2018-02-02 08:50:05,116 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 191 transitions. Word has length 48 [2018-02-02 08:50:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:05,117 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 191 transitions. [2018-02-02 08:50:05,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:50:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 191 transitions. [2018-02-02 08:50:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 08:50:05,117 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:05,117 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:05,117 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__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-02-02 08:50:05,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1058765471, now seen corresponding path program 1 times [2018-02-02 08:50:05,118 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:05,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:05,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:05,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:05,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:05,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:50:05,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:05,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 08:50:05,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 08:50:05,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 08:50:05,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:50:05,194 INFO L87 Difference]: Start difference. First operand 182 states and 191 transitions. Second operand 11 states. [2018-02-02 08:50:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:05,681 INFO L93 Difference]: Finished difference Result 266 states and 283 transitions. [2018-02-02 08:50:05,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 08:50:05,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-02-02 08:50:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:05,682 INFO L225 Difference]: With dead ends: 266 [2018-02-02 08:50:05,682 INFO L226 Difference]: Without dead ends: 266 [2018-02-02 08:50:05,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-02-02 08:50:05,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-02 08:50:05,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 188. [2018-02-02 08:50:05,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 08:50:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2018-02-02 08:50:05,685 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 55 [2018-02-02 08:50:05,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:05,685 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2018-02-02 08:50:05,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 08:50:05,685 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2018-02-02 08:50:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 08:50:05,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:05,686 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:05,686 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__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-02-02 08:50:05,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1058765472, now seen corresponding path program 1 times [2018-02-02 08:50:05,686 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:05,686 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:05,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:05,687 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:05,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:05,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:50:05,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:05,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 08:50:05,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:50:05,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:50:05,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:50:05,864 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand 12 states. [2018-02-02 08:50:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:06,635 INFO L93 Difference]: Finished difference Result 210 states and 220 transitions. [2018-02-02 08:50:06,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:50:06,636 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-02-02 08:50:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:06,636 INFO L225 Difference]: With dead ends: 210 [2018-02-02 08:50:06,637 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 08:50:06,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-02-02 08:50:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 08:50:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 191. [2018-02-02 08:50:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 08:50:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 202 transitions. [2018-02-02 08:50:06,641 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 202 transitions. Word has length 55 [2018-02-02 08:50:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:06,641 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 202 transitions. [2018-02-02 08:50:06,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:50:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 202 transitions. [2018-02-02 08:50:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 08:50:06,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:06,642 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:06,642 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__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-02-02 08:50:06,642 INFO L82 PathProgramCache]: Analyzing trace with hash -558928184, now seen corresponding path program 1 times [2018-02-02 08:50:06,642 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:06,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:06,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:06,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:06,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:06,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:50:06,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:06,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 08:50:06,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 08:50:06,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 08:50:06,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:50:06,843 INFO L87 Difference]: Start difference. First operand 191 states and 202 transitions. Second operand 16 states. [2018-02-02 08:50:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:07,744 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-02 08:50:07,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 08:50:07,744 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-02-02 08:50:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:07,745 INFO L225 Difference]: With dead ends: 217 [2018-02-02 08:50:07,745 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 08:50:07,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 08:50:07,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 08:50:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 189. [2018-02-02 08:50:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 08:50:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 199 transitions. [2018-02-02 08:50:07,748 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 199 transitions. Word has length 58 [2018-02-02 08:50:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:07,748 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 199 transitions. [2018-02-02 08:50:07,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 08:50:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2018-02-02 08:50:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 08:50:07,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:07,749 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:07,749 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__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-02-02 08:50:07,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1044324748, now seen corresponding path program 1 times [2018-02-02 08:50:07,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:07,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:07,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:07,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:07,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:07,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:50:07,998 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:50:07,998 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:50:08,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:08,034 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:50:08,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-02 08:50:08,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-02 08:50:08,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:08,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:08,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:08,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-02-02 08:50:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:50:08,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:50:08,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 28 [2018-02-02 08:50:08,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 08:50:08,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 08:50:08,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2018-02-02 08:50:08,190 INFO L87 Difference]: Start difference. First operand 189 states and 199 transitions. Second operand 28 states. [2018-02-02 08:50:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:09,473 INFO L93 Difference]: Finished difference Result 201 states and 209 transitions. [2018-02-02 08:50:09,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 08:50:09,474 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-02-02 08:50:09,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:09,474 INFO L225 Difference]: With dead ends: 201 [2018-02-02 08:50:09,474 INFO L226 Difference]: Without dead ends: 189 [2018-02-02 08:50:09,475 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=459, Invalid=3201, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 08:50:09,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-02 08:50:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 171. [2018-02-02 08:50:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 08:50:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 177 transitions. [2018-02-02 08:50:09,478 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 177 transitions. Word has length 60 [2018-02-02 08:50:09,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:09,478 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 177 transitions. [2018-02-02 08:50:09,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 08:50:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 177 transitions. [2018-02-02 08:50:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 08:50:09,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:09,479 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:09,479 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__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-02-02 08:50:09,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1010017735, now seen corresponding path program 1 times [2018-02-02 08:50:09,480 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:09,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:09,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:09,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:09,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:09,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:50:09,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:09,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 08:50:09,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 08:50:09,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 08:50:09,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-02 08:50:09,782 INFO L87 Difference]: Start difference. First operand 171 states and 177 transitions. Second operand 18 states. [2018-02-02 08:50:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:10,403 INFO L93 Difference]: Finished difference Result 266 states and 284 transitions. [2018-02-02 08:50:10,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 08:50:10,403 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-02-02 08:50:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:10,404 INFO L225 Difference]: With dead ends: 266 [2018-02-02 08:50:10,404 INFO L226 Difference]: Without dead ends: 266 [2018-02-02 08:50:10,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2018-02-02 08:50:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-02 08:50:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 208. [2018-02-02 08:50:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 08:50:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 223 transitions. [2018-02-02 08:50:10,408 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 223 transitions. Word has length 66 [2018-02-02 08:50:10,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:10,408 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 223 transitions. [2018-02-02 08:50:10,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 08:50:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 223 transitions. [2018-02-02 08:50:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 08:50:10,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:10,409 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:10,409 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__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-02-02 08:50:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1010017736, now seen corresponding path program 1 times [2018-02-02 08:50:10,409 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:10,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:10,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:10,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:10,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:10,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:50:10,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:10,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 08:50:10,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 08:50:10,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 08:50:10,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-02 08:50:10,876 INFO L87 Difference]: Start difference. First operand 208 states and 223 transitions. Second operand 19 states. [2018-02-02 08:50:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:11,667 INFO L93 Difference]: Finished difference Result 250 states and 266 transitions. [2018-02-02 08:50:11,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 08:50:11,668 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2018-02-02 08:50:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:11,668 INFO L225 Difference]: With dead ends: 250 [2018-02-02 08:50:11,668 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 08:50:11,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2018-02-02 08:50:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 08:50:11,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 208. [2018-02-02 08:50:11,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 08:50:11,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 221 transitions. [2018-02-02 08:50:11,673 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 221 transitions. Word has length 66 [2018-02-02 08:50:11,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:11,673 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 221 transitions. [2018-02-02 08:50:11,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 08:50:11,673 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2018-02-02 08:50:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 08:50:11,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:11,674 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:11,674 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__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-02-02 08:50:11,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1387017030, now seen corresponding path program 1 times [2018-02-02 08:50:11,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:11,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:11,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:11,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:11,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:11,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:50:11,731 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:11,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:50:11,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:50:11,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:50:11,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:50:11,732 INFO L87 Difference]: Start difference. First operand 208 states and 221 transitions. Second operand 5 states. [2018-02-02 08:50:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:11,839 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2018-02-02 08:50:11,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:50:11,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-02 08:50:11,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:11,840 INFO L225 Difference]: With dead ends: 214 [2018-02-02 08:50:11,840 INFO L226 Difference]: Without dead ends: 214 [2018-02-02 08:50:11,840 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:50:11,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-02 08:50:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-02-02 08:50:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 08:50:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 227 transitions. [2018-02-02 08:50:11,844 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 227 transitions. Word has length 67 [2018-02-02 08:50:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:11,844 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 227 transitions. [2018-02-02 08:50:11,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:50:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 227 transitions. [2018-02-02 08:50:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 08:50:11,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:11,845 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:11,845 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__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-02-02 08:50:11,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1387017031, now seen corresponding path program 1 times [2018-02-02 08:50:11,846 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:11,846 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:11,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:11,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:11,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:11,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:50:11,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:11,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:50:11,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:50:11,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:50:11,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:50:11,949 INFO L87 Difference]: Start difference. First operand 212 states and 227 transitions. Second operand 5 states. [2018-02-02 08:50:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:12,102 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2018-02-02 08:50:12,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:50:12,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-02 08:50:12,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:12,104 INFO L225 Difference]: With dead ends: 218 [2018-02-02 08:50:12,104 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 08:50:12,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:50:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 08:50:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2018-02-02 08:50:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 08:50:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 226 transitions. [2018-02-02 08:50:12,106 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 226 transitions. Word has length 67 [2018-02-02 08:50:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:12,107 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 226 transitions. [2018-02-02 08:50:12,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:50:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 226 transitions. [2018-02-02 08:50:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 08:50:12,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:12,107 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:12,107 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__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-02-02 08:50:12,107 INFO L82 PathProgramCache]: Analyzing trace with hash 48096554, now seen corresponding path program 1 times [2018-02-02 08:50:12,107 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:12,108 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:12,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:12,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:12,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:12,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:50:12,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:12,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:50:12,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:50:12,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:50:12,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:50:12,143 INFO L87 Difference]: Start difference. First operand 212 states and 226 transitions. Second operand 5 states. [2018-02-02 08:50:12,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:12,154 INFO L93 Difference]: Finished difference Result 220 states and 234 transitions. [2018-02-02 08:50:12,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:50:12,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-02-02 08:50:12,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:12,155 INFO L225 Difference]: With dead ends: 220 [2018-02-02 08:50:12,155 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 08:50:12,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:50:12,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 08:50:12,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-02-02 08:50:12,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 08:50:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 234 transitions. [2018-02-02 08:50:12,157 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 234 transitions. Word has length 68 [2018-02-02 08:50:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:12,157 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 234 transitions. [2018-02-02 08:50:12,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:50:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 234 transitions. [2018-02-02 08:50:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 08:50:12,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:12,158 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:12,158 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__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-02-02 08:50:12,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1255988233, now seen corresponding path program 1 times [2018-02-02 08:50:12,158 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:12,158 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:12,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:12,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:12,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:12,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 08:50:12,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:12,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 08:50:12,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 08:50:12,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 08:50:12,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:50:12,314 INFO L87 Difference]: Start difference. First operand 220 states and 234 transitions. Second operand 11 states. [2018-02-02 08:50:12,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:12,824 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-02-02 08:50:12,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 08:50:12,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-02-02 08:50:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:12,826 INFO L225 Difference]: With dead ends: 229 [2018-02-02 08:50:12,826 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 08:50:12,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-02-02 08:50:12,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 08:50:12,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2018-02-02 08:50:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 08:50:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2018-02-02 08:50:12,830 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 70 [2018-02-02 08:50:12,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:12,830 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2018-02-02 08:50:12,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 08:50:12,830 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2018-02-02 08:50:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 08:50:12,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:12,831 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:12,831 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__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-02-02 08:50:12,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1255988232, now seen corresponding path program 1 times [2018-02-02 08:50:12,832 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:12,832 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:12,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:12,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:12,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:12,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 08:50:13,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:13,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 08:50:13,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 08:50:13,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 08:50:13,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-02 08:50:13,162 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand 14 states. [2018-02-02 08:50:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:13,603 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-02-02 08:50:13,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 08:50:13,603 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-02-02 08:50:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:13,603 INFO L225 Difference]: With dead ends: 229 [2018-02-02 08:50:13,603 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 08:50:13,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-02-02 08:50:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 08:50:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2018-02-02 08:50:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 08:50:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 237 transitions. [2018-02-02 08:50:13,606 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 237 transitions. Word has length 70 [2018-02-02 08:50:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:13,606 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 237 transitions. [2018-02-02 08:50:13,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 08:50:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 237 transitions. [2018-02-02 08:50:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 08:50:13,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:13,607 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:13,607 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__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-02-02 08:50:13,607 INFO L82 PathProgramCache]: Analyzing trace with hash 593824277, now seen corresponding path program 1 times [2018-02-02 08:50:13,607 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:13,607 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:13,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:13,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:13,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:13,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 08:50:14,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:50:14,393 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:50:14,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:14,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:50:14,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:50:14,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:50:14,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:50:14,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:50:14,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-02 08:50:14,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-02 08:50:14,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:14,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 08:50:14,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-02 08:50:14,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 08:50:14,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,595 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 13 [2018-02-02 08:50:14,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:14,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-02 08:50:14,597 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,598 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,600 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:10 [2018-02-02 08:50:14,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 08:50:14,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,715 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 15 treesize of output 12 [2018-02-02 08:50:14,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-02 08:50:14,716 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,717 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:50:14,725 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:38, output treesize:12 [2018-02-02 08:50:14,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:50:14,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:50:14,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:50:14,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-02 08:50:14,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-02-02 08:50:14,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:14,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 08:50:14,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:14,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:50:15,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-02 08:50:15,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-02-02 08:50:15,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-02-02 08:50:15,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:15,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2018-02-02 08:50:15,075 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 08:50:15,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:50:15,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:50:15,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:50:15,101 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,102 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 08:50:15,114 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:47, output treesize:78 [2018-02-02 08:50:15,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,281 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:50:15,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:50:15,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:50:15,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:228, output treesize:99 [2018-02-02 08:50:15,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:15,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:15,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-02 08:50:15,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,486 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 36 treesize of output 30 [2018-02-02 08:50:15,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:15,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-02-02 08:50:15,490 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,492 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,502 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:120, output treesize:72 [2018-02-02 08:50:15,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:15,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:15,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:15,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-02 08:50:15,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:70 [2018-02-02 08:50:15,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 60 [2018-02-02 08:50:15,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:50:15,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,639 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 58 treesize of output 59 [2018-02-02 08:50:15,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:50:15,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,673 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:84 [2018-02-02 08:50:15,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67 [2018-02-02 08:50:15,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:15,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 08:50:15,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,801 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 67 treesize of output 66 [2018-02-02 08:50:15,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:15,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 08:50:15,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 08:50:15,830 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:102 [2018-02-02 08:50:15,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-02-02 08:50:15,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2018-02-02 08:50:15,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:15,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-02 08:50:15,951 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:15,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 08:50:15,967 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:118, output treesize:79 [2018-02-02 08:50:16,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 51 [2018-02-02 08:50:16,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-02 08:50:16,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:16,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:16,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-02 08:50:16,221 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:16,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:16,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-02 08:50:16,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:16,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:16,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:16,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:5 [2018-02-02 08:50:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:50:16,278 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:50:16,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 29] total 56 [2018-02-02 08:50:16,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-02 08:50:16,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-02 08:50:16,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3002, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 08:50:16,279 INFO L87 Difference]: Start difference. First operand 223 states and 237 transitions. Second operand 57 states. Received shutdown request... [2018-02-02 08:50:53,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 08:50:53,763 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 08:50:53,768 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 08:50:53,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:50:53 BoogieIcfgContainer [2018-02-02 08:50:53,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:50:53,769 INFO L168 Benchmark]: Toolchain (without parser) took 61456.83 ms. Allocated memory was 398.5 MB in the beginning and 1.1 GB in the end (delta: 751.3 MB). Free memory was 355.3 MB in the beginning and 772.1 MB in the end (delta: -416.8 MB). Peak memory consumption was 334.5 MB. Max. memory is 5.3 GB. [2018-02-02 08:50:53,770 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 398.5 MB. Free memory is still 361.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:50:53,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.56 ms. Allocated memory is still 398.5 MB. Free memory was 355.3 MB in the beginning and 343.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-02-02 08:50:53,770 INFO L168 Benchmark]: Boogie Preprocessor took 31.59 ms. Allocated memory is still 398.5 MB. Free memory was 343.3 MB in the beginning and 342.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:50:53,770 INFO L168 Benchmark]: RCFGBuilder took 466.65 ms. Allocated memory is still 398.5 MB. Free memory was 342.0 MB in the beginning and 296.0 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 5.3 GB. [2018-02-02 08:50:53,770 INFO L168 Benchmark]: TraceAbstraction took 60787.20 ms. Allocated memory was 398.5 MB in the beginning and 1.1 GB in the end (delta: 751.3 MB). Free memory was 294.7 MB in the beginning and 772.1 MB in the end (delta: -477.4 MB). Peak memory consumption was 273.9 MB. Max. memory is 5.3 GB. [2018-02-02 08:50:53,776 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.12 ms. Allocated memory is still 398.5 MB. Free memory is still 361.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.56 ms. Allocated memory is still 398.5 MB. Free memory was 355.3 MB in the beginning and 343.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.59 ms. Allocated memory is still 398.5 MB. Free memory was 343.3 MB in the beginning and 342.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 466.65 ms. Allocated memory is still 398.5 MB. Free memory was 342.0 MB in the beginning and 296.0 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60787.20 ms. Allocated memory was 398.5 MB in the beginning and 1.1 GB in the end (delta: 751.3 MB). Free memory was 294.7 MB in the beginning and 772.1 MB in the end (delta: -477.4 MB). Peak memory consumption was 273.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 717). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 717). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 711). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 711). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 717). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 717). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 717). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 717). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 711). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 717). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 717). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 711). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 695). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 695). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (223states) and interpolant automaton (currently 22 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 188 locations, 63 error locations. TIMEOUT Result, 60.7s OverallTime, 30 OverallIterations, 2 TraceHistogramMax, 51.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3943 SDtfs, 5030 SDslu, 17569 SDs, 0 SdLazy, 21599 SolverSat, 1126 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 41.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 812 GetRequests, 245 SyntacticMatches, 19 SemanticMatches, 548 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3831 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 605 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 1504 NumberOfCodeBlocks, 1504 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1470 ConstructedInterpolants, 69 QuantifiedInterpolants, 931626 SizeOfPredicates, 92 NumberOfNonLiveVariables, 1301 ConjunctsInSsa, 281 ConjunctsInUnsatCore, 34 InterpolantComputations, 27 PerfectInterpolantSequences, 64/105 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0137_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-50-53-790.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0137_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-50-53-790.csv Completed graceful shutdown