./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:29:45,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:29:45,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:29:45,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:29:45,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:29:45,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:29:45,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:29:45,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:29:45,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:29:45,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:29:45,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:29:45,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:29:45,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:29:45,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:29:45,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:29:45,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:29:45,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:29:45,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:29:45,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:29:45,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:29:45,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:29:45,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:29:45,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:29:45,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:29:45,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:29:45,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:29:45,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:29:45,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:29:45,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:29:45,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:29:45,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:29:45,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:29:45,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:29:45,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:29:45,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:29:45,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:29:45,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:29:45,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:29:45,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:29:45,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:29:45,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:29:45,559 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 00:29:45,593 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:29:45,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:29:45,594 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:29:45,594 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:29:45,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:29:45,596 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:29:45,596 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:29:45,596 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:29:45,596 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:29:45,597 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 00:29:45,597 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:29:45,597 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:29:45,598 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 00:29:45,598 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 00:29:45,598 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:29:45,599 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 00:29:45,599 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 00:29:45,599 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 00:29:45,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:29:45,601 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:29:45,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:29:45,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:29:45,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:29:45,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 00:29:45,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:29:45,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 00:29:45,603 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:29:45,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 00:29:45,603 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:29:45,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 00:29:45,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:29:45,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:29:45,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:29:45,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:29:45,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:29:45,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 00:29:45,606 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 00:29:45,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 00:29:45,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 00:29:45,607 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:29:45,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:29:45,607 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2021-11-21 00:29:45,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:29:45,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:29:45,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:29:45,988 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:29:45,989 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:29:45,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2021-11-21 00:29:46,079 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/data/e1317c1be/8a9d886044704f14964b3d4fdf08df65/FLAG93e90382a [2021-11-21 00:29:46,824 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:29:46,825 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2021-11-21 00:29:46,845 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/data/e1317c1be/8a9d886044704f14964b3d4fdf08df65/FLAG93e90382a [2021-11-21 00:29:47,073 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/data/e1317c1be/8a9d886044704f14964b3d4fdf08df65 [2021-11-21 00:29:47,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:29:47,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:29:47,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:29:47,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:29:47,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:29:47,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:29:47" (1/1) ... [2021-11-21 00:29:47,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87911ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:29:47, skipping insertion in model container [2021-11-21 00:29:47,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:29:47" (1/1) ... [2021-11-21 00:29:47,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:29:47,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:29:47,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2021-11-21 00:29:47,673 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:29:47,693 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:29:47,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2021-11-21 00:29:47,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:29:47,812 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:29:47,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:29:47 WrapperNode [2021-11-21 00:29:47,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:29:47,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:29:47,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:29:47,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:29:47,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:29:47" (1/1) ... [2021-11-21 00:29:47,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:29:47" (1/1) ... [2021-11-21 00:29:47,906 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2021-11-21 00:29:47,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:29:47,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:29:47,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:29:47,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:29:47,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:29:47" (1/1) ... [2021-11-21 00:29:47,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:29:47" (1/1) ... [2021-11-21 00:29:47,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:29:47" (1/1) ... [2021-11-21 00:29:47,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:29:47" (1/1) ... [2021-11-21 00:29:47,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:29:47" (1/1) ... [2021-11-21 00:29:47,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:29:47" (1/1) ... [2021-11-21 00:29:47,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:29:47" (1/1) ... [2021-11-21 00:29:47,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:29:47,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:29:47,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:29:47,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:29:47,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:29:47" (1/1) ... [2021-11-21 00:29:47,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:29:48,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:29:48,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:29:48,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:29:48,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-21 00:29:48,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-21 00:29:48,088 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 00:29:48,088 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 00:29:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 00:29:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:29:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 00:29:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 00:29:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 00:29:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 00:29:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:29:48,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:29:48,199 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:29:48,201 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:29:48,460 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:29:48,569 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:29:48,574 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-21 00:29:48,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:29:48 BoogieIcfgContainer [2021-11-21 00:29:48,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:29:48,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:29:48,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:29:48,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:29:48,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:29:47" (1/3) ... [2021-11-21 00:29:48,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5126635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:29:48, skipping insertion in model container [2021-11-21 00:29:48,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:29:47" (2/3) ... [2021-11-21 00:29:48,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5126635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:29:48, skipping insertion in model container [2021-11-21 00:29:48,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:29:48" (3/3) ... [2021-11-21 00:29:48,593 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2021-11-21 00:29:48,602 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:29:48,602 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 00:29:48,654 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:29:48,662 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 00:29:48,662 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 00:29:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:29:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-21 00:29:48,686 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:29:48,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:29:48,688 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:29:48,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:29:48,693 INFO L85 PathProgramCache]: Analyzing trace with hash 165599205, now seen corresponding path program 1 times [2021-11-21 00:29:48,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:29:48,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160165753] [2021-11-21 00:29:48,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:29:48,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:29:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:29:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:29:48,947 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:29:48,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160165753] [2021-11-21 00:29:48,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160165753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:29:48,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:29:48,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 00:29:48,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818609989] [2021-11-21 00:29:48,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:29:48,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:29:48,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:29:48,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:29:48,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:29:49,000 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 00:29:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:29:49,109 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2021-11-21 00:29:49,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:29:49,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-11-21 00:29:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:29:49,121 INFO L225 Difference]: With dead ends: 37 [2021-11-21 00:29:49,121 INFO L226 Difference]: Without dead ends: 19 [2021-11-21 00:29:49,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:29:49,132 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:29:49,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 35 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:29:49,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-21 00:29:49,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-11-21 00:29:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:29:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2021-11-21 00:29:49,222 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2021-11-21 00:29:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:29:49,223 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2021-11-21 00:29:49,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 00:29:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2021-11-21 00:29:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-21 00:29:49,229 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:29:49,229 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:29:49,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 00:29:49,230 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:29:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:29:49,235 INFO L85 PathProgramCache]: Analyzing trace with hash 523554530, now seen corresponding path program 1 times [2021-11-21 00:29:49,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:29:49,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63973642] [2021-11-21 00:29:49,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:29:49,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:29:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:29:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 00:29:49,432 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:29:49,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63973642] [2021-11-21 00:29:49,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63973642] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:29:49,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:29:49,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-21 00:29:49,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841199384] [2021-11-21 00:29:49,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:29:49,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:29:49,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:29:49,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:29:49,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:29:49,439 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:29:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:29:49,526 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-11-21 00:29:49,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 00:29:49,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-11-21 00:29:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:29:49,531 INFO L225 Difference]: With dead ends: 29 [2021-11-21 00:29:49,532 INFO L226 Difference]: Without dead ends: 24 [2021-11-21 00:29:49,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:29:49,540 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:29:49,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 20 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:29:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-21 00:29:49,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2021-11-21 00:29:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:29:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2021-11-21 00:29:49,549 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 18 [2021-11-21 00:29:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:29:49,550 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2021-11-21 00:29:49,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:29:49,550 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2021-11-21 00:29:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-21 00:29:49,551 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:29:49,552 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:29:49,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 00:29:49,552 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:29:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:29:49,553 INFO L85 PathProgramCache]: Analyzing trace with hash 517856597, now seen corresponding path program 1 times [2021-11-21 00:29:49,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:29:49,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154310266] [2021-11-21 00:29:49,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:29:49,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:29:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:29:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 00:29:49,785 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:29:49,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154310266] [2021-11-21 00:29:49,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154310266] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:29:49,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:29:49,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 00:29:49,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870589010] [2021-11-21 00:29:49,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:29:49,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-21 00:29:49,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:29:49,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-21 00:29:49,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-21 00:29:49,789 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:29:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:29:49,881 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2021-11-21 00:29:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-21 00:29:49,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2021-11-21 00:29:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:29:49,883 INFO L225 Difference]: With dead ends: 32 [2021-11-21 00:29:49,883 INFO L226 Difference]: Without dead ends: 25 [2021-11-21 00:29:49,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:29:49,886 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:29:49,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 24 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:29:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-21 00:29:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2021-11-21 00:29:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:29:49,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-11-21 00:29:49,895 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 20 [2021-11-21 00:29:49,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:29:49,896 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-11-21 00:29:49,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:29:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2021-11-21 00:29:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-21 00:29:49,898 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:29:49,898 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:29:49,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-21 00:29:49,899 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:29:49,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:29:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash 250342324, now seen corresponding path program 1 times [2021-11-21 00:29:49,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:29:49,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936430821] [2021-11-21 00:29:49,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:29:49,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:29:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:29:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 00:29:50,081 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:29:50,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936430821] [2021-11-21 00:29:50,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936430821] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:29:50,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266441602] [2021-11-21 00:29:50,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:29:50,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:29:50,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:29:50,088 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:29:50,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 00:29:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:29:50,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 00:29:50,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:29:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 00:29:50,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:29:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 00:29:50,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266441602] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:29:50,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1221620564] [2021-11-21 00:29:50,525 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-21 00:29:50,538 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 00:29:50,543 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 00:29:50,549 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 00:29:50,559 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 00:29:50,889 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-21 00:29:50,913 INFO L388 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 6 treesize of output 5 [2021-11-21 00:29:50,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:50,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:50,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:50,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-11-21 00:29:51,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:51,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:51,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:51,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2021-11-21 00:29:51,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:51,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:51,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:51,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2021-11-21 00:29:52,013 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:29:52,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:29:52,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:29:52,126 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:29:52,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:29:52,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:29:52,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:29:52,378 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:29:52,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:29:52,438 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:29:52,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:52,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:52,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:52,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2021-11-21 00:29:52,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:52,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:52,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:29:52,679 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-21 00:29:52,679 INFO L388 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 1 case distinctions, treesize of input 44 treesize of output 30 [2021-11-21 00:29:52,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:52,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:52,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:29:52,729 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-21 00:29:52,729 INFO L388 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 1 case distinctions, treesize of input 44 treesize of output 34 [2021-11-21 00:29:53,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:29:53,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:29:53,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:29:53,105 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:29:53,177 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:29:53,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:29:53,403 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:29:53,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:29:53,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:29:53,487 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:29:53,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:53,709 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-21 00:29:53,710 INFO L388 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 1 case distinctions, treesize of input 42 treesize of output 28 [2021-11-21 00:29:53,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:53,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:53,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2021-11-21 00:29:53,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:53,771 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-21 00:29:53,772 INFO L388 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 1 case distinctions, treesize of input 42 treesize of output 32 [2021-11-21 00:29:53,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:53,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2021-11-21 00:29:53,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:29:53,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:53,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2021-11-21 00:29:54,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:54,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 7 [2021-11-21 00:29:55,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-11-21 00:29:55,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:55,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:55,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:29:55,340 INFO L354 Elim1Store]: treesize reduction 86, result has 38.6 percent of original size [2021-11-21 00:29:55,341 INFO L388 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 242 [2021-11-21 00:29:55,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:55,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:55,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:29:55,450 INFO L354 Elim1Store]: treesize reduction 78, result has 44.3 percent of original size [2021-11-21 00:29:55,451 INFO L388 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 242 treesize of output 260 [2021-11-21 00:29:57,145 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-11-21 00:29:57,156 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-11-21 00:29:58,051 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-21 00:29:58,052 INFO L388 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 1 case distinctions, treesize of input 126 treesize of output 120 [2021-11-21 00:29:58,087 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-21 00:29:58,088 INFO L388 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 1 case distinctions, treesize of input 120 treesize of output 114 [2021-11-21 00:29:58,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-11-21 00:29:59,755 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2021-11-21 00:30:02,063 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 00:30:08,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1221620564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:30:08,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:30:08,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [5, 5, 5] total 20 [2021-11-21 00:30:08,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108704172] [2021-11-21 00:30:08,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:30:08,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-21 00:30:08,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:30:08,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-21 00:30:08,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2021-11-21 00:30:08,220 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:30:08,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:30:08,635 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2021-11-21 00:30:08,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-21 00:30:08,645 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2021-11-21 00:30:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:30:08,646 INFO L225 Difference]: With dead ends: 31 [2021-11-21 00:30:08,646 INFO L226 Difference]: Without dead ends: 26 [2021-11-21 00:30:08,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2021-11-21 00:30:08,648 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:30:08,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 24 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 92 Invalid, 0 Unknown, 56 Unchecked, 0.2s Time] [2021-11-21 00:30:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-21 00:30:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2021-11-21 00:30:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:30:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2021-11-21 00:30:08,658 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 21 [2021-11-21 00:30:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:30:08,659 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-11-21 00:30:08,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:30:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2021-11-21 00:30:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-21 00:30:08,660 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:30:08,660 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:30:08,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-21 00:30:08,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:30:08,887 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:30:08,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:30:08,887 INFO L85 PathProgramCache]: Analyzing trace with hash -831696074, now seen corresponding path program 1 times [2021-11-21 00:30:08,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:30:08,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581462755] [2021-11-21 00:30:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:30:08,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:30:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:30:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-21 00:30:08,958 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:30:08,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581462755] [2021-11-21 00:30:08,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581462755] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:30:08,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772102544] [2021-11-21 00:30:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:30:08,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:30:08,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:30:08,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:30:08,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-21 00:30:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:30:09,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 00:30:09,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:30:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-21 00:30:09,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:30:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-21 00:30:09,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772102544] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:30:09,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [501408472] [2021-11-21 00:30:09,208 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-21 00:30:09,209 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 00:30:09,209 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 00:30:09,209 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 00:30:09,210 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 00:30:09,318 INFO L388 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 6 treesize of output 5 [2021-11-21 00:30:09,322 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-21 00:30:09,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:09,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:09,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:09,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2021-11-21 00:30:09,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:09,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:09,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:09,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-11-21 00:30:09,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:09,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:09,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:09,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2021-11-21 00:30:10,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:30:10,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:30:10,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:30:10,126 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:30:10,167 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:30:10,311 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:30:10,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:30:10,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:30:10,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:30:10,390 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:30:10,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:10,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:10,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:10,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 20 [2021-11-21 00:30:10,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:10,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:10,509 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-11-21 00:30:10,509 INFO L388 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 1 case distinctions, treesize of input 46 treesize of output 32 [2021-11-21 00:30:10,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:10,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:10,546 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 00:30:10,547 INFO L388 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 1 case distinctions, treesize of input 46 treesize of output 36 [2021-11-21 00:30:10,810 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:30:10,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:30:10,865 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:30:10,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:30:10,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:30:11,075 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:30:11,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:30:11,110 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 00:30:11,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:30:11,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-21 00:30:11,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:11,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:11,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 339 treesize of output 323 [2021-11-21 00:30:11,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:11,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:11,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:11,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:11,339 INFO L354 Elim1Store]: treesize reduction 58, result has 26.6 percent of original size [2021-11-21 00:30:11,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 326 treesize of output 319 [2021-11-21 00:30:11,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:11,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:11,361 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:11,388 INFO L354 Elim1Store]: treesize reduction 78, result has 17.9 percent of original size [2021-11-21 00:30:11,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 385 treesize of output 269 [2021-11-21 00:30:11,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:11,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2021-11-21 00:30:11,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:11,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2021-11-21 00:30:11,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:11,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 48 [2021-11-21 00:30:11,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:11,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:11,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2021-11-21 00:30:11,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:11,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2021-11-21 00:30:11,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:11,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 7 [2021-11-21 00:30:12,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-11-21 00:30:12,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:12,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:12,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:12,788 INFO L354 Elim1Store]: treesize reduction 78, result has 44.3 percent of original size [2021-11-21 00:30:12,788 INFO L388 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 220 treesize of output 238 [2021-11-21 00:30:12,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:12,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:12,834 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:12,954 INFO L354 Elim1Store]: treesize reduction 86, result has 38.6 percent of original size [2021-11-21 00:30:12,955 INFO L388 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 238 treesize of output 248 [2021-11-21 00:30:16,089 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-21 00:30:16,089 INFO L388 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 1 case distinctions, treesize of input 124 treesize of output 118 [2021-11-21 00:30:16,112 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-21 00:30:16,113 INFO L388 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 1 case distinctions, treesize of input 118 treesize of output 112 [2021-11-21 00:30:16,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-11-21 00:30:18,444 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2021-11-21 00:30:20,285 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 00:30:27,428 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-21 00:30:27,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:30:27,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-11-21 00:30:27,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878185420] [2021-11-21 00:30:27,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:30:27,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 00:30:27,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:30:27,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 00:30:27,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2021-11-21 00:30:27,431 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-21 00:30:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:30:27,493 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2021-11-21 00:30:27,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-21 00:30:27,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2021-11-21 00:30:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:30:27,494 INFO L225 Difference]: With dead ends: 35 [2021-11-21 00:30:27,494 INFO L226 Difference]: Without dead ends: 28 [2021-11-21 00:30:27,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2021-11-21 00:30:27,495 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:30:27,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 44 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:30:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-11-21 00:30:27,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2021-11-21 00:30:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:30:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2021-11-21 00:30:27,505 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 22 [2021-11-21 00:30:27,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:30:27,505 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2021-11-21 00:30:27,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-21 00:30:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2021-11-21 00:30:27,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-21 00:30:27,507 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:30:27,507 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:30:27,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-21 00:30:27,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:30:27,715 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:30:27,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:30:27,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1430491229, now seen corresponding path program 2 times [2021-11-21 00:30:27,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:30:27,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228589228] [2021-11-21 00:30:27,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:30:27,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:30:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:30:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:30:28,621 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:30:28,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228589228] [2021-11-21 00:30:28,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228589228] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:30:28,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705403411] [2021-11-21 00:30:28,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 00:30:28,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:30:28,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:30:28,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:30:28,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b986bfc-aa74-4be4-a9b3-681936ac7bbe/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-21 00:30:28,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-21 00:30:28,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:30:28,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-21 00:30:28,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:30:28,861 INFO L388 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 6 treesize of output 5 [2021-11-21 00:30:29,032 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:30:29,033 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-21 00:30:29,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 65 [2021-11-21 00:30:29,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 52 [2021-11-21 00:30:29,194 INFO L354 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2021-11-21 00:30:29,194 INFO L388 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 141 treesize of output 89 [2021-11-21 00:30:29,244 INFO L354 Elim1Store]: treesize reduction 150, result has 16.7 percent of original size [2021-11-21 00:30:29,244 INFO L388 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 96 [2021-11-21 00:30:29,708 INFO L354 Elim1Store]: treesize reduction 373, result has 13.1 percent of original size [2021-11-21 00:30:29,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 199 treesize of output 174 [2021-11-21 00:30:29,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 174 treesize of output 166 [2021-11-21 00:30:29,782 INFO L354 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2021-11-21 00:30:29,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 166 treesize of output 162 [2021-11-21 00:30:30,119 INFO L354 Elim1Store]: treesize reduction 236, result has 14.2 percent of original size [2021-11-21 00:30:30,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 195 treesize of output 163 [2021-11-21 00:30:30,140 INFO L354 Elim1Store]: treesize reduction 59, result has 22.4 percent of original size [2021-11-21 00:30:30,141 INFO L388 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 1 case distinctions, treesize of input 176 treesize of output 175 [2021-11-21 00:30:30,212 INFO L354 Elim1Store]: treesize reduction 281, result has 12.5 percent of original size [2021-11-21 00:30:30,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 163 treesize of output 137 [2021-11-21 00:30:30,667 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-11-21 00:30:30,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 122 [2021-11-21 00:30:30,685 INFO L354 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2021-11-21 00:30:30,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 72 [2021-11-21 00:30:30,782 INFO L388 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 45 treesize of output 27 [2021-11-21 00:30:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:30:30,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:30:33,211 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_circular_update_at_~data#1| Int) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int)) (<= (+ (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 |ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_DerPreprocessor_15)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_DerPreprocessor_16)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((|ULTIMATE.start_dll_circular_update_at_~data#1| Int) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 |ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 v_DerPreprocessor_15)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 v_DerPreprocessor_16)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1)))) is different from false [2021-11-21 00:30:35,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int)) (or (and (forall ((|ULTIMATE.start_dll_circular_update_at_~data#1| Int) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 |ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_DerPreprocessor_15) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_DerPreprocessor_16) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1))) (forall ((|ULTIMATE.start_dll_circular_update_at_~data#1| Int) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 |ULTIMATE.start_dll_circular_update_at_~data#1|)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_DerPreprocessor_15) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_DerPreprocessor_16) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-11-21 00:30:35,297 INFO L354 Elim1Store]: treesize reduction 47, result has 7.8 percent of original size [2021-11-21 00:30:35,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 821 treesize of output 753 [2021-11-21 00:30:38,870 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_17)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse0 .cse1) (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (let ((.cse2 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_17)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (= .cse2 |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|)))) (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (let ((.cse3 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_17)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse3 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29|) (and (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (= .cse3 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (let ((.cse4 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_17)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_16) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse4 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29|) (and (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse4 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_17)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_16) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (or (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_17)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_main_~s~0#1.offset|) |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29|)))) (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~s~0#1.base| .cse5) (and (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_17)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_16) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| .cse5))))) (or (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (let ((.cse6 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_17)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= .cse6 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29|)) (not (= .cse6 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))))) (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (let ((.cse7 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= .cse7 |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= .cse7 |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)))))) (or (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_DerPreprocessor_17)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_16) |c_ULTIMATE.start_main_~s~0#1.offset|) |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29|)))) (<= .cse1 .cse0))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-11-21 00:30:41,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int)) (or (let ((.cse10 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.cse9 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (let ((.cse0 (select (store (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) (+ .cse1 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_16) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (= .cse0 .cse1) (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (= .cse0 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29|))))) (or (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= .cse4 .cse5)) (not (= .cse5 |c_ULTIMATE.start_main_~s~0#1.base|)))))) (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (let ((.cse6 (select (store (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse8 (store (select |c_#memory_$Pointer$.offset| .cse8) (+ .cse7 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= .cse6 .cse7)) (not (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| .cse6))))))) (<= .cse9 .cse10) (or (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (not (= (select (store (select (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse11 (store (select |c_#memory_$Pointer$.offset| .cse11) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_16) |c_ULTIMATE.start_main_~s~0#1.offset|) |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29|))) (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse12 (store (select |c_#memory_$Pointer$.base| .cse12) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) v_DerPreprocessor_18))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (or (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (not (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| (select (store (select (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse13 (store (select |c_#memory_$Pointer$.offset| .cse13) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (not (= (select (store (select (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse14 (store (select |c_#memory_$Pointer$.base| .cse14) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) v_DerPreprocessor_18))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= (select (store (select (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse15 (store (select |c_#memory_$Pointer$.offset| .cse15) (+ .cse16 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_16) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse16))) (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (let ((.cse18 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (let ((.cse17 (select (store (select (store |c_#memory_$Pointer$.base| .cse18 (store (select |c_#memory_$Pointer$.base| .cse18) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~s~0#1.base| .cse17) (and (= .cse18 .cse17) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (let ((.cse20 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= (select (store (select (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse19 (store (select |c_#memory_$Pointer$.offset| .cse19) (+ .cse20 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_16) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse20)))))))) (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (let ((.cse21 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= .cse21 (select (store (select (store |c_#memory_$Pointer$.base| .cse21 (store (select |c_#memory_$Pointer$.base| .cse21) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (let ((.cse22 (select (store (select (store |c_#memory_$Pointer$.base| .cse23 (store (select |c_#memory_$Pointer$.base| .cse23) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse22 |c_ULTIMATE.start_main_~s~0#1.base|) (and (= .cse23 .cse22) (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (let ((.cse25 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= (select (store (select (let ((.cse24 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse24 (store (select |c_#memory_$Pointer$.offset| .cse24) (+ .cse25 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse25)))))))) (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= .cse26 (select (store (select (store |c_#memory_$Pointer$.base| .cse26 (store (select |c_#memory_$Pointer$.base| .cse26) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (let ((.cse28 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= (select (store (select (let ((.cse27 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse27 (store (select |c_#memory_$Pointer$.offset| .cse27) (+ .cse28 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse28))) (<= .cse10 .cse9) (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (let ((.cse30 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (let ((.cse29 (select (store (select (let ((.cse32 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse32 (store (select |c_#memory_$Pointer$.offset| .cse32) (+ .cse30 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (= .cse29 .cse30) (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (let ((.cse31 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= .cse31 (select (store (select (store |c_#memory_$Pointer$.base| .cse31 (store (select |c_#memory_$Pointer$.base| .cse31) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| .cse29))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-11-21 00:30:44,474 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse5 (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (let ((.cse24 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse24 (store (select |c_#memory_$Pointer$.base| .cse24) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_18))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (and (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse1) (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) (= .cse3 .cse2))))) (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|) (or (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (not (= (select (store (select (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_main_~s~0#1.offset|) |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29|))) .cse5) (or (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse6 (select (store (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse8 (store (select |c_#memory_$Pointer$.offset| .cse8) (+ .cse7 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= .cse6 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29|)) (not (= .cse7 .cse6)))))) .cse5) (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse9 (select (store (select (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) (+ .cse9 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse11 (select (store (select (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse14 (store (select |c_#memory_$Pointer$.offset| .cse14) (+ .cse12 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_16) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse11 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29|) (and (= .cse11 .cse12) (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse13 (select (store (select (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_main_~s~0#1.offset|))))))))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse15 (store (select |c_#memory_$Pointer$.offset| .cse15) (+ .cse16 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_16) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse16))) (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse17 (select (store (select (store |c_#memory_$Pointer$.base| .cse17 (store (select |c_#memory_$Pointer$.base| .cse17) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (let ((.cse20 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse18 (select (store (select (let ((.cse21 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse21 (store (select |c_#memory_$Pointer$.offset| .cse21) (+ .cse20 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse18 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29|) (and (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse19 (select (store (select (store |c_#memory_$Pointer$.base| .cse19 (store (select |c_#memory_$Pointer$.base| .cse19) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_18)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (= .cse20 .cse18)))))) (or (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (not (= (select (store (select (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse22 (store (select |c_#memory_$Pointer$.offset| .cse22) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_17))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_16) |c_ULTIMATE.start_main_~s~0#1.offset|) |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29|))) (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (not (= (select (store (select (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse23 (store (select |c_#memory_$Pointer$.base| .cse23) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) v_DerPreprocessor_18))) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))))))) is different from false [2021-11-21 00:30:48,068 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_prenex_6 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_DerPreprocessor_17 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (store (select (let ((.cse0 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse5)) (.cse1 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 .cse2) v_DerPreprocessor_17))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse2))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (or (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (not (= (select (store (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse8 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse9 (store (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse6 (store .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse9)) (.cse7 (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse6 .cse7 (store (select .cse6 .cse7) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse8 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_DerPreprocessor_18))))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (not (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| (select (store (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse14 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse13 (store (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse14 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse11 (store .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse13)) (.cse12 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse14 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ 8 (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_DerPreprocessor_17))))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_16) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse19 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse21 (store (select .cse20 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse19 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (store (select (let ((.cse16 (store .cse20 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse21)) (.cse17 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse19 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse16 .cse17 (store (select .cse16 .cse17) (+ 8 .cse18) v_DerPreprocessor_17))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_16) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse18))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (or (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse24 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse25 (store (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse24 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse22 (store .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse25)) (.cse23 (select .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse22 .cse23 (store (select .cse22 .cse23) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse24 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_DerPreprocessor_18))))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (not (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| (select (store (select (let ((.cse31 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse30 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse29 (store (select .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse27 (store .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse29)) (.cse28 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse30 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse27 .cse28 (store (select .cse27 .cse28) (+ 8 (select .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_DerPreprocessor_17))))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (forall ((v_prenex_6 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_DerPreprocessor_17 Int)) (let ((.cse42 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse41 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse43 (store (select .cse42 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse38 (select .cse43 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse32 (select (store (select (let ((.cse39 (store .cse42 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse43)) (.cse40 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse41 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse39 .cse40 (store (select .cse39 .cse40) (+ 8 .cse38) v_DerPreprocessor_17))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| .cse32) (and (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse35 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse37 (store (select .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse35 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse33 (select .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse33 (select (store (select (let ((.cse34 (store .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse37))) (store .cse34 .cse33 (store (select .cse34 .cse33) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_DerPreprocessor_18))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (= .cse32 .cse38)))))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int)) (let ((.cse54 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse53 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse55 (store (select .cse54 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse45 (select .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse44 (select (store (select (let ((.cse51 (store .cse54 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse55)) (.cse52 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse53 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse51 .cse52 (store (select .cse51 .cse52) (+ 8 .cse45) v_DerPreprocessor_17))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_16) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| .cse44) (and (= .cse44 .cse45) (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse48 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse50 (store (select .cse49 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse48 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse47 (select .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (store (select (let ((.cse46 (store .cse49 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse50))) (store .cse46 .cse47 (store (select .cse46 .cse47) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_DerPreprocessor_18))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse47)))))))))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_15 Int)) (let ((.cse59 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse58 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse60 (store (select .cse59 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse58 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse57 (select .cse60 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (store (select (let ((.cse56 (store .cse59 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse60))) (store .cse56 .cse57 (store (select .cse56 .cse57) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_DerPreprocessor_18))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_DerPreprocessor_15) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse57))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (or (forall ((v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse65 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse63 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse64 (store (select .cse65 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse63 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse61 (store .cse65 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse64)) (.cse62 (select .cse64 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse61 .cse62 (store (select .cse61 .cse62) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse63 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_DerPreprocessor_18))))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_prenex_6 Int) (v_DerPreprocessor_17 Int)) (let ((.cse71 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse70 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse72 (store (select .cse71 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse70 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse67 (select .cse72 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse66 (select (store (select (let ((.cse68 (store .cse71 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse72)) (.cse69 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse70 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store .cse68 .cse69 (store (select .cse68 .cse69) (+ 8 .cse67) v_DerPreprocessor_17))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (not (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| .cse66)) (not (= .cse66 .cse67)))))))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_prenex_5 Int) (v_DerPreprocessor_18 Int)) (let ((.cse76 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse75 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse77 (store (select .cse76 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse75 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse73 (select .cse77 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse73 (select (store (select (let ((.cse74 (store .cse76 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse77))) (store .cse74 .cse73 (store (select .cse74 .cse73) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) v_DerPreprocessor_18))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))))) is different from false [2021-11-21 00:31:27,272 WARN L227 SmtUtils]: Spent 38.28s on a formula simplification. DAG size of input: 30 DAG size of output: 21 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-21 00:31:27,273 INFO L354 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2021-11-21 00:31:27,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 2423 treesize of output 2415 [2021-11-21 00:32:24,339 WARN L227 SmtUtils]: Spent 57.04s on a formula simplification. DAG size of input: 30 DAG size of output: 27 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-21 00:32:24,340 INFO L354 Elim1Store]: treesize reduction 17, result has 69.6 percent of original size [2021-11-21 00:32:24,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 2415 treesize of output 2419 [2021-11-21 00:32:25,251 INFO L388 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 8 treesize of output 4 [2021-11-21 00:32:25,330 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-21 00:32:25,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 9 [2021-11-21 00:32:25,399 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:32:25,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 54 [2021-11-21 00:32:25,436 INFO L388 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 68 treesize of output 48 [2021-11-21 00:32:27,250 INFO L173 IndexEqualityManager]: detected equality via solver