./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9 --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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- 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-6b4ec56 [2022-11-20 20:40:21,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:40:21,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:40:21,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:40:21,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:40:21,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:40:21,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:40:21,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:40:21,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:40:21,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:40:21,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:40:21,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:40:21,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:40:21,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:40:21,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:40:21,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:40:21,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:40:21,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:40:21,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:40:21,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:40:21,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:40:21,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:40:21,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:40:21,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:40:21,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:40:21,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:40:21,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:40:21,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:40:21,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:40:21,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:40:21,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:40:21,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:40:21,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:40:21,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:40:21,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:40:21,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:40:21,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:40:21,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:40:21,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:40:21,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:40:21,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:40:21,445 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 20:40:21,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:40:21,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:40:21,471 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:40:21,471 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:40:21,472 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:40:21,472 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:40:21,473 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:40:21,473 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:40:21,473 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:40:21,474 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:40:21,474 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:40:21,474 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:40:21,474 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:40:21,475 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:40:21,475 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:40:21,475 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:40:21,476 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:40:21,476 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:40:21,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:40:21,477 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:40:21,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:40:21,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:40:21,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:40:21,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 20:40:21,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:40:21,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 20:40:21,479 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:40:21,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 20:40:21,480 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:40:21,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 20:40:21,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:40:21,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:40:21,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:40:21,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:40:21,481 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:40:21,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:40:21,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 20:40:21,481 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:40:21,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:40:21,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 20:40:21,482 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:40:21,482 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_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/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_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2022-11-20 20:40:21,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:40:21,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:40:21,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:40:21,832 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:40:21,833 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:40:21,834 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-11-20 20:40:25,020 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:40:25,298 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:40:25,311 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-11-20 20:40:25,329 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/data/ea03970fd/1c773045b59c4a31b6a99fc454b66724/FLAGb3e862928 [2022-11-20 20:40:25,344 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/data/ea03970fd/1c773045b59c4a31b6a99fc454b66724 [2022-11-20 20:40:25,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:40:25,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:40:25,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:40:25,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:40:25,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:40:25,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:40:25" (1/1) ... [2022-11-20 20:40:25,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ab464f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:40:25, skipping insertion in model container [2022-11-20 20:40:25,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:40:25" (1/1) ... [2022-11-20 20:40:25,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:40:25,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:40:25,740 WARN L237 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_6d523fb2-9ac8-4801-8641-d61c7fed3c98/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2022-11-20 20:40:25,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:40:25,759 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:40:25,802 WARN L237 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_6d523fb2-9ac8-4801-8641-d61c7fed3c98/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2022-11-20 20:40:25,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:40:25,831 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:40:25,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:40:25 WrapperNode [2022-11-20 20:40:25,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:40:25,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:40:25,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:40:25,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:40:25,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:40:25" (1/1) ... [2022-11-20 20:40:25,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:40:25" (1/1) ... [2022-11-20 20:40:25,904 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 185 [2022-11-20 20:40:25,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:40:25,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:40:25,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:40:25,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:40:25,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:40:25" (1/1) ... [2022-11-20 20:40:25,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:40:25" (1/1) ... [2022-11-20 20:40:25,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:40:25" (1/1) ... [2022-11-20 20:40:25,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:40:25" (1/1) ... [2022-11-20 20:40:25,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:40:25" (1/1) ... [2022-11-20 20:40:25,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:40:25" (1/1) ... [2022-11-20 20:40:25,961 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:40:25" (1/1) ... [2022-11-20 20:40:25,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:40:25" (1/1) ... [2022-11-20 20:40:25,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:40:25,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:40:25,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:40:25,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:40:25,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:40:25" (1/1) ... [2022-11-20 20:40:25,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:40:25,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:40:26,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:40:26,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:40:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 20:40:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 20:40:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 20:40:26,055 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 20:40:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 20:40:26,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:40:26,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 20:40:26,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 20:40:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 20:40:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:40:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 20:40:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:40:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:40:26,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:40:26,272 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:40:26,274 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:40:26,658 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:40:26,784 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:40:26,784 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-20 20:40:26,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:40:26 BoogieIcfgContainer [2022-11-20 20:40:26,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:40:26,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:40:26,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:40:26,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:40:26,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:40:25" (1/3) ... [2022-11-20 20:40:26,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c86b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:40:26, skipping insertion in model container [2022-11-20 20:40:26,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:40:25" (2/3) ... [2022-11-20 20:40:26,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c86b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:40:26, skipping insertion in model container [2022-11-20 20:40:26,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:40:26" (3/3) ... [2022-11-20 20:40:26,796 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2022-11-20 20:40:26,816 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:40:26,816 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 20:40:26,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:40:26,869 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;@428e4f68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:40:26,870 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 20:40:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 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-20 20:40:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 20:40:26,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:40:26,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:40:26,890 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:40:26,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:40:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash -170983099, now seen corresponding path program 1 times [2022-11-20 20:40:26,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:40:26,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405339197] [2022-11-20 20:40:26,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:40:26,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:40:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:40:27,762 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-20 20:40:27,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:40:27,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405339197] [2022-11-20 20:40:27,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405339197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:40:27,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:40:27,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:40:27,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413851013] [2022-11-20 20:40:27,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:40:27,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:40:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:40:27,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:40:27,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:40:27,826 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:40:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:40:28,271 INFO L93 Difference]: Finished difference Result 53 states and 79 transitions. [2022-11-20 20:40:28,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:40:28,274 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-20 20:40:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:40:28,281 INFO L225 Difference]: With dead ends: 53 [2022-11-20 20:40:28,282 INFO L226 Difference]: Without dead ends: 24 [2022-11-20 20:40:28,285 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-20 20:40:28,288 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:40:28,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:40:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-20 20:40:28,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-20 20:40:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-20 20:40:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-11-20 20:40:28,326 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2022-11-20 20:40:28,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:40:28,327 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-11-20 20:40:28,327 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-20 20:40:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-11-20 20:40:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 20:40:28,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:40:28,329 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-20 20:40:28,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:40:28,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:40:28,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:40:28,331 INFO L85 PathProgramCache]: Analyzing trace with hash 299889229, now seen corresponding path program 1 times [2022-11-20 20:40:28,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:40:28,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341285346] [2022-11-20 20:40:28,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:40:28,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:40:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:40:29,094 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-20 20:40:29,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:40:29,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341285346] [2022-11-20 20:40:29,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341285346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:40:29,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:40:29,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:40:29,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286129529] [2022-11-20 20:40:29,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:40:29,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:40:29,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:40:29,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:40:29,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:40:29,102 INFO L87 Difference]: Start difference. First operand 24 states and 32 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-20 20:40:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:40:29,306 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2022-11-20 20:40:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:40:29,307 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-20 20:40:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:40:29,308 INFO L225 Difference]: With dead ends: 36 [2022-11-20 20:40:29,309 INFO L226 Difference]: Without dead ends: 25 [2022-11-20 20:40:29,309 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-20 20:40:29,310 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:40:29,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 46 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:40:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-20 20:40:29,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-20 20:40:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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-20 20:40:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-11-20 20:40:29,321 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 22 [2022-11-20 20:40:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:40:29,321 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-11-20 20:40:29,322 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-20 20:40:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-11-20 20:40:29,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 20:40:29,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:40:29,324 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-20 20:40:29,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:40:29,325 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:40:29,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:40:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash 593391176, now seen corresponding path program 1 times [2022-11-20 20:40:29,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:40:29,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769721086] [2022-11-20 20:40:29,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:40:29,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:40:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:40:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:40:54,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:40:54,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769721086] [2022-11-20 20:40:54,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769721086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:40:54,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048436975] [2022-11-20 20:40:54,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:40:54,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:40:54,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:40:54,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:40:54,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d523fb2-9ac8-4801-8641-d61c7fed3c98/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 20:40:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:40:56,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 194 conjunts are in the unsatisfiable core [2022-11-20 20:40:56,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:40:56,418 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-20 20:40:56,763 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-20 20:40:56,914 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-20 20:40:57,079 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:40:57,080 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-20 20:40:57,272 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-20 20:40:57,278 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-20 20:40:57,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:40:57,312 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 24 treesize of output 26 [2022-11-20 20:40:57,325 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 16 treesize of output 18 [2022-11-20 20:40:57,548 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-20 20:40:57,548 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 2 case distinctions, treesize of input 169 treesize of output 82 [2022-11-20 20:40:57,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:40:57,564 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-20 20:40:57,570 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-20 20:40:57,794 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-20 20:40:57,794 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 107 treesize of output 45 [2022-11-20 20:40:57,804 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-20 20:40:57,812 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-20 20:40:57,818 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-20 20:40:58,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:40:58,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 20:40:58,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:40:58,072 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 20:40:58,073 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-20 20:40:58,101 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 20:40:58,102 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-20 20:40:58,128 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-20 20:40:59,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:40:59,268 INFO L321 Elim1Store]: treesize reduction 57, result has 5.0 percent of original size [2022-11-20 20:40:59,269 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-20 20:40:59,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:40:59,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:40:59,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:40:59,299 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 22 treesize of output 10 [2022-11-20 20:40:59,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:40:59,326 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-20 20:40:59,344 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-20 20:40:59,355 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-20 20:40:59,366 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-20 20:40:59,473 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-20 20:40:59,545 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-20 20:40:59,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:41:00,271 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0)) (.cse1 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0))) (and (or (and .cse0 .cse1) (forall ((v_ArrVal_2093 (Array Int Int)) (v_ArrVal_2091 (Array Int Int)) (v_ArrVal_2129 (Array Int Int)) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2083 Int) (v_ArrVal_2074 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_2083)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2074) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2091) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2115) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2093) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2067) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2129) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (or (let ((.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 ((.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|) 0)) (.cse5 (= .cse3 0))) (and (or (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2119 (Array Int Int)) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2107 (Array Int Int)) (v_ArrVal_2104 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_ArrVal_2125 (Array Int Int)) (v_ArrVal_2124 (Array Int Int)) (v_ArrVal_2123 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2078 (Array Int Int)) (v_ArrVal_2089 (Array Int Int)) (v_ArrVal_2111 (Array Int Int)) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2120 (Array Int Int)) (v_ArrVal_2065 (Array Int Int)) (v_ArrVal_2064 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2095 (Array Int Int)) (v_ArrVal_2062 (Array Int Int)) (v_ArrVal_2073 (Array Int Int)) (v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2092 (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_2075) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2098) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2123) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2062) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2124) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2109) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2101) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2089) (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse3))) (store .cse2 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#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_~new_node~0#1.base| v_ArrVal_2095) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2072) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2064) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2125) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2104) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2078) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2119) |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_2120) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2107) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2073) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2065) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2126) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2111) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2108) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) (and .cse4 .cse5)) (or (not .cse4) (not .cse5) (forall ((v_ArrVal_2119 (Array Int Int)) (v_ArrVal_2092 (Array Int Int)) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2089 (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_2080) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2089) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2103) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2119) |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_2068) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))))) (not .cse0) (not .cse1)))) is different from false [2022-11-20 20:41:00,450 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_ArrVal_2093 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| Int) (v_ArrVal_2091 (Array Int Int)) (v_ArrVal_2129 (Array Int Int)) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2083 Int) (v_ArrVal_2074 (Array Int Int))) (or (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) (= |c_ULTIMATE.start_main_~data~0#1| (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_2083)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2074) .cse1 v_ArrVal_2091) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2115) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2102) .cse1 v_ArrVal_2093) |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_2067) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2129) .cse1 v_ArrVal_2118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (or .cse2 (forall ((v_ArrVal_2093 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| Int) (v_ArrVal_2091 (Array Int Int)) (v_ArrVal_2129 (Array Int Int)) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2083 Int) (v_ArrVal_2074 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (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_2083)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2074) .cse1 v_ArrVal_2091) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2115) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2102) .cse1 v_ArrVal_2093) |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_2067) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2129) .cse1 v_ArrVal_2118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (let ((.cse4 (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 ((.cse5 (= (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)) (.cse6 (= .cse4 0))) (and (or (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2119 (Array Int Int)) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2107 (Array Int Int)) (v_ArrVal_2104 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_ArrVal_2125 (Array Int Int)) (v_ArrVal_2124 (Array Int Int)) (v_ArrVal_2123 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2078 (Array Int Int)) (v_ArrVal_2089 (Array Int Int)) (v_ArrVal_2111 (Array Int Int)) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2120 (Array Int Int)) (v_ArrVal_2065 (Array Int Int)) (v_ArrVal_2064 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2095 (Array Int Int)) (v_ArrVal_2062 (Array Int Int)) (v_ArrVal_2073 (Array Int Int)) (v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2092 (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_2075) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2098) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2123) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2062) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2124) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2109) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2101) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2089) (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse4))) (store .cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse3) |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_2095) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2072) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2064) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2125) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2104) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2078) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2119) |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_2120) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2107) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2073) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2065) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2126) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2111) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2108) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) (and .cse5 .cse6)) (or (not .cse5) (not .cse6) (forall ((v_ArrVal_2119 (Array Int Int)) (v_ArrVal_2092 (Array Int Int)) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2089 (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_2080) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2089) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2103) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2119) |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_2068) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))))) (not .cse2) (not (<= 0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))))) is different from false [2022-11-20 20:41:00,592 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (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 ((.cse2 (select |c_#memory_int| .cse1)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse0)) (.cse4 (= .cse1 0))) (and (or (forall ((v_ArrVal_2093 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| Int) (v_ArrVal_2091 (Array Int Int)) (v_ArrVal_2129 (Array Int Int)) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2083 Int) (v_ArrVal_2074 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse1 (store .cse2 |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| v_ArrVal_2083)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2074) .cse3 v_ArrVal_2091) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2115) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2102) .cse3 v_ArrVal_2093) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2067) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2129) .cse3 v_ArrVal_2118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) .cse4) (forall ((v_ArrVal_2093 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| Int) (v_ArrVal_2091 (Array Int Int)) (v_ArrVal_2129 (Array Int Int)) (v_ArrVal_2118 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2083 Int) (v_ArrVal_2074 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| .cse1 (store .cse2 |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| v_ArrVal_2083)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2074) .cse3 v_ArrVal_2091) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2115) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2102) .cse3 v_ArrVal_2093) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2067) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2129) .cse3 v_ArrVal_2118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (= |v_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset_16| 0))) (or (let ((.cse5 (= .cse0 0))) (and (or (not .cse5) (forall ((v_ArrVal_2119 (Array Int Int)) (v_ArrVal_2092 (Array Int Int)) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2089 (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_2080) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2089) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2103) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2119) |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_#t~ret9#1.base| v_ArrVal_2068) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (or (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2119 (Array Int Int)) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2107 (Array Int Int)) (v_ArrVal_2104 (Array Int Int)) (v_ArrVal_2126 (Array Int Int)) (v_ArrVal_2125 (Array Int Int)) (v_ArrVal_2124 (Array Int Int)) (v_ArrVal_2123 (Array Int Int)) (v_ArrVal_2101 (Array Int Int)) (v_ArrVal_2078 (Array Int Int)) (v_ArrVal_2089 (Array Int Int)) (v_ArrVal_2111 (Array Int Int)) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2120 (Array Int Int)) (v_ArrVal_2065 (Array Int Int)) (v_ArrVal_2064 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2095 (Array Int Int)) (v_ArrVal_2062 (Array Int Int)) (v_ArrVal_2073 (Array Int Int)) (v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2092 (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_2075) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2098) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2123) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2062) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2124) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2109) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2101) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2089) (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (let ((.cse6 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| .cse1))) (store .cse6 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| .cse6) |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_2095) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2072) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2064) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2125) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2104) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2078) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2119) |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_2120) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2107) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2073) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2065) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2126) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2111) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) v_ArrVal_2108) |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) .cse5))) (not .cse4) (not (<= 0 .cse0)))))) is different from false [2022-11-20 20:41:02,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048436975] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:41:02,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1669675543] [2022-11-20 20:41:02,094 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-20 20:41:02,095 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:41:02,098 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:41:02,104 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:41:02,105 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:41:02,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,166 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:41:02,167 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-20 20:41:02,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:41:02,207 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-20 20:41:02,212 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-20 20:41:02,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,234 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-20 20:41:02,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,244 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-20 20:41:02,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,254 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-20 20:41:02,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,278 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-20 20:41:02,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,290 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-20 20:41:02,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,345 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-20 20:41:02,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,360 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-20 20:41:02,486 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-20 20:41:02,498 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-20 20:41:02,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-20 20:41:02,520 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-20 20:41:02,530 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-20 20:41:02,590 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-20 20:41:02,600 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-20 20:41:02,610 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-20 20:41:02,626 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-20 20:41:02,638 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-20 20:41:02,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,708 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:41:02,709 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-20 20:41:02,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,737 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:41:02,738 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-20 20:41:02,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:02,762 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-20 20:41:02,817 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-20 20:41:02,831 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-20 20:41:02,844 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-20 20:41:02,858 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-20 20:41:02,868 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-20 20:41:02,920 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-20 20:41:02,933 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-20 20:41:02,947 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-20 20:41:02,958 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-20 20:41:02,969 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-20 20:41:03,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:03,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,105 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-20 20:41:03,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:03,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:03,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:03,157 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 20:41:03,157 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-20 20:41:03,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:03,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:03,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:03,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:03,203 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-20 20:41:03,204 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 262 [2022-11-20 20:41:03,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,239 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-20 20:41:03,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,358 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-20 20:41:03,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:03,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,379 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-20 20:41:03,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,401 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-20 20:41:03,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:03,660 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:41:03,660 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-20 20:41:03,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:03,718 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:41:03,718 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-20 20:41:03,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:03,888 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:41:03,888 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-20 20:41:03,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:03,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:03,926 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:41:03,927 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-20 20:41:04,324 INFO L321 Elim1Store]: treesize reduction 122, result has 32.6 percent of original size [2022-11-20 20:41:04,324 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-20 20:41:04,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:04,453 INFO L321 Elim1Store]: treesize reduction 141, result has 22.1 percent of original size [2022-11-20 20:41:04,453 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-20 20:41:04,520 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-20 20:41:04,521 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 1 case distinctions, treesize of input 35 treesize of output 17 [2022-11-20 20:41:04,572 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-20 20:41:04,573 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 33 treesize of output 29 [2022-11-20 20:41:04,619 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-20 20:41:04,620 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 35 treesize of output 29 [2022-11-20 20:41:04,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:04,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:16,672 WARN L233 SmtUtils]: Spent 12.01s 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-20 20:41:16,673 INFO L321 Elim1Store]: treesize reduction 1072, result has 19.0 percent of original size [2022-11-20 20:41:16,673 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 2049 [2022-11-20 20:41:16,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:16,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:41:29,404 WARN L233 SmtUtils]: Spent 12.64s 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-20 20:41:29,404 INFO L321 Elim1Store]: treesize reduction 855, result has 20.1 percent of original size [2022-11-20 20:41:29,405 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 1422 treesize of output 1524 [2022-11-20 20:41:29,567 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 589 treesize of output 596 [2022-11-20 20:41:30,061 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-20 20:41:30,214 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2022-11-20 20:41:30,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:30,400 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 107 treesize of output 17 [2022-11-20 20:41:30,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:41:31,166 INFO L321 Elim1Store]: treesize reduction 92, result has 33.3 percent of original size [2022-11-20 20:41:31,167 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 72 treesize of output 64 [2022-11-20 20:41:31,321 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 18 treesize of output 15 [2022-11-20 20:41:31,393 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 9 treesize of output 5 [2022-11-20 20:41:34,040 INFO L321 Elim1Store]: treesize reduction 364, result has 16.3 percent of original size [2022-11-20 20:41:34,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 468 treesize of output 1036 [2022-11-20 20:42:00,941 WARN L233 SmtUtils]: Spent 26.78s on a formula simplification. DAG size of input: 231 DAG size of output: 71 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-20 20:42:00,941 INFO L321 Elim1Store]: treesize reduction 1370, result has 11.4 percent of original size [2022-11-20 20:42:00,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 11 new quantified variables, introduced 37 case distinctions, treesize of input 4541 treesize of output 5201