./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:35:02,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:35:02,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:35:02,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:35:02,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:35:03,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:35:03,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:35:03,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:35:03,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:35:03,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:35:03,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:35:03,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:35:03,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:35:03,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:35:03,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:35:03,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:35:03,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:35:03,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:35:03,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:35:03,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:35:03,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:35:03,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:35:03,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:35:03,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:35:03,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:35:03,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:35:03,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:35:03,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:35:03,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:35:03,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:35:03,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:35:03,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:35:03,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:35:03,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:35:03,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:35:03,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:35:03,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:35:03,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:35:03,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:35:03,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:35:03,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:35:03,076 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:35:03,120 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:35:03,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:35:03,121 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:35:03,121 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:35:03,122 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:35:03,123 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:35:03,123 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:35:03,123 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:35:03,124 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:35:03,124 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:35:03,125 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:35:03,126 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:35:03,126 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:35:03,126 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:35:03,126 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:35:03,127 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:35:03,127 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:35:03,127 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:35:03,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:35:03,128 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:35:03,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:35:03,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:35:03,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:35:03,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:35:03,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:35:03,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:35:03,130 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:35:03,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:35:03,133 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:35:03,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:35:03,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:35:03,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:35:03,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:35:03,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:35:03,135 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:35:03,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:35:03,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:35:03,136 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:35:03,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:35:03,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:35:03,137 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:35:03,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2022-11-19 07:35:03,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:35:03,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:35:03,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:35:03,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:35:03,519 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:35:03,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-11-19 07:35:03,596 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/data/ba6b88176/dfe86da3eff24ceb96f90780e5da0361/FLAGbe6366b85 [2022-11-19 07:35:04,234 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:35:04,235 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-11-19 07:35:04,260 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/data/ba6b88176/dfe86da3eff24ceb96f90780e5da0361/FLAGbe6366b85 [2022-11-19 07:35:04,484 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/data/ba6b88176/dfe86da3eff24ceb96f90780e5da0361 [2022-11-19 07:35:04,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:35:04,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:35:04,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:35:04,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:35:04,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:35:04,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:04" (1/1) ... [2022-11-19 07:35:04,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240e292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:04, skipping insertion in model container [2022-11-19 07:35:04,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:04" (1/1) ... [2022-11-19 07:35:04,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:35:04,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:35:04,924 WARN L234 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_5d586e1a-13bd-4e7b-b47d-3e253e205991/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2022-11-19 07:35:04,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:35:04,935 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:35:04,981 WARN L234 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_5d586e1a-13bd-4e7b-b47d-3e253e205991/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2022-11-19 07:35:04,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:35:05,007 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:35:05,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:05 WrapperNode [2022-11-19 07:35:05,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:35:05,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:35:05,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:35:05,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:35:05,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:05" (1/1) ... [2022-11-19 07:35:05,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:05" (1/1) ... [2022-11-19 07:35:05,075 INFO L138 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 154 [2022-11-19 07:35:05,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:35:05,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:35:05,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:35:05,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:35:05,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:05" (1/1) ... [2022-11-19 07:35:05,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:05" (1/1) ... [2022-11-19 07:35:05,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:05" (1/1) ... [2022-11-19 07:35:05,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:05" (1/1) ... [2022-11-19 07:35:05,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:05" (1/1) ... [2022-11-19 07:35:05,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:05" (1/1) ... [2022-11-19 07:35:05,146 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:05" (1/1) ... [2022-11-19 07:35:05,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:05" (1/1) ... [2022-11-19 07:35:05,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:35:05,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:35:05,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:35:05,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:35:05,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:05" (1/1) ... [2022-11-19 07:35:05,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:35:05,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:35:05,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:35:05,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:35:05,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 07:35:05,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:35:05,262 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-19 07:35:05,263 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-19 07:35:05,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 07:35:05,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:35:05,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:35:05,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 07:35:05,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 07:35:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:35:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-19 07:35:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:35:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:35:05,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:35:05,407 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:35:05,409 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:35:05,870 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:35:06,088 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:35:06,088 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-19 07:35:06,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:06 BoogieIcfgContainer [2022-11-19 07:35:06,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:35:06,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:35:06,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:35:06,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:35:06,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:35:04" (1/3) ... [2022-11-19 07:35:06,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ffb3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:06, skipping insertion in model container [2022-11-19 07:35:06,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:05" (2/3) ... [2022-11-19 07:35:06,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ffb3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:06, skipping insertion in model container [2022-11-19 07:35:06,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:06" (3/3) ... [2022-11-19 07:35:06,108 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2022-11-19 07:35:06,134 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:35:06,135 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 07:35:06,209 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:35:06,220 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e8956b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:35:06,220 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 07:35:06,227 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) [2022-11-19 07:35:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:35:06,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:06,237 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:06,238 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:35:06,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:06,248 INFO L85 PathProgramCache]: Analyzing trace with hash 647624886, now seen corresponding path program 1 times [2022-11-19 07:35:06,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:06,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796871131] [2022-11-19 07:35:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:35:07,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:07,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796871131] [2022-11-19 07:35:07,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796871131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:07,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:07,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:35:07,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923250309] [2022-11-19 07:35:07,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:07,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:35:07,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:07,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:35:07,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:35:07,069 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:35:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:07,236 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2022-11-19 07:35:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:35:07,245 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2022-11-19 07:35:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:07,253 INFO L225 Difference]: With dead ends: 32 [2022-11-19 07:35:07,253 INFO L226 Difference]: Without dead ends: 18 [2022-11-19 07:35:07,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:35:07,261 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:07,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:35:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-19 07:35:07,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-19 07:35:07,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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) [2022-11-19 07:35:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-11-19 07:35:07,304 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 16 [2022-11-19 07:35:07,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:07,305 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-11-19 07:35:07,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:35:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-11-19 07:35:07,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:35:07,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:07,307 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:07,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:35:07,308 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:35:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash 647610967, now seen corresponding path program 1 times [2022-11-19 07:35:07,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:07,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27541322] [2022-11-19 07:35:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:07,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:35:07,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:07,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27541322] [2022-11-19 07:35:07,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27541322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:07,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:07,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:35:07,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266349269] [2022-11-19 07:35:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:07,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:35:07,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:07,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:35:07,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:35:07,901 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. 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) [2022-11-19 07:35:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:08,748 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-11-19 07:35:08,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:35:08,749 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 [2022-11-19 07:35:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:08,750 INFO L225 Difference]: With dead ends: 31 [2022-11-19 07:35:08,750 INFO L226 Difference]: Without dead ends: 19 [2022-11-19 07:35:08,751 INFO L412 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 [2022-11-19 07:35:08,752 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:08,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-19 07:35:08,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-19 07:35:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-19 07:35:08,759 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) [2022-11-19 07:35:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-11-19 07:35:08,761 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 16 [2022-11-19 07:35:08,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:08,761 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-19 07:35:08,762 INFO L496 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) [2022-11-19 07:35:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-11-19 07:35:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:35:08,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:08,763 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:08,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:35:08,764 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:35:08,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:08,765 INFO L85 PathProgramCache]: Analyzing trace with hash -687658553, now seen corresponding path program 1 times [2022-11-19 07:35:08,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:08,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848597917] [2022-11-19 07:35:08,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-19 07:35:09,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:09,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848597917] [2022-11-19 07:35:09,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848597917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:09,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:09,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:35:09,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019161931] [2022-11-19 07:35:09,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:09,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:35:09,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:09,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:35:09,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:35:09,583 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) [2022-11-19 07:35:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:10,214 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-11-19 07:35:10,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:35:10,215 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 [2022-11-19 07:35:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:10,216 INFO L225 Difference]: With dead ends: 26 [2022-11-19 07:35:10,216 INFO L226 Difference]: Without dead ends: 20 [2022-11-19 07:35:10,216 INFO L412 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 [2022-11-19 07:35:10,218 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:10,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-19 07:35:10,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-19 07:35:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-19 07:35:10,227 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) [2022-11-19 07:35:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-11-19 07:35:10,231 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 22 [2022-11-19 07:35:10,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:10,233 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-11-19 07:35:10,234 INFO L496 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) [2022-11-19 07:35:10,234 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-11-19 07:35:10,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:35:10,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:10,238 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:10,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:35:10,239 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:35:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash 67418736, now seen corresponding path program 1 times [2022-11-19 07:35:10,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:10,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136764358] [2022-11-19 07:35:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:10,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:35:31,670 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:31,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136764358] [2022-11-19 07:35:31,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136764358] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:35:31,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298537065] [2022-11-19 07:35:31,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:31,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:35:31,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:35:31,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:35:31,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d586e1a-13bd-4e7b-b47d-3e253e205991/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:35:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:33,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 182 conjunts are in the unsatisfiable core [2022-11-19 07:35:33,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:35:33,952 INFO L350 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 [2022-11-19 07:35:34,295 INFO L350 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 [2022-11-19 07:35:34,394 INFO L350 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 13 treesize of output 9 [2022-11-19 07:35:34,554 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:35:34,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 07:35:34,726 INFO L350 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 22 treesize of output 24 [2022-11-19 07:35:34,734 INFO L350 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 14 treesize of output 16 [2022-11-19 07:35:34,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 14 treesize of output 14 [2022-11-19 07:35:34,764 INFO L350 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 14 treesize of output 16 [2022-11-19 07:35:35,007 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-19 07:35:35,007 INFO L350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 84 [2022-11-19 07:35:35,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:35,037 INFO L350 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 42 treesize of output 31 [2022-11-19 07:35:35,046 INFO L350 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 18 treesize of output 26 [2022-11-19 07:35:35,211 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-19 07:35:35,211 INFO L350 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 109 treesize of output 47 [2022-11-19 07:35:35,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:35:35,232 INFO L350 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 [2022-11-19 07:35:35,239 INFO L350 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 [2022-11-19 07:35:35,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:35,488 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-19 07:35:35,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 117 treesize of output 95 [2022-11-19 07:35:35,528 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-19 07:35:35,529 INFO L350 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 [2022-11-19 07:35:35,556 INFO L350 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 18 treesize of output 20 [2022-11-19 07:35:35,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:35,587 INFO L350 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 14 treesize of output 16 [2022-11-19 07:35:36,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:36,647 INFO L321 Elim1Store]: treesize reduction 41, result has 6.8 percent of original size [2022-11-19 07:35:36,648 INFO L350 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 131 [2022-11-19 07:35:36,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:36,673 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2022-11-19 07:35:36,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:36,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:36,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:36,702 INFO L350 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 [2022-11-19 07:35:36,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 07:35:36,735 INFO L350 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 48 treesize of output 46 [2022-11-19 07:35:36,745 INFO L350 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 46 treesize of output 42 [2022-11-19 07:35:36,833 INFO L350 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 15 treesize of output 7 [2022-11-19 07:35:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:35:36,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:35:48,303 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse2 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| 0))) (and (forall ((|v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| Int) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2584 Int) (v_ArrVal_2543 (Array Int Int)) (v_ArrVal_2553 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2580 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse0 |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| v_ArrVal_2584)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2594) .cse1 v_ArrVal_2561) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2558) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2553) .cse1 v_ArrVal_2543) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2542) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2595) .cse1 v_ArrVal_2580) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|) (not (<= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| 0))) (or .cse2 (forall ((|v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| Int) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2584 Int) (v_ArrVal_2543 (Array Int Int)) (v_ArrVal_2553 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2580 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse0 |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| v_ArrVal_2584)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2594) .cse1 v_ArrVal_2561) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2558) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2553) .cse1 v_ArrVal_2543) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2542) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2595) .cse1 v_ArrVal_2580) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|) (not (<= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))))) (or (not .cse2) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0)) (.cse4 (= .cse6 0))) (and (or (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2566 (Array Int Int)) (v_ArrVal_2598 (Array Int Int)) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2581 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2573) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2592) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2598) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2566) |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_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2581) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2548) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) (not .cse3) (not .cse4)) (or (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2546 (Array Int Int)) (v_ArrVal_2545 (Array Int Int)) (v_ArrVal_2600 (Array Int Int)) (v_ArrVal_2567 (Array Int Int)) (v_ArrVal_2566 (Array Int Int)) (v_ArrVal_2544 (Array Int Int)) (v_ArrVal_2565 (Array Int Int)) (v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2562 (Array Int Int)) (v_ArrVal_2583 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2578 (Array Int Int)) (v_ArrVal_2555 (Array Int Int)) (v_ArrVal_2576 (Array Int Int)) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2597 (Array Int Int)) (v_ArrVal_2575 (Array Int Int)) (v_ArrVal_2574 (Array Int Int)) (v_ArrVal_2593 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2576) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2544) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2562) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2574) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2565) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2546) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2578) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2592) (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (let ((.cse5 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse6))) (store .cse5 (+ 4 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse5) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2545) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2597) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2583) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2579) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2560) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2600) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2566) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2567) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2563) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2593) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2591) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2575) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2555) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2554) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2548) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) (and .cse3 .cse4))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))))) is different from false [2022-11-19 07:35:48,467 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse0 (= .cse3 0)) (.cse5 (select |c_#memory_int| .cse3)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))) (and (or (not .cse0) (let ((.cse1 (= .cse4 0))) (and (or (not .cse1) (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2566 (Array Int Int)) (v_ArrVal_2598 (Array Int Int)) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2581 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2573) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2592) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2598) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2566) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2581) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2548) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (or (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2546 (Array Int Int)) (v_ArrVal_2545 (Array Int Int)) (v_ArrVal_2600 (Array Int Int)) (v_ArrVal_2567 (Array Int Int)) (v_ArrVal_2566 (Array Int Int)) (v_ArrVal_2544 (Array Int Int)) (v_ArrVal_2565 (Array Int Int)) (v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2562 (Array Int Int)) (v_ArrVal_2583 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2578 (Array Int Int)) (v_ArrVal_2555 (Array Int Int)) (v_ArrVal_2576 (Array Int Int)) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2597 (Array Int Int)) (v_ArrVal_2575 (Array Int Int)) (v_ArrVal_2574 (Array Int Int)) (v_ArrVal_2593 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2576) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2544) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2562) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2574) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2565) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2546) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2578) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2592) (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse3))) (store .cse2 (+ 4 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| .cse2) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2545) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2597) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2583) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2579) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2560) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2600) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2566) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2567) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2563) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2593) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2591) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2575) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2555) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2554) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2548) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) .cse1))) (not (<= 0 .cse4))) (forall ((|v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| Int) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2584 Int) (v_ArrVal_2543 (Array Int Int)) (v_ArrVal_2553 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2580 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse3 (store .cse5 |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| v_ArrVal_2584)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2594) .cse6 v_ArrVal_2561) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2558) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2553) .cse6 v_ArrVal_2543) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_2542) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2595) .cse6 v_ArrVal_2580) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| 0))) (or .cse0 (forall ((|v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| Int) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2584 Int) (v_ArrVal_2543 (Array Int Int)) (v_ArrVal_2553 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2580 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse3 (store .cse5 |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| v_ArrVal_2584)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2594) .cse6 v_ArrVal_2561) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2558) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2553) .cse6 v_ArrVal_2543) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_2542) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2595) .cse6 v_ArrVal_2580) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2022-11-19 07:35:50,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298537065] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:35:50,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [233258349] [2022-11-19 07:35:50,581 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-19 07:35:50,581 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:35:50,586 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:35:50,593 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:35:50,593 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:35:50,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:50,676 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:35:50,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-19 07:35:50,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:50,712 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:35:50,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-19 07:35:50,756 INFO L350 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 [2022-11-19 07:35:50,762 INFO L350 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 12 treesize of output 9 [2022-11-19 07:35:50,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:50,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:50,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-19 07:35:50,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:50,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:50,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-19 07:35:50,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:50,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:50,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-19 07:35:50,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:50,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:35:50,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:50,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:35:50,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:50,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:35:50,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:50,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:35:51,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:35:51,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:35:51,119 INFO L350 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 [2022-11-19 07:35:51,132 INFO L350 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 [2022-11-19 07:35:51,145 INFO L350 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 [2022-11-19 07:35:51,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:35:51,253 INFO L350 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 [2022-11-19 07:35:51,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:35:51,279 INFO L350 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 [2022-11-19 07:35:51,293 INFO L350 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 [2022-11-19 07:35:51,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:51,356 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:35:51,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2022-11-19 07:35:51,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:51,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:51,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-19 07:35:51,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:51,414 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 07:35:51,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-19 07:35:51,487 INFO L350 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 [2022-11-19 07:35:51,499 INFO L350 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 [2022-11-19 07:35:51,510 INFO L350 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 [2022-11-19 07:35:51,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:35:51,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:35:51,592 INFO L350 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 [2022-11-19 07:35:51,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:35:51,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:35:51,637 INFO L350 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 [2022-11-19 07:35:51,649 INFO L350 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 [2022-11-19 07:35:51,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:35:51,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:51,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 237 [2022-11-19 07:35:51,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:51,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:35:51,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:35:51,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:51,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:35:51,884 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-19 07:35:51,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 360 treesize of output 371 [2022-11-19 07:35:51,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:51,910 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:35:51,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:51,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:35:51,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:35:51,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:35:51,938 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-19 07:35:51,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 372 treesize of output 257 [2022-11-19 07:35:51,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:51,985 INFO L350 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 49 treesize of output 13 [2022-11-19 07:35:52,035 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-19 07:35:52,036 INFO L350 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 2 case distinctions, treesize of input 53 treesize of output 30 [2022-11-19 07:35:52,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:52,068 INFO L350 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 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-19 07:35:52,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:35:52,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:52,175 INFO L350 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 29 treesize of output 17 [2022-11-19 07:35:52,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:52,205 INFO L350 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 29 treesize of output 17 [2022-11-19 07:35:52,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:52,234 INFO L350 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 35 treesize of output 7 [2022-11-19 07:35:52,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:52,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:52,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:35:52,433 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:35:52,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-19 07:35:52,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:52,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:52,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:35:52,469 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:35:52,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-19 07:35:52,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:52,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:52,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:35:52,584 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:35:52,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-19 07:35:52,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:52,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:52,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:35:52,621 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:35:52,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-19 07:35:53,001 INFO L321 Elim1Store]: treesize reduction 141, result has 22.1 percent of original size [2022-11-19 07:35:53,002 INFO L350 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 3 case distinctions, treesize of input 71 treesize of output 49 [2022-11-19 07:35:53,158 INFO L321 Elim1Store]: treesize reduction 122, result has 32.6 percent of original size [2022-11-19 07:35:53,158 INFO L350 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 3 case distinctions, treesize of input 71 treesize of output 68 [2022-11-19 07:35:53,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:35:53,266 INFO L321 Elim1Store]: treesize reduction 46, result has 34.3 percent of original size [2022-11-19 07:35:53,266 INFO L350 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 1 case distinctions, treesize of input 36 treesize of output 34 [2022-11-19 07:35:53,326 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-19 07:35:53,326 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2022-11-19 07:35:53,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:35:53,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:36:14,022 WARN L233 SmtUtils]: Spent 20.65s on a formula simplification. DAG size of input: 111 DAG size of output: 62 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-19 07:36:14,023 INFO L321 Elim1Store]: treesize reduction 1072, result has 19.0 percent of original size [2022-11-19 07:36:14,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 2277 treesize of output 2059 [2022-11-19 07:36:14,101 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 1718 treesize of output 1725 [2022-11-19 07:36:14,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:36:14,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:36:32,316 WARN L233 SmtUtils]: Spent 18.13s on a formula simplification. DAG size of input: 145 DAG size of output: 78 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-19 07:36:32,317 INFO L321 Elim1Store]: treesize reduction 773, result has 20.5 percent of original size [2022-11-19 07:36:32,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 1286 treesize of output 1323 [2022-11-19 07:36:32,784 INFO L350 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 11 treesize of output 7 [2022-11-19 07:36:32,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 499 treesize of output 499 [2022-11-19 07:36:33,224 INFO L350 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 16 treesize of output 15 [2022-11-19 07:36:33,367 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2022-11-19 07:36:33,412 INFO L350 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 13 treesize of output 9 [2022-11-19 07:36:33,493 INFO L350 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 11 treesize of output 7 [2022-11-19 07:36:33,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:36:34,053 INFO L350 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 99 treesize of output 15 [2022-11-19 07:36:34,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:36:34,548 INFO L321 Elim1Store]: treesize reduction 84, result has 33.3 percent of original size [2022-11-19 07:36:34,549 INFO L350 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 1 case distinctions, treesize of input 66 treesize of output 58 [2022-11-19 07:36:34,607 INFO L350 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 15 treesize of output 1 [2022-11-19 07:39:46,187 WARN L233 SmtUtils]: Spent 3.18m on a formula simplification. DAG size of input: 208 DAG size of output: 95 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-19 07:39:46,203 INFO L321 Elim1Store]: treesize reduction 872, result has 24.4 percent of original size [2022-11-19 07:39:46,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 18 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 15 new quantified variables, introduced 64 case distinctions, treesize of input 1168996871 treesize of output 1163155704