java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:57:52,825 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:57:52,827 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:57:52,840 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:57:52,840 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:57:52,841 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:57:52,842 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:57:52,844 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:57:52,845 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:57:52,846 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:57:52,847 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:57:52,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:57:52,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:57:52,849 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:57:52,849 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:57:52,851 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:57:52,853 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:57:52,854 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:57:52,855 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:57:52,856 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:57:52,857 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:57:52,858 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:57:52,858 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:57:52,859 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:57:52,859 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:57:52,860 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:57:52,860 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:57:52,861 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:57:52,861 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:57:52,861 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:57:52,861 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:57:52,862 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:57:52,871 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:57:52,871 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:57:52,872 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:57:52,872 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:57:52,872 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:57:52,873 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:57:52,873 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:57:52,873 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:57:52,873 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:57:52,873 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:57:52,873 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:57:52,873 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:57:52,874 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:57:52,874 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:57:52,874 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:57:52,874 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:57:52,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:57:52,874 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:57:52,875 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:57:52,875 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:57:52,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:57:52,875 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:57:52,875 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:57:52,875 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:57:52,875 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:57:52,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:57:52,916 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:57:52,919 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:57:52,921 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:57:52,921 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:57:52,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i [2018-02-04 00:57:53,086 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:57:53,088 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:57:53,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:57:53,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:57:53,094 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:57:53,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:57:53" (1/1) ... [2018-02-04 00:57:53,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290d95bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:57:53, skipping insertion in model container [2018-02-04 00:57:53,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:57:53" (1/1) ... [2018-02-04 00:57:53,111 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:57:53,147 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:57:53,244 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:57:53,268 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:57:53,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:57:53 WrapperNode [2018-02-04 00:57:53,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:57:53,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:57:53,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:57:53,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:57:53,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:57:53" (1/1) ... [2018-02-04 00:57:53,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:57:53" (1/1) ... [2018-02-04 00:57:53,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:57:53" (1/1) ... [2018-02-04 00:57:53,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:57:53" (1/1) ... [2018-02-04 00:57:53,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:57:53" (1/1) ... [2018-02-04 00:57:53,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:57:53" (1/1) ... [2018-02-04 00:57:53,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:57:53" (1/1) ... [2018-02-04 00:57:53,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:57:53,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:57:53,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:57:53,311 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:57:53,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:57:53" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:57:53,346 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:57:53,346 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:57:53,347 INFO L136 BoogieDeclarations]: Found implementation of procedure fail [2018-02-04 00:57:53,347 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect [2018-02-04 00:57:53,347 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-04 00:57:53,347 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-02-04 00:57:53,347 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-02-04 00:57:53,347 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-02-04 00:57:53,347 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-02-04 00:57:53,347 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-02-04 00:57:53,347 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-02-04 00:57:53,347 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-02-04 00:57:53,347 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2018-02-04 00:57:53,347 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-02-04 00:57:53,347 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:57:53,348 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 00:57:53,348 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 00:57:53,348 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:57:53,348 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:57:53,348 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:57:53,348 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:57:53,348 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:57:53,348 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 00:57:53,348 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:57:53,348 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 00:57:53,348 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:57:53,348 INFO L128 BoogieDeclarations]: Found specification of procedure fail [2018-02-04 00:57:53,349 INFO L128 BoogieDeclarations]: Found specification of procedure inspect [2018-02-04 00:57:53,349 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-04 00:57:53,349 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-02-04 00:57:53,349 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-02-04 00:57:53,349 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-02-04 00:57:53,349 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-02-04 00:57:53,349 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-02-04 00:57:53,349 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-02-04 00:57:53,349 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-02-04 00:57:53,349 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2018-02-04 00:57:53,350 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-02-04 00:57:53,350 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:57:53,350 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:57:53,350 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:57:53,873 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:57:53,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:57:53 BoogieIcfgContainer [2018-02-04 00:57:53,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:57:53,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:57:53,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:57:53,876 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:57:53,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:57:53" (1/3) ... [2018-02-04 00:57:53,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d972967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:57:53, skipping insertion in model container [2018-02-04 00:57:53,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:57:53" (2/3) ... [2018-02-04 00:57:53,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d972967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:57:53, skipping insertion in model container [2018-02-04 00:57:53,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:57:53" (3/3) ... [2018-02-04 00:57:53,879 INFO L107 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux_true-unreach-call_true-valid-memsafety.i [2018-02-04 00:57:53,885 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:57:53,889 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2018-02-04 00:57:53,920 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:57:53,920 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:57:53,920 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:57:53,920 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:57:53,920 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:57:53,920 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:57:53,921 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:57:53,921 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:57:53,921 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:57:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states. [2018-02-04 00:57:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 00:57:53,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:53,944 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 00:57:53,944 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:53,948 INFO L82 PathProgramCache]: Analyzing trace with hash 19743518, now seen corresponding path program 1 times [2018-02-04 00:57:53,949 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:53,950 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:53,994 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:53,994 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:53,994 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:54,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:54,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:57:54,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:57:54,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:57:54,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:57:54,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:57:54,174 INFO L87 Difference]: Start difference. First operand 268 states. Second operand 3 states. [2018-02-04 00:57:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:57:54,308 INFO L93 Difference]: Finished difference Result 263 states and 285 transitions. [2018-02-04 00:57:54,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:57:54,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 00:57:54,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:57:54,316 INFO L225 Difference]: With dead ends: 263 [2018-02-04 00:57:54,317 INFO L226 Difference]: Without dead ends: 244 [2018-02-04 00:57:54,318 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:57:54,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-04 00:57:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2018-02-04 00:57:54,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 00:57:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 252 transitions. [2018-02-04 00:57:54,361 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 252 transitions. Word has length 4 [2018-02-04 00:57:54,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:57:54,362 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 252 transitions. [2018-02-04 00:57:54,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:57:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 252 transitions. [2018-02-04 00:57:54,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 00:57:54,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:54,363 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 00:57:54,363 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:54,363 INFO L82 PathProgramCache]: Analyzing trace with hash 19743519, now seen corresponding path program 1 times [2018-02-04 00:57:54,363 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:54,363 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:54,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:54,364 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:54,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:54,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:54,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:57:54,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:57:54,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:57:54,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:57:54,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:57:54,408 INFO L87 Difference]: Start difference. First operand 243 states and 252 transitions. Second operand 3 states. [2018-02-04 00:57:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:57:54,543 INFO L93 Difference]: Finished difference Result 245 states and 255 transitions. [2018-02-04 00:57:54,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:57:54,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 00:57:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:57:54,546 INFO L225 Difference]: With dead ends: 245 [2018-02-04 00:57:54,546 INFO L226 Difference]: Without dead ends: 245 [2018-02-04 00:57:54,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:57:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-04 00:57:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2018-02-04 00:57:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-04 00:57:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 250 transitions. [2018-02-04 00:57:54,560 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 250 transitions. Word has length 4 [2018-02-04 00:57:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:57:54,561 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 250 transitions. [2018-02-04 00:57:54,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:57:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 250 transitions. [2018-02-04 00:57:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 00:57:54,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:54,562 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:57:54,562 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:54,562 INFO L82 PathProgramCache]: Analyzing trace with hash -935456334, now seen corresponding path program 1 times [2018-02-04 00:57:54,562 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:54,562 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:54,563 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:54,563 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:54,563 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:54,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:54,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:57:54,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:57:54,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:57:54,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:57:54,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:57:54,616 INFO L87 Difference]: Start difference. First operand 241 states and 250 transitions. Second operand 4 states. [2018-02-04 00:57:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:57:54,737 INFO L93 Difference]: Finished difference Result 238 states and 247 transitions. [2018-02-04 00:57:54,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:57:54,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 00:57:54,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:57:54,739 INFO L225 Difference]: With dead ends: 238 [2018-02-04 00:57:54,739 INFO L226 Difference]: Without dead ends: 238 [2018-02-04 00:57:54,739 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:57:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-04 00:57:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-02-04 00:57:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 00:57:54,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 247 transitions. [2018-02-04 00:57:54,744 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 247 transitions. Word has length 16 [2018-02-04 00:57:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:57:54,744 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 247 transitions. [2018-02-04 00:57:54,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:57:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 247 transitions. [2018-02-04 00:57:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 00:57:54,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:54,745 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:57:54,745 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:54,745 INFO L82 PathProgramCache]: Analyzing trace with hash -935456333, now seen corresponding path program 1 times [2018-02-04 00:57:54,745 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:54,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:54,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:54,746 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:54,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:54,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:54,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:57:54,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:57:54,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:57:54,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:57:54,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:57:54,806 INFO L87 Difference]: Start difference. First operand 238 states and 247 transitions. Second operand 4 states. [2018-02-04 00:57:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:57:54,907 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2018-02-04 00:57:54,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:57:54,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 00:57:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:57:54,908 INFO L225 Difference]: With dead ends: 235 [2018-02-04 00:57:54,908 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 00:57:54,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:57:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 00:57:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-02-04 00:57:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-04 00:57:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 244 transitions. [2018-02-04 00:57:54,918 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 244 transitions. Word has length 16 [2018-02-04 00:57:54,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:57:54,918 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 244 transitions. [2018-02-04 00:57:54,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:57:54,922 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2018-02-04 00:57:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:57:54,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:54,922 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:57:54,923 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:54,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1863730920, now seen corresponding path program 1 times [2018-02-04 00:57:54,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:54,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:54,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:54,924 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:54,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:54,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:55,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:57:55,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:57:55,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:57:55,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:57:55,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:57:55,005 INFO L87 Difference]: Start difference. First operand 235 states and 244 transitions. Second operand 7 states. [2018-02-04 00:57:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:57:55,250 INFO L93 Difference]: Finished difference Result 243 states and 251 transitions. [2018-02-04 00:57:55,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:57:55,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 00:57:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:57:55,252 INFO L225 Difference]: With dead ends: 243 [2018-02-04 00:57:55,252 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 00:57:55,252 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:57:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 00:57:55,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-02-04 00:57:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-04 00:57:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 251 transitions. [2018-02-04 00:57:55,259 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 251 transitions. Word has length 19 [2018-02-04 00:57:55,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:57:55,259 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 251 transitions. [2018-02-04 00:57:55,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:57:55,259 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 251 transitions. [2018-02-04 00:57:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:57:55,260 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:55,260 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:57:55,260 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1863730921, now seen corresponding path program 1 times [2018-02-04 00:57:55,261 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:55,261 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:55,262 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:55,262 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:55,262 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:55,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:55,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:57:55,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 00:57:55,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:57:55,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:57:55,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:57:55,376 INFO L87 Difference]: Start difference. First operand 241 states and 251 transitions. Second operand 9 states. [2018-02-04 00:57:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:57:55,698 INFO L93 Difference]: Finished difference Result 238 states and 246 transitions. [2018-02-04 00:57:55,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:57:55,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 00:57:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:57:55,699 INFO L225 Difference]: With dead ends: 238 [2018-02-04 00:57:55,699 INFO L226 Difference]: Without dead ends: 238 [2018-02-04 00:57:55,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:57:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-04 00:57:55,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-02-04 00:57:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 00:57:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 246 transitions. [2018-02-04 00:57:55,706 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 246 transitions. Word has length 19 [2018-02-04 00:57:55,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:57:55,707 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 246 transitions. [2018-02-04 00:57:55,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:57:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 246 transitions. [2018-02-04 00:57:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 00:57:55,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:55,707 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:57:55,707 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:55,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1366173164, now seen corresponding path program 1 times [2018-02-04 00:57:55,707 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:55,707 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:55,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:55,708 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:55,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:55,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:55,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:57:55,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 00:57:55,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 00:57:55,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 00:57:55,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:57:55,804 INFO L87 Difference]: Start difference. First operand 238 states and 246 transitions. Second operand 10 states. [2018-02-04 00:57:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:57:56,141 INFO L93 Difference]: Finished difference Result 264 states and 274 transitions. [2018-02-04 00:57:56,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:57:56,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 00:57:56,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:57:56,143 INFO L225 Difference]: With dead ends: 264 [2018-02-04 00:57:56,143 INFO L226 Difference]: Without dead ends: 264 [2018-02-04 00:57:56,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-02-04 00:57:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-04 00:57:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 256. [2018-02-04 00:57:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 00:57:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 273 transitions. [2018-02-04 00:57:56,149 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 273 transitions. Word has length 22 [2018-02-04 00:57:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:57:56,150 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 273 transitions. [2018-02-04 00:57:56,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 00:57:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 273 transitions. [2018-02-04 00:57:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 00:57:56,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:56,151 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:57:56,151 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:56,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1366173165, now seen corresponding path program 1 times [2018-02-04 00:57:56,151 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:56,152 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:56,152 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:56,153 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:56,153 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:56,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:56,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:57:56,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 00:57:56,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:57:56,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:57:56,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:57:56,336 INFO L87 Difference]: Start difference. First operand 256 states and 273 transitions. Second operand 11 states. [2018-02-04 00:57:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:57:56,964 INFO L93 Difference]: Finished difference Result 484 states and 500 transitions. [2018-02-04 00:57:56,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:57:56,964 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-04 00:57:56,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:57:56,965 INFO L225 Difference]: With dead ends: 484 [2018-02-04 00:57:56,965 INFO L226 Difference]: Without dead ends: 484 [2018-02-04 00:57:56,966 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:57:56,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-02-04 00:57:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 400. [2018-02-04 00:57:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-02-04 00:57:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 473 transitions. [2018-02-04 00:57:56,972 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 473 transitions. Word has length 22 [2018-02-04 00:57:56,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:57:56,972 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 473 transitions. [2018-02-04 00:57:56,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:57:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 473 transitions. [2018-02-04 00:57:56,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:57:56,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:56,973 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:57:56,973 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:56,973 INFO L82 PathProgramCache]: Analyzing trace with hash -598304902, now seen corresponding path program 1 times [2018-02-04 00:57:56,973 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:56,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:56,974 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:56,974 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:56,974 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:56,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:57,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:57:57,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:57:57,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:57:57,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:57:57,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:57:57,067 INFO L87 Difference]: Start difference. First operand 400 states and 473 transitions. Second operand 7 states. [2018-02-04 00:57:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:57:57,292 INFO L93 Difference]: Finished difference Result 412 states and 481 transitions. [2018-02-04 00:57:57,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:57:57,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 00:57:57,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:57:57,294 INFO L225 Difference]: With dead ends: 412 [2018-02-04 00:57:57,294 INFO L226 Difference]: Without dead ends: 412 [2018-02-04 00:57:57,294 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-04 00:57:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-04 00:57:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 271. [2018-02-04 00:57:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-04 00:57:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 288 transitions. [2018-02-04 00:57:57,301 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 288 transitions. Word has length 23 [2018-02-04 00:57:57,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:57:57,301 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 288 transitions. [2018-02-04 00:57:57,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:57:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 288 transitions. [2018-02-04 00:57:57,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:57:57,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:57,302 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:57:57,302 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:57,302 INFO L82 PathProgramCache]: Analyzing trace with hash -598304901, now seen corresponding path program 1 times [2018-02-04 00:57:57,303 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:57,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:57,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:57,303 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:57,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:57,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:57,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:57:57,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:57:57,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:57:57,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:57:57,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:57:57,397 INFO L87 Difference]: Start difference. First operand 271 states and 288 transitions. Second operand 8 states. [2018-02-04 00:57:57,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:57:57,583 INFO L93 Difference]: Finished difference Result 275 states and 284 transitions. [2018-02-04 00:57:57,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:57:57,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-04 00:57:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:57:57,593 INFO L225 Difference]: With dead ends: 275 [2018-02-04 00:57:57,593 INFO L226 Difference]: Without dead ends: 275 [2018-02-04 00:57:57,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:57:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-04 00:57:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2018-02-04 00:57:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-04 00:57:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 284 transitions. [2018-02-04 00:57:57,599 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 284 transitions. Word has length 23 [2018-02-04 00:57:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:57:57,599 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 284 transitions. [2018-02-04 00:57:57,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:57:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 284 transitions. [2018-02-04 00:57:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 00:57:57,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:57,600 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:57:57,600 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:57,600 INFO L82 PathProgramCache]: Analyzing trace with hash 554606109, now seen corresponding path program 1 times [2018-02-04 00:57:57,601 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:57,601 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:57,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:57,601 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:57,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:57,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:57,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:57:57,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:57:57,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:57:57,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:57:57,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:57:57,636 INFO L87 Difference]: Start difference. First operand 271 states and 284 transitions. Second operand 5 states. [2018-02-04 00:57:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:57:57,749 INFO L93 Difference]: Finished difference Result 270 states and 281 transitions. [2018-02-04 00:57:57,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:57:57,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-04 00:57:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:57:57,750 INFO L225 Difference]: With dead ends: 270 [2018-02-04 00:57:57,750 INFO L226 Difference]: Without dead ends: 270 [2018-02-04 00:57:57,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:57:57,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-04 00:57:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-02-04 00:57:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-04 00:57:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 281 transitions. [2018-02-04 00:57:57,756 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 281 transitions. Word has length 25 [2018-02-04 00:57:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:57:57,756 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 281 transitions. [2018-02-04 00:57:57,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:57:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 281 transitions. [2018-02-04 00:57:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 00:57:57,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:57,757 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:57:57,757 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:57,757 INFO L82 PathProgramCache]: Analyzing trace with hash 554606110, now seen corresponding path program 1 times [2018-02-04 00:57:57,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:57,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:57,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:57,758 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:57,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:57,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:57,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:57:57,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:57:57,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:57:57,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:57:57,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:57:57,827 INFO L87 Difference]: Start difference. First operand 270 states and 281 transitions. Second operand 8 states. [2018-02-04 00:57:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:57:57,982 INFO L93 Difference]: Finished difference Result 272 states and 279 transitions. [2018-02-04 00:57:57,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:57:57,982 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-04 00:57:57,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:57:57,983 INFO L225 Difference]: With dead ends: 272 [2018-02-04 00:57:57,983 INFO L226 Difference]: Without dead ends: 272 [2018-02-04 00:57:57,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:57:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-04 00:57:57,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-02-04 00:57:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-04 00:57:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 279 transitions. [2018-02-04 00:57:57,989 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 279 transitions. Word has length 25 [2018-02-04 00:57:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:57:57,990 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 279 transitions. [2018-02-04 00:57:57,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:57:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 279 transitions. [2018-02-04 00:57:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 00:57:57,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:57,991 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:57:57,991 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1199658537, now seen corresponding path program 1 times [2018-02-04 00:57:57,992 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:57,992 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:57,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:57,992 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:57,993 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:58,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:58,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:57:58,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 00:57:58,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:57:58,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:57:58,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:57:58,108 INFO L87 Difference]: Start difference. First operand 270 states and 279 transitions. Second operand 11 states. [2018-02-04 00:57:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:57:58,528 INFO L93 Difference]: Finished difference Result 269 states and 278 transitions. [2018-02-04 00:57:58,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:57:58,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-04 00:57:58,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:57:58,530 INFO L225 Difference]: With dead ends: 269 [2018-02-04 00:57:58,530 INFO L226 Difference]: Without dead ends: 269 [2018-02-04 00:57:58,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-02-04 00:57:58,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-04 00:57:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-02-04 00:57:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-04 00:57:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 278 transitions. [2018-02-04 00:57:58,535 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 278 transitions. Word has length 48 [2018-02-04 00:57:58,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:57:58,536 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 278 transitions. [2018-02-04 00:57:58,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:57:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 278 transitions. [2018-02-04 00:57:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 00:57:58,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:58,537 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:57:58,537 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:58,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1199658536, now seen corresponding path program 1 times [2018-02-04 00:57:58,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:58,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:58,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:58,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:58,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:58,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:58,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:57:58,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:57:58,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:57:58,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:57:58,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:57:58,591 INFO L87 Difference]: Start difference. First operand 269 states and 278 transitions. Second operand 7 states. [2018-02-04 00:57:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:57:58,891 INFO L93 Difference]: Finished difference Result 264 states and 273 transitions. [2018-02-04 00:57:58,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:57:58,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-02-04 00:57:58,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:57:58,892 INFO L225 Difference]: With dead ends: 264 [2018-02-04 00:57:58,892 INFO L226 Difference]: Without dead ends: 264 [2018-02-04 00:57:58,892 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:57:58,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-04 00:57:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-02-04 00:57:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 00:57:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 273 transitions. [2018-02-04 00:57:58,896 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 273 transitions. Word has length 48 [2018-02-04 00:57:58,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:57:58,896 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 273 transitions. [2018-02-04 00:57:58,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:57:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 273 transitions. [2018-02-04 00:57:58,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 00:57:58,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:57:58,897 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, 1, 1, 1, 1] [2018-02-04 00:57:58,898 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:57:58,898 INFO L82 PathProgramCache]: Analyzing trace with hash 652522709, now seen corresponding path program 1 times [2018-02-04 00:57:58,898 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:57:58,898 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:57:58,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:58,899 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:58,899 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:57:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:58,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:57:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:57:59,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:57:59,259 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:57:59,265 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:57:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:57:59,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:57:59,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:57:59,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:57:59,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:57:59,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 00:57:59,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 00:57:59,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:57:59,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:57:59,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 00:57:59,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 00:57:59,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:57:59,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:57:59,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-02-04 00:57:59,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:57:59,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:57:59,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:57:59,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:57:59,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:57:59,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-02-04 00:57:59,709 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 21 treesize of output 33 [2018-02-04 00:57:59,713 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 22 treesize of output 21 [2018-02-04 00:57:59,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:57:59,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:57:59,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:57:59,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-04 00:57:59,772 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 58 [2018-02-04 00:57:59,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:57:59,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 69 [2018-02-04 00:57:59,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:57:59,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:57:59,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:57:59,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-02-04 00:57:59,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:57:59,865 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:57:59,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 00:57:59,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:57:59,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:57:59,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:60 [2018-02-04 00:57:59,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:57:59,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:57:59,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:57:59,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 50 [2018-02-04 00:57:59,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:57:59,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:57:59,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:77 [2018-02-04 00:58:00,053 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 75 treesize of output 75 [2018-02-04 00:58:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 00:58:00,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:00,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:00,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:00,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:77 [2018-02-04 00:58:00,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2018-02-04 00:58:00,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:00,231 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 19 treesize of output 8 [2018-02-04 00:58:00,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:00,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-02-04 00:58:00,237 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:00,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:00,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:00,243 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:81, output treesize:28 [2018-02-04 00:58:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:58:00,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:58:00,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 45 [2018-02-04 00:58:00,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 00:58:00,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 00:58:00,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1884, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 00:58:00,385 INFO L87 Difference]: Start difference. First operand 264 states and 273 transitions. Second operand 46 states. [2018-02-04 00:58:05,778 WARN L146 SmtUtils]: Spent 4054ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-02-04 00:58:09,867 WARN L146 SmtUtils]: Spent 4048ms on a formula simplification. DAG size of input: 92 DAG size of output 66 [2018-02-04 00:58:10,545 WARN L146 SmtUtils]: Spent 631ms on a formula simplification. DAG size of input: 101 DAG size of output 73 [2018-02-04 00:58:14,608 WARN L146 SmtUtils]: Spent 4029ms on a formula simplification. DAG size of input: 53 DAG size of output 42 [2018-02-04 00:58:15,172 WARN L146 SmtUtils]: Spent 529ms on a formula simplification. DAG size of input: 75 DAG size of output 59 [2018-02-04 00:58:15,695 WARN L146 SmtUtils]: Spent 455ms on a formula simplification. DAG size of input: 50 DAG size of output 40 [2018-02-04 00:58:16,248 WARN L146 SmtUtils]: Spent 455ms on a formula simplification. DAG size of input: 54 DAG size of output 44 [2018-02-04 00:58:16,752 WARN L146 SmtUtils]: Spent 445ms on a formula simplification. DAG size of input: 42 DAG size of output 42 [2018-02-04 00:58:19,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:58:19,002 INFO L93 Difference]: Finished difference Result 443 states and 465 transitions. [2018-02-04 00:58:19,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 00:58:19,002 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 52 [2018-02-04 00:58:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:58:19,004 INFO L225 Difference]: With dead ends: 443 [2018-02-04 00:58:19,004 INFO L226 Difference]: Without dead ends: 443 [2018-02-04 00:58:19,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=810, Invalid=5510, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 00:58:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-04 00:58:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 365. [2018-02-04 00:58:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-04 00:58:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 407 transitions. [2018-02-04 00:58:19,015 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 407 transitions. Word has length 52 [2018-02-04 00:58:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:58:19,016 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 407 transitions. [2018-02-04 00:58:19,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 00:58:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 407 transitions. [2018-02-04 00:58:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 00:58:19,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:58:19,017 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, 1, 1, 1, 1] [2018-02-04 00:58:19,017 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:58:19,017 INFO L82 PathProgramCache]: Analyzing trace with hash 652522710, now seen corresponding path program 1 times [2018-02-04 00:58:19,017 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:58:19,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:58:19,018 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:58:19,018 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:58:19,018 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:58:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:58:19,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:58:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:58:19,491 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:58:19,491 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:58:19,501 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:58:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:58:19,548 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:58:19,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:58:19,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:19,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:19,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 00:58:19,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 00:58:19,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:19,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:19,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 00:58:19,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:58:19,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:19,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:19,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 00:58:19,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 00:58:19,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:19,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:19,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-02-04 00:58:19,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:58:19,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:58:19,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:19,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:19,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:58:19,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:58:19,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:19,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:19,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:19,812 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-02-04 00:58:19,959 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 25 treesize of output 49 [2018-02-04 00:58:19,961 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 34 treesize of output 33 [2018-02-04 00:58:19,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:19,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:19,998 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 36 treesize of output 46 [2018-02-04 00:58:20,000 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 37 treesize of output 36 [2018-02-04 00:58:20,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-02-04 00:58:20,076 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 127 [2018-02-04 00:58:20,080 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:20,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:20,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:20,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 150 [2018-02-04 00:58:20,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:20,097 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:20,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:20,132 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 125 treesize of output 146 [2018-02-04 00:58:20,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,172 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 119 treesize of output 115 [2018-02-04 00:58:20,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:20,176 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 114 treesize of output 135 [2018-02-04 00:58:20,176 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,213 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,225 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:153, output treesize:137 [2018-02-04 00:58:20,277 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:20,278 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:20,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 00:58:20,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:142, output treesize:136 [2018-02-04 00:58:20,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-02-04 00:58:20,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:20,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:20,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 00:58:20,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:147, output treesize:132 [2018-02-04 00:58:20,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 134 [2018-02-04 00:58:20,490 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 130 treesize of output 118 [2018-02-04 00:58:20,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:20,533 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 4 case distinctions, treesize of input 96 treesize of output 124 [2018-02-04 00:58:20,534 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 00:58:20,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:58:20,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 153 [2018-02-04 00:58:20,617 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 144 treesize of output 132 [2018-02-04 00:58:20,617 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:20,667 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 4 case distinctions, treesize of input 110 treesize of output 138 [2018-02-04 00:58:20,667 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-04 00:58:20,704 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:58:20,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 106 [2018-02-04 00:58:20,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:20,714 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 0 case distinctions, treesize of input 51 treesize of output 80 [2018-02-04 00:58:20,714 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,725 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 106 [2018-02-04 00:58:20,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:20,735 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 0 case distinctions, treesize of input 51 treesize of output 80 [2018-02-04 00:58:20,735 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,744 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:20,782 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 3 xjuncts. [2018-02-04 00:58:20,783 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:162, output treesize:291 [2018-02-04 00:58:20,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 72 [2018-02-04 00:58:20,994 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 48 treesize of output 33 [2018-02-04 00:58:20,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:21,005 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 9 treesize of output 1 [2018-02-04 00:58:21,005 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:21,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:21,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2018-02-04 00:58:21,028 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 53 treesize of output 64 [2018-02-04 00:58:21,029 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:21,037 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 64 treesize of output 29 [2018-02-04 00:58:21,037 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:21,042 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:21,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-02-04 00:58:21,058 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 1 [2018-02-04 00:58:21,058 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:21,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-02-04 00:58:21,062 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:21,065 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:21,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2018-02-04 00:58:21,076 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 9 treesize of output 1 [2018-02-04 00:58:21,076 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:21,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 00:58:21,080 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:21,083 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:21,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:58:21,091 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:181, output treesize:25 [2018-02-04 00:58:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:58:21,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:58:21,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 46 [2018-02-04 00:58:21,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 00:58:21,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 00:58:21,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2009, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 00:58:21,199 INFO L87 Difference]: Start difference. First operand 365 states and 407 transitions. Second operand 47 states. [2018-02-04 00:58:22,622 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 114 DAG size of output 78 [2018-02-04 00:58:22,792 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 121 DAG size of output 87 [2018-02-04 00:58:25,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:58:25,989 INFO L93 Difference]: Finished difference Result 442 states and 464 transitions. [2018-02-04 00:58:25,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 00:58:25,989 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 52 [2018-02-04 00:58:25,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:58:25,991 INFO L225 Difference]: With dead ends: 442 [2018-02-04 00:58:25,991 INFO L226 Difference]: Without dead ends: 442 [2018-02-04 00:58:25,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=726, Invalid=5126, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 00:58:25,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-04 00:58:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 338. [2018-02-04 00:58:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-04 00:58:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 379 transitions. [2018-02-04 00:58:25,999 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 379 transitions. Word has length 52 [2018-02-04 00:58:25,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:58:26,000 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 379 transitions. [2018-02-04 00:58:26,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 00:58:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 379 transitions. [2018-02-04 00:58:26,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 00:58:26,000 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:58:26,001 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] [2018-02-04 00:58:26,001 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:58:26,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1566668974, now seen corresponding path program 1 times [2018-02-04 00:58:26,001 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:58:26,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:58:26,002 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:58:26,002 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:58:26,002 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:58:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:58:26,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:58:26,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-04 00:58:26,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:58:26,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 00:58:26,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 00:58:26,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 00:58:26,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:58:26,194 INFO L87 Difference]: Start difference. First operand 338 states and 379 transitions. Second operand 14 states. [2018-02-04 00:58:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:58:26,895 INFO L93 Difference]: Finished difference Result 350 states and 391 transitions. [2018-02-04 00:58:26,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:58:26,896 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-02-04 00:58:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:58:26,897 INFO L225 Difference]: With dead ends: 350 [2018-02-04 00:58:26,897 INFO L226 Difference]: Without dead ends: 350 [2018-02-04 00:58:26,897 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:58:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-04 00:58:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 336. [2018-02-04 00:58:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-02-04 00:58:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 375 transitions. [2018-02-04 00:58:26,903 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 375 transitions. Word has length 52 [2018-02-04 00:58:26,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:58:26,903 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 375 transitions. [2018-02-04 00:58:26,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 00:58:26,904 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 375 transitions. [2018-02-04 00:58:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 00:58:26,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:58:26,904 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, 1, 1, 1] [2018-02-04 00:58:26,904 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:58:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1071557105, now seen corresponding path program 1 times [2018-02-04 00:58:26,905 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:58:26,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:58:26,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:58:26,906 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:58:26,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:58:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:58:26,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:58:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:58:27,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:58:27,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-04 00:58:27,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 00:58:27,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 00:58:27,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2018-02-04 00:58:27,544 INFO L87 Difference]: Start difference. First operand 336 states and 375 transitions. Second operand 25 states. [2018-02-04 00:58:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:58:29,906 INFO L93 Difference]: Finished difference Result 539 states and 599 transitions. [2018-02-04 00:58:29,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 00:58:29,906 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61 [2018-02-04 00:58:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:58:29,908 INFO L225 Difference]: With dead ends: 539 [2018-02-04 00:58:29,908 INFO L226 Difference]: Without dead ends: 539 [2018-02-04 00:58:29,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=301, Invalid=2149, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 00:58:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-02-04 00:58:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 458. [2018-02-04 00:58:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-02-04 00:58:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 538 transitions. [2018-02-04 00:58:29,917 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 538 transitions. Word has length 61 [2018-02-04 00:58:29,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:58:29,917 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 538 transitions. [2018-02-04 00:58:29,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 00:58:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 538 transitions. [2018-02-04 00:58:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 00:58:29,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:58:29,918 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, 1, 1, 1] [2018-02-04 00:58:29,918 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:58:29,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1071557104, now seen corresponding path program 1 times [2018-02-04 00:58:29,918 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:58:29,919 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:58:29,919 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:58:29,919 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:58:29,919 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:58:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:58:29,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:58:30,488 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 69 DAG size of output 59 [2018-02-04 00:58:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:58:31,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:58:31,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-04 00:58:31,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 00:58:31,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 00:58:31,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-04 00:58:31,024 INFO L87 Difference]: Start difference. First operand 458 states and 538 transitions. Second operand 24 states. [2018-02-04 00:58:33,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:58:33,962 INFO L93 Difference]: Finished difference Result 552 states and 613 transitions. [2018-02-04 00:58:33,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 00:58:33,963 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-02-04 00:58:33,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:58:33,965 INFO L225 Difference]: With dead ends: 552 [2018-02-04 00:58:33,965 INFO L226 Difference]: Without dead ends: 552 [2018-02-04 00:58:33,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=296, Invalid=2056, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 00:58:33,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-02-04 00:58:33,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 458. [2018-02-04 00:58:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-02-04 00:58:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 535 transitions. [2018-02-04 00:58:33,973 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 535 transitions. Word has length 61 [2018-02-04 00:58:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:58:33,974 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 535 transitions. [2018-02-04 00:58:33,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 00:58:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 535 transitions. [2018-02-04 00:58:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 00:58:33,975 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:58:33,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:58:33,975 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:58:33,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1456137695, now seen corresponding path program 1 times [2018-02-04 00:58:33,975 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:58:33,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:58:33,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:58:33,976 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:58:33,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:58:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:58:33,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:58:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:58:34,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:58:34,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:58:34,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:58:34,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:58:34,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:58:34,030 INFO L87 Difference]: Start difference. First operand 458 states and 535 transitions. Second operand 4 states. [2018-02-04 00:58:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:58:34,125 INFO L93 Difference]: Finished difference Result 452 states and 517 transitions. [2018-02-04 00:58:34,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:58:34,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 00:58:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:58:34,127 INFO L225 Difference]: With dead ends: 452 [2018-02-04 00:58:34,127 INFO L226 Difference]: Without dead ends: 452 [2018-02-04 00:58:34,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:58:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-02-04 00:58:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2018-02-04 00:58:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-04 00:58:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 517 transitions. [2018-02-04 00:58:34,134 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 517 transitions. Word has length 73 [2018-02-04 00:58:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:58:34,134 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 517 transitions. [2018-02-04 00:58:34,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:58:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 517 transitions. [2018-02-04 00:58:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 00:58:34,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:58:34,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:58:34,135 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:58:34,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1456137694, now seen corresponding path program 1 times [2018-02-04 00:58:34,136 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:58:34,136 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:58:34,136 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:58:34,136 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:58:34,136 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:58:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:58:34,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:58:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:58:35,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:58:35,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-02-04 00:58:35,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 00:58:35,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 00:58:35,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2018-02-04 00:58:35,099 INFO L87 Difference]: Start difference. First operand 452 states and 517 transitions. Second operand 26 states. [2018-02-04 00:58:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:58:37,880 INFO L93 Difference]: Finished difference Result 534 states and 589 transitions. [2018-02-04 00:58:37,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 00:58:37,880 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2018-02-04 00:58:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:58:37,881 INFO L225 Difference]: With dead ends: 534 [2018-02-04 00:58:37,881 INFO L226 Difference]: Without dead ends: 534 [2018-02-04 00:58:37,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 00:58:37,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-02-04 00:58:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 452. [2018-02-04 00:58:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-04 00:58:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 511 transitions. [2018-02-04 00:58:37,888 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 511 transitions. Word has length 73 [2018-02-04 00:58:37,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:58:37,888 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 511 transitions. [2018-02-04 00:58:37,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 00:58:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 511 transitions. [2018-02-04 00:58:37,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 00:58:37,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:58:37,889 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:58:37,889 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 00:58:37,889 INFO L82 PathProgramCache]: Analyzing trace with hash 935805702, now seen corresponding path program 1 times [2018-02-04 00:58:37,889 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:58:37,889 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:58:37,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:58:37,890 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:58:37,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:58:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:58:37,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:58:38,437 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 54 DAG size of output 47 [2018-02-04 00:58:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:58:39,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:58:39,276 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:58:39,281 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:58:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:58:39,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:58:39,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:58:39,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:39,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:39,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 00:58:39,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:58:39,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:58:39,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:39,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:39,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:39,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 00:58:39,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 00:58:39,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:39,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 00:58:39,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:39,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:39,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:39,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 00:58:39,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 00:58:39,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:39,416 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-04 00:58:39,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:39,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 00:58:39,417 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:39,418 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:39,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:39,420 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:10 [2018-02-04 00:58:40,059 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:40,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:40,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:40,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:146, output treesize:275 [2018-02-04 00:58:40,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 00:58:40,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:40,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:40,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-02-04 00:58:41,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:58:41,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:58:41,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:41,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:41,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:41,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:93 [2018-02-04 00:58:41,313 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:41,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:41,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:41,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:186, output treesize:323 [2018-02-04 00:58:41,586 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 586 treesize of output 582 [2018-02-04 00:58:41,590 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 587 treesize of output 586 [2018-02-04 00:58:41,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:41,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:41,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:41,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:622, output treesize:618 [2018-02-04 00:58:42,184 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 870 treesize of output 776 [2018-02-04 00:58:42,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:42,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:42,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:42,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:42,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 762 treesize of output 923 [2018-02-04 00:58:42,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:42,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:42,527 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 865 treesize of output 882 [2018-02-04 00:58:42,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:42,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:58:42,707 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-04 00:58:42,708 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:883, output treesize:879 [2018-02-04 00:58:43,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:43,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:43,096 INFO L303 Elim1Store]: Index analysis took 118 ms [2018-02-04 00:58:43,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 00:58:43,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:44,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-02-04 00:58:44,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:40183, output treesize:40177 [2018-02-04 00:58:46,627 WARN L143 SmtUtils]: Spent 450ms on a formula simplification that was a NOOP. DAG size: 91 [2018-02-04 00:58:51,678 WARN L146 SmtUtils]: Spent 5040ms on a formula simplification. DAG size of input: 141 DAG size of output 95 [2018-02-04 00:58:51,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:51,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:51,792 INFO L303 Elim1Store]: Index analysis took 112 ms [2018-02-04 00:58:51,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 00:58:51,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:53,238 INFO L303 Elim1Store]: Index analysis took 258 ms [2018-02-04 00:58:53,239 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28284 treesize of output 18824 [2018-02-04 00:58:53,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:58:53,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:53,993 INFO L303 Elim1Store]: Index analysis took 389 ms [2018-02-04 00:58:53,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18819 treesize of output 7583 [2018-02-04 00:58:55,654 WARN L146 SmtUtils]: Spent 1658ms on a formula simplification. DAG size of input: 113 DAG size of output 77 [2018-02-04 00:58:55,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:55,789 INFO L303 Elim1Store]: Index analysis took 134 ms [2018-02-04 00:58:56,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 5356 treesize of output 5081 [2018-02-04 00:58:56,263 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-02-04 00:58:57,787 INFO L303 Elim1Store]: Index analysis took 141 ms [2018-02-04 00:58:57,788 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 5064 treesize of output 3155 [2018-02-04 00:58:57,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-02-04 00:58:57,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:57,911 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 19 treesize of output 26 [2018-02-04 00:58:57,911 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:58:58,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:58,259 INFO L303 Elim1Store]: Index analysis took 130 ms [2018-02-04 00:58:58,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 36 [2018-02-04 00:58:58,264 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 00:58:58,601 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:58:59,087 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:58:59,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3154 treesize of output 1982 [2018-02-04 00:59:02,344 WARN L146 SmtUtils]: Spent 3226ms on a formula simplification. DAG size of input: 106 DAG size of output 99 [2018-02-04 00:59:02,376 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:02,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 46 [2018-02-04 00:59:02,377 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 00:59:03,451 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-02-04 00:59:03,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1773 treesize of output 1159 [2018-02-04 00:59:04,175 WARN L146 SmtUtils]: Spent 722ms on a formula simplification. DAG size of input: 131 DAG size of output 69 [2018-02-04 00:59:04,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:04,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:04,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:04,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 594 treesize of output 536 [2018-02-04 00:59:04,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:04,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:04,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:04,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:04,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 516 treesize of output 515 [2018-02-04 00:59:04,225 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 00:59:04,306 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:59:04,495 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 507 treesize of output 389 [2018-02-04 00:59:05,003 WARN L143 SmtUtils]: Spent 506ms on a formula simplification that was a NOOP. DAG size: 84 [2018-02-04 00:59:05,005 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 00:59:05,005 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 00:59:05,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:05,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:05,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:05,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:05,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:05,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:05,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:05,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 322 treesize of output 365 [2018-02-04 00:59:05,205 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 16 xjuncts. [2018-02-04 00:59:05,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:05,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:05,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 272 [2018-02-04 00:59:05,959 WARN L146 SmtUtils]: Spent 311ms on a formula simplification. DAG size of input: 82 DAG size of output 68 [2018-02-04 00:59:05,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:05,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:05,991 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:06,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:06,081 INFO L303 Elim1Store]: Index analysis took 120 ms [2018-02-04 00:59:06,254 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 156 treesize of output 302 [2018-02-04 00:59:06,254 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-02-04 00:59:06,286 INFO L267 ElimStorePlain]: Start of recursive call 20: 64 dim-0 vars, End of recursive call: 64 dim-0 vars, and 112 xjuncts. [2018-02-04 00:59:56,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:56,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:56,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 185 [2018-02-04 00:59:56,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:56,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:56,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:56,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:56,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:56,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:56,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:56,915 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:59:56,957 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 169 [2018-02-04 00:59:56,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:56,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:56,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:56,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:56,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:56,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,006 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,028 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:59:57,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 244 [2018-02-04 00:59:57,048 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-02-04 00:59:57,215 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 00:59:57,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,268 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,269 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:59:57,269 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 154 [2018-02-04 00:59:57,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,301 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 101 [2018-02-04 00:59:57,302 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:59:57,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 152 [2018-02-04 00:59:57,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,358 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,398 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 113 treesize of output 334 [2018-02-04 00:59:57,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 16 case distinctions, treesize of input 307 treesize of output 425 [2018-02-04 00:59:57,497 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 4 xjuncts. [2018-02-04 00:59:57,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:57,981 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 101 treesize of output 403 [2018-02-04 00:59:58,004 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-02-04 00:59:58,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 25 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 16 case distinctions, treesize of input 99 treesize of output 418 [2018-02-04 00:59:58,304 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 4 xjuncts. [2018-02-04 00:59:58,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,548 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 373 [2018-02-04 00:59:58,558 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-04 00:59:58,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:58,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 23 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 389 [2018-02-04 00:59:58,830 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-02-04 00:59:58,985 INFO L267 ElimStorePlain]: Start of recursive call 27: 4 dim-0 vars, 7 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:59:59,024 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:59:59,079 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 00:59:59,108 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:59:59,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 198 [2018-02-04 00:59:59,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,188 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:59:59,225 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-02-04 00:59:59,239 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 93 treesize of output 202 [2018-02-04 00:59:59,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,282 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,291 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,329 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:59:59,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 323 [2018-02-04 00:59:59,352 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 4 xjuncts. [2018-02-04 00:59:59,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,729 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,743 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:59:59,763 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:59:59,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 277 [2018-02-04 00:59:59,769 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-02-04 01:00:00,066 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 01:00:00,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,152 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 01:00:00,153 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 161 [2018-02-04 01:00:00,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,205 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 122 [2018-02-04 01:00:00,206 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 01:00:00,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 166 [2018-02-04 01:00:00,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,277 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,278 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,278 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,282 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,282 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,340 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 19 case distinctions, treesize of input 129 treesize of output 390 [2018-02-04 01:00:00,341 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 01:00:00,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,415 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:00,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 38 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 351 treesize of output 487 [2018-02-04 01:00:00,460 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 4 xjuncts. [2018-02-04 01:00:06,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:06,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 35 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 514 [2018-02-04 01:00:06,277 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 8 xjuncts. [2018-02-04 01:00:09,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,922 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:09,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 26 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 109 treesize of output 413 [2018-02-04 01:00:09,962 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-02-04 01:00:12,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,379 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:12,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 127 treesize of output 518 [2018-02-04 01:00:12,410 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 8 xjuncts. [2018-02-04 01:00:19,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:19,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 32 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 125 treesize of output 482 [2018-02-04 01:00:19,884 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 4 xjuncts. [2018-02-04 01:00:25,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:25,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 34 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 13 case distinctions, treesize of input 124 treesize of output 498 [2018-02-04 01:00:25,192 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 8 xjuncts. [2018-02-04 01:00:28,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:28,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 432 [2018-02-04 01:00:28,134 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-02-04 01:00:33,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:33,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 432 [2018-02-04 01:00:33,352 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-02-04 01:00:38,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:38,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 439 [2018-02-04 01:00:38,717 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-02-04 01:00:41,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,007 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,017 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,017 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:41,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 32 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 18 case distinctions, treesize of input 123 treesize of output 478 [2018-02-04 01:00:41,082 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 8 xjuncts. [2018-02-04 01:00:43,218 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,222 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:43,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 26 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 118 treesize of output 422 [2018-02-04 01:00:43,262 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-02-04 01:00:45,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:45,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 383 [2018-02-04 01:00:45,497 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-02-04 01:00:47,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:47,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 127 treesize of output 518 [2018-02-04 01:00:47,195 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 8 xjuncts. [2018-02-04 01:00:52,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:52,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 11 case distinctions, treesize of input 117 treesize of output 463 [2018-02-04 01:00:52,382 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 8 xjuncts. [2018-02-04 01:00:54,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:54,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 11 case distinctions, treesize of input 115 treesize of output 463 [2018-02-04 01:00:54,823 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 8 xjuncts. [2018-02-04 01:00:57,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:57,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:57,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:57,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:57,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:57,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:57,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:57,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:57,990 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:57,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:57,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:57,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:57,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:57,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:57,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:00:58,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 33 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 14 case distinctions, treesize of input 120 treesize of output 502 [2018-02-04 01:00:58,044 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 16 xjuncts. [2018-02-04 01:01:09,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,491 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:09,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 31 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 18 case distinctions, treesize of input 126 treesize of output 481 [2018-02-04 01:01:09,551 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 8 xjuncts. [2018-02-04 01:01:15,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,358 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:01:15,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 11 case distinctions, treesize of input 101 treesize of output 449 [2018-02-04 01:01:15,400 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 8 xjuncts. Received shutdown request... [2018-02-04 01:01:15,861 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 01:01:15,862 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 01:01:15,865 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 01:01:15,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:01:15 BoogieIcfgContainer [2018-02-04 01:01:15,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:01:15,866 INFO L168 Benchmark]: Toolchain (without parser) took 202778.88 ms. Allocated memory was 404.2 MB in the beginning and 601.9 MB in the end (delta: 197.7 MB). Free memory was 360.7 MB in the beginning and 465.8 MB in the end (delta: -105.1 MB). Peak memory consumption was 564.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:01:15,866 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:01:15,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.87 ms. Allocated memory is still 404.2 MB. Free memory was 360.7 MB in the beginning and 347.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. [2018-02-04 01:01:15,867 INFO L168 Benchmark]: Boogie Preprocessor took 32.61 ms. Allocated memory is still 404.2 MB. Free memory was 347.3 MB in the beginning and 344.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:01:15,867 INFO L168 Benchmark]: RCFGBuilder took 562.29 ms. Allocated memory is still 404.2 MB. Free memory was 344.7 MB in the beginning and 283.6 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. [2018-02-04 01:01:15,867 INFO L168 Benchmark]: TraceAbstraction took 201990.95 ms. Allocated memory was 404.2 MB in the beginning and 601.9 MB in the end (delta: 197.7 MB). Free memory was 282.3 MB in the beginning and 465.8 MB in the end (delta: -183.5 MB). Peak memory consumption was 485.9 MB. Max. memory is 5.3 GB. [2018-02-04 01:01:15,868 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.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 189.87 ms. Allocated memory is still 404.2 MB. Free memory was 360.7 MB in the beginning and 347.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.61 ms. Allocated memory is still 404.2 MB. Free memory was 347.3 MB in the beginning and 344.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 562.29 ms. Allocated memory is still 404.2 MB. Free memory was 344.7 MB in the beginning and 283.6 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 201990.95 ms. Allocated memory was 404.2 MB in the beginning and 601.9 MB in the end (delta: 197.7 MB). Free memory was 282.3 MB in the beginning and 465.8 MB in the end (delta: -183.5 MB). Peak memory consumption was 485.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 867). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 869). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 869). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 912). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 912). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 917). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 919). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 917). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 919). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 853). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 852). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 851). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 854). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 852). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 854). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 845). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 845). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 851). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 853). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 879). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 879). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 936]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 936). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 874). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 875). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 875). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 874). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 893). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 893). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 893). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 891). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 893). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 891). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 906). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 906). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 905). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 905). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 907). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 907). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 906). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 906). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 276. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 268 locations, 73 error locations. TIMEOUT Result, 201.9s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 35.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3855 SDtfs, 11833 SDslu, 12440 SDs, 0 SdLazy, 31916 SolverSat, 1649 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 13.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 581 GetRequests, 114 SyntacticMatches, 25 SemanticMatches, 442 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3966 ImplicationChecksByTransitivity, 24.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=458occurred in iteration=18, 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, 21 MinimizatonAttempts, 699 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 842 NumberOfCodeBlocks, 842 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 819 ConstructedInterpolants, 41 QuantifiedInterpolants, 771571 SizeOfPredicates, 57 NumberOfNonLiveVariables, 650 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 23 InterpolantComputations, 19 PerfectInterpolantSequences, 12/52 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/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-01-15-873.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-01-15-873.csv Completed graceful shutdown