./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --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 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:14:36,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:14:36,813 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 05:14:36,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:14:36,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:14:36,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:14:36,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:14:36,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:14:36,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:14:36,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:14:36,875 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:14:36,876 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:14:36,876 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:14:36,876 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:14:36,876 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:14:36,877 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:14:36,877 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:14:36,877 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:14:36,877 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:14:36,877 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:14:36,877 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:14:36,877 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:14:36,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:14:36,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:14:36,878 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:14:36,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:14:36,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:14:36,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:14:36,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:14:36,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:14:36,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:14:36,879 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:14:36,879 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:14:36,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:14:36,879 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:14:36,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:14:36,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:14:36,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:14:36,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:14:36,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:14:36,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:14:36,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:14:36,882 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:14:36,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:14:36,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:14:36,883 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:14:36,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:14:36,883 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2024-11-14 05:14:37,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:14:37,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:14:37,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:14:37,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:14:37,268 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:14:37,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i Unable to find full path for "g++" [2024-11-14 05:14:39,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:14:40,140 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:14:40,142 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2024-11-14 05:14:40,165 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/data/060fe7bb6/e4e23e383f4b4b68b8657e847ce25f8a/FLAGc15eb4f57 [2024-11-14 05:14:40,187 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/data/060fe7bb6/e4e23e383f4b4b68b8657e847ce25f8a [2024-11-14 05:14:40,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:14:40,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:14:40,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:14:40,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:14:40,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:14:40,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:14:40" (1/1) ... [2024-11-14 05:14:40,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee71a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:40, skipping insertion in model container [2024-11-14 05:14:40,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:14:40" (1/1) ... [2024-11-14 05:14:40,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:14:40,708 WARN L250 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_ba34aa59-26f7-4e60-89d0-58337bfe0186/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2024-11-14 05:14:40,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:14:40,730 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:14:40,800 WARN L250 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_ba34aa59-26f7-4e60-89d0-58337bfe0186/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2024-11-14 05:14:40,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:14:40,839 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:14:40,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:40 WrapperNode [2024-11-14 05:14:40,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:14:40,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:14:40,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:14:40,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:14:40,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:40" (1/1) ... [2024-11-14 05:14:40,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:40" (1/1) ... [2024-11-14 05:14:40,938 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2024-11-14 05:14:40,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:14:40,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:14:40,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:14:40,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:14:40,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:40" (1/1) ... [2024-11-14 05:14:40,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:40" (1/1) ... [2024-11-14 05:14:40,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:40" (1/1) ... [2024-11-14 05:14:40,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:40" (1/1) ... [2024-11-14 05:14:40,983 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:40" (1/1) ... [2024-11-14 05:14:40,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:40" (1/1) ... [2024-11-14 05:14:40,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:40" (1/1) ... [2024-11-14 05:14:41,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:40" (1/1) ... [2024-11-14 05:14:41,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:14:41,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:14:41,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:14:41,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:14:41,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:40" (1/1) ... [2024-11-14 05:14:41,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:14:41,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:14:41,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:14:41,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:14:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:14:41,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:14:41,095 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 05:14:41,095 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 05:14:41,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:14:41,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:14:41,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:14:41,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:14:41,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:14:41,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:14:41,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 05:14:41,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:14:41,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:14:41,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:14:41,249 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:14:41,253 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:14:41,629 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-14 05:14:41,630 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:14:41,818 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:14:41,819 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-14 05:14:41,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:14:41 BoogieIcfgContainer [2024-11-14 05:14:41,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:14:41,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:14:41,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:14:41,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:14:41,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:14:40" (1/3) ... [2024-11-14 05:14:41,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38521bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:14:41, skipping insertion in model container [2024-11-14 05:14:41,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:40" (2/3) ... [2024-11-14 05:14:41,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38521bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:14:41, skipping insertion in model container [2024-11-14 05:14:41,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:14:41" (3/3) ... [2024-11-14 05:14:41,843 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2024-11-14 05:14:41,869 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:14:41,871 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_insert_equal.i that has 2 procedures, 24 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-14 05:14:41,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:14:41,964 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4bb8b869, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:14:41,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 05:14:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:14:41,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 05:14:41,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:14:41,979 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:14:41,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:14:41,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:14:41,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1342613939, now seen corresponding path program 1 times [2024-11-14 05:14:41,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:14:41,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910762910] [2024-11-14 05:14:41,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:14:41,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:14:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:14:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:14:42,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:14:42,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910762910] [2024-11-14 05:14:42,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910762910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:14:42,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:14:42,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:14:42,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348184348] [2024-11-14 05:14:42,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:14:42,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:14:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:14:42,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:14:42,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:14:42,762 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-14 05:14:43,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:14:43,060 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2024-11-14 05:14:43,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:14:43,063 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), 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 16 [2024-11-14 05:14:43,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:14:43,070 INFO L225 Difference]: With dead ends: 43 [2024-11-14 05:14:43,070 INFO L226 Difference]: Without dead ends: 19 [2024-11-14 05:14:43,073 INFO L431 NwaCegarLoop]: 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 [2024-11-14 05:14:43,077 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:14:43,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:14:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-14 05:14:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-14 05:14:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:14:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2024-11-14 05:14:43,115 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 16 [2024-11-14 05:14:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:14:43,116 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-11-14 05:14:43,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-14 05:14:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2024-11-14 05:14:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:14:43,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:14:43,119 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:14:43,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:14:43,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:14:43,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:14:43,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1765703331, now seen corresponding path program 1 times [2024-11-14 05:14:43,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:14:43,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225917662] [2024-11-14 05:14:43,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:14:43,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:14:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:14:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 05:14:43,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:14:43,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225917662] [2024-11-14 05:14:43,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225917662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:14:43,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:14:43,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:14:43,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092462076] [2024-11-14 05:14:43,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:14:43,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:14:43,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:14:43,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:14:43,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:14:43,604 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:14:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:14:43,723 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-11-14 05:14:43,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:14:43,725 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-14 05:14:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:14:43,726 INFO L225 Difference]: With dead ends: 28 [2024-11-14 05:14:43,726 INFO L226 Difference]: Without dead ends: 22 [2024-11-14 05:14:43,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:14:43,728 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:14:43,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 37 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:14:43,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-14 05:14:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-11-14 05:14:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:14:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-14 05:14:43,736 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 22 [2024-11-14 05:14:43,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:14:43,737 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-14 05:14:43,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:14:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-14 05:14:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:14:43,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:14:43,739 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:14:43,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:14:43,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:14:43,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:14:43,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1183305457, now seen corresponding path program 1 times [2024-11-14 05:14:43,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:14:43,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86150041] [2024-11-14 05:14:43,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:14:43,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:14:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:14:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:14:48,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:14:48,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86150041] [2024-11-14 05:14:48,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86150041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:14:48,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782882663] [2024-11-14 05:14:48,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:14:48,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:14:48,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:14:48,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:14:48,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:14:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:14:49,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-11-14 05:14:49,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:14:49,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:14:49,758 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-14 05:14:49,966 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:14:49,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:14:50,147 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 11 [2024-11-14 05:14:50,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 05:14:50,563 INFO L378 Elim1Store]: Elim1 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 46 treesize of output 26 [2024-11-14 05:14:50,575 INFO L378 Elim1Store]: Elim1 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 7 treesize of output 3 [2024-11-14 05:14:50,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:14:50,593 INFO L378 Elim1Store]: Elim1 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 [2024-11-14 05:14:50,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:14:50,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-14 05:14:50,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:14:50,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 41 [2024-11-14 05:14:51,023 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-14 05:14:51,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-14 05:14:51,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 05:14:51,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:14:51,748 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-11-14 05:14:51,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 76 [2024-11-14 05:14:51,766 INFO L378 Elim1Store]: Elim1 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 89 treesize of output 53 [2024-11-14 05:14:51,783 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-14 05:14:51,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:14:51,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:14:51,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:14:51,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 05:14:51,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:14:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:14:52,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:14:55,782 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0))) (and (or (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (and (or .cse0 (forall ((v_DerPreprocessor_96 (Array Int Int)) (v_DerPreprocessor_97 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (v_DerPreprocessor_102 (Array Int Int)) (v_ArrVal_349 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_349)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_96) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_DerPreprocessor_97) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_98) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_102) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (or (forall ((v_DerPreprocessor_96 (Array Int Int)) (v_DerPreprocessor_97 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_ArrVal_349 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_349)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_96) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_DerPreprocessor_97) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_98) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) .cse0) (or (forall ((v_DerPreprocessor_102 (Array Int Int)) (v_prenex_386 Int) (v_prenex_385 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_prenex_386)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_prenex_385) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_99) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_102) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not .cse0)))) (and .cse2 .cse3)) (or (not .cse3) (not .cse2) (let ((.cse7 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)) (.cse8 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0))) (and (or (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_21)) (.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_23)) (.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_19))) (or (not (= (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_22)) (not (= (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_20)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_18))))) (not .cse7) (not .cse8)) (or (and .cse7 .cse8) (let ((.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (and (or (forall ((v_ArrVal_339 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (forall ((v_ArrVal_356 Int) (v_DerPreprocessor_87 (Array Int Int)) (v_DerPreprocessor_88 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_89) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_356)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (or (let ((.cse16 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse11 (not .cse16))) (and (or .cse11 (and (forall ((v_DerPreprocessor_85 (Array Int Int)) (v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_82 (Array Int Int)) (v_prenex_25 Int) (v_DerPreprocessor_83 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| .cse13 v_DerPreprocessor_85) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_86))) (or (not (= v_DerPreprocessor_85 (select .cse12 .cse13))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_prenex_25)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))))) (or (forall ((v_DerPreprocessor_13 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (forall ((v_DerPreprocessor_84 (Array Int Int)) (v_prenex_25 Int) (v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_84) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_prenex_25)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) (or (forall ((v_ArrVal_356 Int) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_77))) (let ((.cse14 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse14 v_DerPreprocessor_80) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_81) (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_356)) .cse14 v_DerPreprocessor_78) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) .cse16) (or (and (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_ArrVal_356 Int) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_70) v_DerPreprocessor_12 v_DerPreprocessor_71) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_72))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) v_DerPreprocessor_12 (select .cse17 v_DerPreprocessor_12)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= v_DerPreprocessor_12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) (= v_DerPreprocessor_12 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_73) (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_356)) .cse18 v_DerPreprocessor_74) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_75) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_DerPreprocessor_12 .cse18)))))) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_55))) (or (forall ((v_DerPreprocessor_14 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) (forall ((v_prenex_25 Int) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_59) (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_prenex_25)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|))))) (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_ArrVal_356 Int) (v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_65 (Array Int Int)) (v_DerPreprocessor_66 (Array Int Int)) (v_DerPreprocessor_67 (Array Int Int)) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_62) v_DerPreprocessor_12 v_DerPreprocessor_63) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_64))) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) v_DerPreprocessor_12 (select .cse21 v_DerPreprocessor_12)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= v_DerPreprocessor_12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) (not (= v_DerPreprocessor_12 .cse20)) (= .cse20 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_65) .cse20 v_DerPreprocessor_66) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_67) (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_356)) .cse20 v_DerPreprocessor_68) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_69) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_55))) (or (forall ((v_prenex_370 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse22 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_prenex_370) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_prenex_25 Int) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_61) (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_prenex_25)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_ArrVal_356 Int) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_47) v_DerPreprocessor_12 v_DerPreprocessor_48) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_49))) (let ((.cse23 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse24 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) v_DerPreprocessor_12 (select .cse24 v_DerPreprocessor_12)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= v_DerPreprocessor_12 .cse23)) (= (select (select (store (store |c_#memory_int| .cse23 v_DerPreprocessor_50) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_51) (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_356)) .cse23 v_DerPreprocessor_52) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|) (= v_DerPreprocessor_12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) (= v_DerPreprocessor_12 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (v_ArrVal_356 Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_40) v_DerPreprocessor_12 v_DerPreprocessor_41) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_42))) (let ((.cse26 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse25 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) v_DerPreprocessor_12 (select .cse25 v_DerPreprocessor_12)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_46) (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_356)) .cse26 v_DerPreprocessor_43) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= v_DerPreprocessor_12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) (= v_DerPreprocessor_12 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= v_DerPreprocessor_12 .cse26)))))) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_371 (Array Int Int)) (v_prenex_25 Int) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_55))) (let ((.cse29 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse28 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_prenex_371) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse27 (store (store |c_#memory_int| .cse29 v_DerPreprocessor_57) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_58))) (or (= (select (select .cse27 (select (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_prenex_25)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select .cse27 .cse29) v_DerPreprocessor_57)) (not (= .cse29 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))))) .cse16) (or (and (forall ((v_ArrVal_356 Int) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_12 v_DerPreprocessor_35) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_36))) (let ((.cse31 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_13) v_DerPreprocessor_12 (select .cse30 v_DerPreprocessor_12)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_39) (select (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_356)) .cse31 v_DerPreprocessor_37) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_DerPreprocessor_12 .cse31)) (= v_DerPreprocessor_12 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_prenex_25 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse32 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse34 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse32) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse33 (store (store |c_#memory_int| .cse34 v_DerPreprocessor_33) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_34))) (or (not (= v_DerPreprocessor_13 .cse32)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse33 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_prenex_25)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= .cse34 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (not (= v_DerPreprocessor_33 (select .cse33 .cse34)))))))) (forall ((v_ArrVal_356 Int) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_12 v_DerPreprocessor_24) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_25))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_13) v_DerPreprocessor_12 (select .cse36 v_DerPreprocessor_12)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= v_DerPreprocessor_12 .cse35)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse35 v_DerPreprocessor_28) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_29) (select (select .cse36 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_356)) .cse35 v_DerPreprocessor_26) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_27) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (= v_DerPreprocessor_12 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (or (forall ((v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (or (not (= v_DerPreprocessor_13 .cse37)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse37) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_25 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_prenex_25)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) .cse11)))) (forall ((v_ArrVal_339 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (forall ((v_DerPreprocessor_95 (Array Int Int)) (v_ArrVal_356 Int) (v_ArrVal_339 (Array Int Int)) (v_DerPreprocessor_91 (Array Int Int)) (v_DerPreprocessor_92 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (v_DerPreprocessor_90 (Array Int Int))) (let ((.cse38 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse38 v_DerPreprocessor_94) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_95) (select (select (store (store |c_#memory_$Pointer$.base| .cse38 v_DerPreprocessor_92) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_356)) .cse38 v_DerPreprocessor_90) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= .cse38 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= .cse38 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))))))))) is different from false [2024-11-14 05:15:27,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:15:27,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2024-11-14 05:15:30,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782882663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:15:30,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1099574353] [2024-11-14 05:15:30,893 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 05:15:30,893 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:15:30,897 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:15:30,903 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:15:30,904 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:15:32,090 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:15:32,104 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:15:45,887 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 167 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:16:12,832 WARN L286 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 163 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:16:24,840 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 169 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:16:24,844 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '322#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_#memory_$Pointer$.base_65| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_22| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_35| Int) (|v_#memory_int_139| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_21| Int) (|v_#memory_$Pointer$.offset_91| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_91| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_36| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_35| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_35| Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_32| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_36| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_21| Int) (|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_23| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_35| Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_27| Int) (|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| Int) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_23| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_21| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_21| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_22| Int) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (or (and (= |#memory_int| (store |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0)))) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_32| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| 0))) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_36| |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_22|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_36| |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_22|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_21|) (= (store (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_32| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_32| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_23|)) |#memory_$Pointer$.base|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_21|) (= (store |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_32| (select (select |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_32|))) |v_#memory_int_83|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_32| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select (store |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_32| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_23|)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_65| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27| (store (select |v_#memory_$Pointer$.base_65| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0 |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_65| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27| (store (select |v_#memory_$Pointer$.offset_65| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0 0))) (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_32| 0) (or (and (= |v_#memory_$Pointer$.base_65| (store (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) (select (select (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0) (store (select (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) (select (select (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0)) (select (select (store |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|))) (= |v_#memory_int_85| (store |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0)))) (= (store (store |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) (select (select (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0) (store (select (store |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) (select (select (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0)) (select (select (store |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0) 0)) |v_#memory_$Pointer$.offset_65|) (= (store |v_#memory_int_85| (select (select (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0) (store (select |v_#memory_int_85| (select (select (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0)) (select (select (store |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0) (select (select |v_#memory_int_84| (select (select (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0)) (select (select (store |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0)))) |v_#memory_int_84|) (or (not (= (select (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0) 0)) (not (= (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0) 0)))) (and (= (select (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0) 0) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_21|) (= |v_#memory_int_84| (store |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_int_139| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 (select (select |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0)))) (= (select (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0) 0) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_35| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_21|) (= (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|)) |v_#memory_$Pointer$.base_65|) (= (store |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.offset_91| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_28|) 0 0)) |v_#memory_$Pointer$.offset_65|))) (= |#memory_int| (store |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27| (store (select |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|) 0)))) (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_32| 0))) (<= 2 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_27|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:16:24,844 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:16:24,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:16:24,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2024-11-14 05:16:24,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993688853] [2024-11-14 05:16:24,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:16:24,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 05:16:24,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:16:24,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 05:16:24,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2676, Unknown=35, NotChecked=104, Total=2970 [2024-11-14 05:16:24,851 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:16:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:16:33,807 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2024-11-14 05:16:33,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:16:33,808 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 23 [2024-11-14 05:16:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:16:33,809 INFO L225 Difference]: With dead ends: 27 [2024-11-14 05:16:33,809 INFO L226 Difference]: Without dead ends: 25 [2024-11-14 05:16:33,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 95.8s TimeCoverageRelationStatistics Valid=227, Invalid=3646, Unknown=37, NotChecked=122, Total=4032 [2024-11-14 05:16:33,815 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:16:33,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 173 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 05:16:33,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-14 05:16:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2024-11-14 05:16:33,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:16:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-11-14 05:16:33,835 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 23 [2024-11-14 05:16:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:16:33,836 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-11-14 05:16:33,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:16:33,838 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-11-14 05:16:33,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:16:33,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:16:33,840 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:16:33,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:16:34,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-14 05:16:34,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:16:34,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:16:34,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1886702627, now seen corresponding path program 2 times [2024-11-14 05:16:34,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:16:34,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877516261] [2024-11-14 05:16:34,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:16:34,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:16:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:16:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 05:16:34,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:16:34,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877516261] [2024-11-14 05:16:34,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877516261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:16:34,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:16:34,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:16:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226271252] [2024-11-14 05:16:34,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:16:34,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:16:34,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:16:34,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:16:34,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:16:34,325 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:16:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:16:34,537 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-11-14 05:16:34,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:16:34,538 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-11-14 05:16:34,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:16:34,539 INFO L225 Difference]: With dead ends: 31 [2024-11-14 05:16:34,539 INFO L226 Difference]: Without dead ends: 24 [2024-11-14 05:16:34,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:16:34,542 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:16:34,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 56 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:16:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-14 05:16:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-14 05:16:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:16:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-14 05:16:34,558 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 24 [2024-11-14 05:16:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:16:34,559 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-14 05:16:34,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:16:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-14 05:16:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 05:16:34,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:16:34,561 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:16:34,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:16:34,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:16:34,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:16:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1009821221, now seen corresponding path program 1 times [2024-11-14 05:16:34,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:16:34,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413477512] [2024-11-14 05:16:34,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:16:34,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:16:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:16:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:16:37,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:16:37,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413477512] [2024-11-14 05:16:37,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413477512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:16:37,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266924494] [2024-11-14 05:16:37,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:16:37,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:16:37,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:16:37,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:16:37,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:16:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:16:37,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-14 05:16:37,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:16:37,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:16:38,351 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:16:38,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:16:38,545 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-14 05:16:38,728 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-14 05:16:38,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2024-11-14 05:16:38,955 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 05:16:38,955 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 31 [2024-11-14 05:16:38,965 INFO L378 Elim1Store]: Elim1 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 7 treesize of output 3 [2024-11-14 05:16:38,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:16:39,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:16:39,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:16:39,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:16:39,430 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:16:39,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2024-11-14 05:16:39,488 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 05:16:39,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-14 05:16:40,281 INFO L349 Elim1Store]: treesize reduction 106, result has 6.2 percent of original size [2024-11-14 05:16:40,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 259 treesize of output 120 [2024-11-14 05:16:40,324 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-14 05:16:40,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2024-11-14 05:16:40,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:16:40,346 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:16:40,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 83 [2024-11-14 05:16:40,367 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-14 05:16:40,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 61 [2024-11-14 05:16:40,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:16:40,709 INFO L349 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2024-11-14 05:16:40,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 47 [2024-11-14 05:16:40,827 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:16:40,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:16:40,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:16:40,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 251 treesize of output 298 [2024-11-14 05:16:41,828 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:16:41,829 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2024-11-14 05:16:41,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:16:41,853 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 26 [2024-11-14 05:16:48,714 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| 0)) (.cse5 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0))) (and (or (forall ((|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int) (v_DerPreprocessor_119 (Array Int Int))) (not (let ((.cse1 (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_119) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (and .cse4 .cse5)) (or (not .cse4) (not .cse5) (let ((.cse21 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) (let ((.cse13 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)) (.cse14 (= (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0))) (and (or (and (forall ((v_DerPreprocessor_121 (Array Int Int)) (v_DerPreprocessor_120 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_120) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_121))) (or (not (= (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_120)) (not (let ((.cse7 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_109))) (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse7 .cse8) (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse8))))))) (forall ((v_DerPreprocessor_122 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (not (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_109))) (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse10 (select (select .cse11 .cse10) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_122) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (not .cse13) (not .cse14)) (or (and .cse13 .cse14) (and (forall ((v_DerPreprocessor_105 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_DerPreprocessor_125 (Array Int Int))) (let ((.cse17 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_633) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse16 (store (store |c_#memory_$Pointer$.base| .cse17 v_DerPreprocessor_105) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store v_DerPreprocessor_105 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse15 (select (select .cse16 .cse15) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_125) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (= .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= .cse17 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (forall ((v_DerPreprocessor_105 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_DerPreprocessor_123 (Array Int Int)) (v_DerPreprocessor_124 (Array Int Int))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_633) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= .cse18 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (let ((.cse20 (store (store |c_#memory_$Pointer$.base| .cse18 v_DerPreprocessor_105) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse19 (select (select .cse20 .cse19) (select (select (store (store |c_#memory_$Pointer$.offset| .cse18 v_DerPreprocessor_123) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_124) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (or (forall ((v_ArrVal_633 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_633) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (let ((.cse22 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (and (or (not .cse22) (forall ((v_DerPreprocessor_134 (Array Int Int)) (v_DerPreprocessor_133 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int)) (v_DerPreprocessor_106 Int) (v_DerPreprocessor_108 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_107) v_DerPreprocessor_106 v_DerPreprocessor_108))) (let ((.cse23 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse26 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse23 v_DerPreprocessor_106)) (not (let ((.cse24 (store .cse26 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse26 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse24 .cse25) (select (select (store (store |c_#memory_$Pointer$.offset| .cse23 v_DerPreprocessor_133) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_134) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse25)))) (= .cse23 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))))) (or (and (forall ((v_DerPreprocessor_127 (Array Int Int)) (v_DerPreprocessor_128 (Array Int Int)) (v_DerPreprocessor_126 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int)) (v_DerPreprocessor_106 Int) (v_DerPreprocessor_108 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_107) v_DerPreprocessor_106 v_DerPreprocessor_108))) (let ((.cse27 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse30 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse27 v_DerPreprocessor_106)) (not (let ((.cse28 (store .cse30 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse30 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse28 .cse29) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_126) .cse27 v_DerPreprocessor_127) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_128) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse29)))) (= .cse27 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (forall ((v_DerPreprocessor_130 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int)) (v_DerPreprocessor_129 (Array Int Int)) (v_DerPreprocessor_106 Int) (v_DerPreprocessor_108 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_107) v_DerPreprocessor_106 v_DerPreprocessor_108))) (let ((.cse34 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse33 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (let ((.cse31 (store .cse33 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse33 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse31 .cse32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_129) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_130) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse32)))) (not (= .cse34 v_DerPreprocessor_106)) (not (= .cse34 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))))) .cse22) (forall ((v_DerPreprocessor_135 (Array Int Int)) (v_DerPreprocessor_107 (Array Int Int)) (v_DerPreprocessor_106 Int) (v_DerPreprocessor_108 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_107) v_DerPreprocessor_106 v_DerPreprocessor_108))) (let ((.cse36 (select .cse39 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse36) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse35 v_DerPreprocessor_106)) (not (= .cse35 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= .cse36 v_DerPreprocessor_107)) (not (let ((.cse38 (store .cse39 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse39 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (let ((.cse37 (select (select .cse38 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse37 (select (select .cse38 .cse37) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))))))))))))))) is different from false [2024-11-14 05:16:52,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266924494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:16:52,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1979540500] [2024-11-14 05:16:52,015 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 05:16:52,016 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:16:52,016 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:16:52,016 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:16:52,016 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:16:53,313 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 05:16:53,331 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:17:01,197 WARN L286 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:17:17,664 WARN L286 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 163 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:17:35,237 WARN L286 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 176 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:17:45,071 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '659#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_65| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_22| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_42| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_21| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_41| Int) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_30| Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_37| Int) (|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_21| Int) (|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_28| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_41| Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_37| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_42| Int) (|v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_41| Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_29| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_41| Int) (|v_#memory_$Pointer$.offset_110| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_21| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_21| Int) (|v_#memory_int_172| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_112| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_22| Int) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (or (and (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_41| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_21|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_37| (store (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_37|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_37| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_37| (store (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_37|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_37| 0)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_28|))) (= (store |v_#memory_int_172| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_37| (store (select |v_#memory_int_172| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_37|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_37| (select (select |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_37|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_37|))) |v_#memory_int_83|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_41| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_41| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_21|) (= (store (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_37| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_37|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_37| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_37| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_37|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_37| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|)) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_30|)) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_int_83| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0)))) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_42| |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.offset_22|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_41| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_21|) (or (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_37| 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_37| 0))) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_42| |v_ULTIMATE.start_sll_circular_insert_#t~mem13#1.base_22|)) (and (= |#memory_int| (store |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29| (store (select |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0)))) (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base_37| 0) (or (and (= (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|)) |v_#memory_$Pointer$.base_65|) (= (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 0)) |v_#memory_$Pointer$.offset_65|) (= |v_#memory_int_84| (store |v_#memory_int_172| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_int_172| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_int_84| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0)))) (= (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0) 0) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_41| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.base_21|) (= (select (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0) 0) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_41| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.offset_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_41| |v_ULTIMATE.start_sll_circular_insert_#t~mem15#1.base_21|) (= |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_41| |v_ULTIMATE.start_sll_circular_insert_#t~mem14#1.offset_21|)) (and (= (store (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) (select (select (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0) (store (select (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) (select (select (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0)) (select (select (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0) |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|)) |v_#memory_$Pointer$.base_65|) (= (store |v_#memory_int_85| (select (select (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0) (store (select |v_#memory_int_85| (select (select (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0)) (select (select (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0) (select (select |v_#memory_int_84| (select (select (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0)) (select (select (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0)))) |v_#memory_int_84|) (= (store (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) (select (select (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0) (store (select (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) (select (select (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0)) (select (select (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0))) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0) 0)) |v_#memory_$Pointer$.offset_65|) (or (not (= (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0) 0)) (not (= (select (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0) 0))) (= (store |v_#memory_int_172| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31| (store (select |v_#memory_int_172| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0 (select (select |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|) 0))) |v_#memory_int_85|))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_65| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29| (store (select |v_#memory_$Pointer$.offset_65| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0 0))) (= (store |v_#memory_$Pointer$.base_65| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29| (store (select |v_#memory_$Pointer$.base_65| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|) 0 |v_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base_31|)) |#memory_$Pointer$.base|) (= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_37| 0))) (<= 2 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_29|))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))))' at error location [2024-11-14 05:17:45,071 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:17:45,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:17:45,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2024-11-14 05:17:45,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172838792] [2024-11-14 05:17:45,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:17:45,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-14 05:17:45,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:17:45,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-14 05:17:45,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3306, Unknown=39, NotChecked=116, Total=3660 [2024-11-14 05:17:45,077 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 41 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 29 states have internal predecessors, (36), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:17:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:17:49,031 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-11-14 05:17:49,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:17:49,034 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 29 states have internal predecessors, (36), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 25 [2024-11-14 05:17:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:17:49,035 INFO L225 Difference]: With dead ends: 37 [2024-11-14 05:17:49,036 INFO L226 Difference]: Without dead ends: 34 [2024-11-14 05:17:49,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 66.0s TimeCoverageRelationStatistics Valid=323, Invalid=4896, Unknown=41, NotChecked=142, Total=5402 [2024-11-14 05:17:49,038 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:17:49,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 186 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 05:17:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-14 05:17:49,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-14 05:17:49,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 05:17:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-14 05:17:49,048 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2024-11-14 05:17:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:17:49,049 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-14 05:17:49,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 29 states have internal predecessors, (36), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:17:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-14 05:17:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 05:17:49,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:17:49,050 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:17:49,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 05:17:49,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:17:49,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:17:49,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:17:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1239729959, now seen corresponding path program 1 times [2024-11-14 05:17:49,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:17:49,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149001963] [2024-11-14 05:17:49,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:17:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:17:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:17:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:17:52,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:17:52,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149001963] [2024-11-14 05:17:52,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149001963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:17:52,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45510084] [2024-11-14 05:17:52,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:17:52,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:17:52,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:17:52,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:17:52,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba34aa59-26f7-4e60-89d0-58337bfe0186/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:17:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:17:53,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-14 05:17:53,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:17:53,639 INFO L378 Elim1Store]: Elim1 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 [2024-11-14 05:17:54,360 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 15 [2024-11-14 05:17:54,367 INFO L378 Elim1Store]: Elim1 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 7 treesize of output 3 [2024-11-14 05:17:54,373 INFO L378 Elim1Store]: Elim1 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 [2024-11-14 05:17:54,639 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-14 05:17:54,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:17:54,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-14 05:17:54,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:17:54,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 26 [2024-11-14 05:17:54,892 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 05:17:54,892 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 15 [2024-11-14 05:17:55,693 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 05:17:55,694 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 91 [2024-11-14 05:17:55,758 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-14 05:17:55,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 143 [2024-11-14 05:17:55,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:17:55,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:17:55,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 22 [2024-11-14 05:17:55,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:17:55,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 43 [2024-11-14 05:17:55,834 INFO L378 Elim1Store]: Elim1 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 34 treesize of output 19 [2024-11-14 05:17:56,173 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:17:56,173 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 42 [2024-11-14 05:17:56,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:17:56,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 05:17:56,731 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:17:56,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:24,351 WARN L286 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 254 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:18:59,003 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 254 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:19:04,410 INFO L349 Elim1Store]: treesize reduction 1755, result has 66.7 percent of original size [2024-11-14 05:19:04,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 5602 treesize of output 8210 [2024-11-14 05:19:04,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:04,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7352 treesize of output 8156 [2024-11-14 05:19:04,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6387 treesize of output 5784 [2024-11-14 05:19:05,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6600 treesize of output 5997 [2024-11-14 05:19:05,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 3 [2024-11-14 05:19:05,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 472 treesize of output 320 [2024-11-14 05:19:09,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 4 [2024-11-14 05:20:46,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 3 [2024-11-14 05:20:48,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:21:03,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 3 [2024-11-14 05:21:11,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 3 [2024-11-14 05:21:12,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 3 [2024-11-14 05:21:16,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 3 [2024-11-14 05:21:20,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 3 [2024-11-14 05:22:10,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:12,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:13,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:18,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:22,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:25,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:31,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:33,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:35,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 3 [2024-11-14 05:22:36,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:37,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:38,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:38,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:40,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 3 [2024-11-14 05:22:40,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:41,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:43,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:43,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:43,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3 [2024-11-14 05:22:45,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 3 [2024-11-14 05:22:46,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 3 [2024-11-14 05:22:46,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 3 [2024-11-14 05:22:46,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 3