./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7aeda8ef841ef7069da39f878404252c33796f5e53e1f416b530364b2ef30242 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:29:57,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:29:57,704 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-64bit-Taipan_Default.epf [2024-11-09 04:29:57,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:29:57,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:29:57,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:29:57,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:29:57,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:29:57,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:29:57,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:29:57,757 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:29:57,758 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:29:57,758 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:29:57,759 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:29:57,762 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:29:57,763 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:29:57,763 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:29:57,764 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:29:57,764 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:29:57,765 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:29:57,765 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:29:57,768 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:29:57,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:29:57,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:29:57,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:29:57,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:29:57,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:29:57,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:29:57,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:29:57,772 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:29:57,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:29:57,773 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:29:57,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:29:57,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:29:57,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:29:57,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:29:57,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:29:57,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:29:57,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:29:57,776 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:29:57,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:29:57,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:29:57,777 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:29:57,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:29:57,779 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/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_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7aeda8ef841ef7069da39f878404252c33796f5e53e1f416b530364b2ef30242 [2024-11-09 04:29:58,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:29:58,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:29:58,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:29:58,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:29:58,161 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:29:58,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i Unable to find full path for "g++" [2024-11-09 04:30:00,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:30:00,770 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:30:00,773 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i [2024-11-09 04:30:00,810 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/data/55bc809d2/81e09d72c91e46e9b79847c7ae5444a9/FLAG15e98fcae [2024-11-09 04:30:00,829 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/data/55bc809d2/81e09d72c91e46e9b79847c7ae5444a9 [2024-11-09 04:30:00,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:30:00,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:30:00,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:30:00,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:30:00,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:30:00,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:30:00" (1/1) ... [2024-11-09 04:30:00,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634c7759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:00, skipping insertion in model container [2024-11-09 04:30:00,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:30:00" (1/1) ... [2024-11-09 04:30:00,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:30:01,261 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4496,4509] [2024-11-09 04:30:01,270 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4556,4569] [2024-11-09 04:30:02,256 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:02,260 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:02,261 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:02,263 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:02,264 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:02,295 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:02,298 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:02,301 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:02,303 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:02,306 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:02,308 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:02,309 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:02,310 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:03,041 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[150476,150489] [2024-11-09 04:30:03,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:30:03,069 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:30:03,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4496,4509] [2024-11-09 04:30:03,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4556,4569] [2024-11-09 04:30:03,193 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:03,194 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:03,197 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:03,198 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:03,199 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:03,217 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:03,222 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:03,223 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:03,224 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:03,226 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:03,230 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:03,231 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:03,232 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 04:30:03,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[150476,150489] [2024-11-09 04:30:03,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:30:03,593 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:30:03,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:03 WrapperNode [2024-11-09 04:30:03,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:30:03,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:30:03,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:30:03,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:30:03,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:03" (1/1) ... [2024-11-09 04:30:03,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:03" (1/1) ... [2024-11-09 04:30:03,750 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 141 [2024-11-09 04:30:03,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:30:03,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:30:03,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:30:03,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:30:03,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:03" (1/1) ... [2024-11-09 04:30:03,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:03" (1/1) ... [2024-11-09 04:30:03,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:03" (1/1) ... [2024-11-09 04:30:03,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:03" (1/1) ... [2024-11-09 04:30:03,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:03" (1/1) ... [2024-11-09 04:30:03,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:03" (1/1) ... [2024-11-09 04:30:03,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:03" (1/1) ... [2024-11-09 04:30:03,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:03" (1/1) ... [2024-11-09 04:30:03,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:30:03,828 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:30:03,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:30:03,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:30:03,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:03" (1/1) ... [2024-11-09 04:30:03,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:30:03,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:03,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:30:03,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:30:03,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:30:03,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 04:30:03,917 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 04:30:03,918 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-09 04:30:03,918 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-09 04:30:03,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:30:03,919 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-09 04:30:03,920 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-09 04:30:03,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:30:03,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:30:03,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:30:03,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:30:03,921 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 04:30:03,921 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 04:30:03,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:30:03,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:30:03,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 04:30:03,922 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-09 04:30:03,922 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-09 04:30:03,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:30:04,252 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:30:04,255 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:30:04,628 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-11-09 04:30:04,629 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:30:04,772 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:30:04,772 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:30:04,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:30:04 BoogieIcfgContainer [2024-11-09 04:30:04,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:30:04,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:30:04,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:30:04,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:30:04,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:30:00" (1/3) ... [2024-11-09 04:30:04,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50724a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:30:04, skipping insertion in model container [2024-11-09 04:30:04,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:03" (2/3) ... [2024-11-09 04:30:04,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50724a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:30:04, skipping insertion in model container [2024-11-09 04:30:04,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:30:04" (3/3) ... [2024-11-09 04:30:04,789 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness.i [2024-11-09 04:30:04,810 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:30:04,811 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:30:04,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:30:04,904 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@516d079d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:30:04,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:30:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 04:30:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 04:30:04,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:04,926 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:04,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:04,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:04,932 INFO L85 PathProgramCache]: Analyzing trace with hash -10214518, now seen corresponding path program 1 times [2024-11-09 04:30:04,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:04,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804918266] [2024-11-09 04:30:04,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 04:30:06,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:06,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804918266] [2024-11-09 04:30:06,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804918266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:30:06,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857352974] [2024-11-09 04:30:06,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:06,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:06,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:06,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:06,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:30:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:06,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 04:30:06,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:06,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 04:30:06,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 04:30:06,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-11-09 04:30:06,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-11-09 04:30:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 04:30:09,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:30:09,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857352974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:09,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:30:09,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2024-11-09 04:30:09,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643630691] [2024-11-09 04:30:09,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:09,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:30:09,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:09,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:30:09,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:30:09,584 INFO L87 Difference]: Start difference. First operand has 49 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 04:30:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:10,374 INFO L93 Difference]: Finished difference Result 131 states and 185 transitions. [2024-11-09 04:30:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:30:10,377 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 38 [2024-11-09 04:30:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:10,386 INFO L225 Difference]: With dead ends: 131 [2024-11-09 04:30:10,386 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 04:30:10,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 04:30:10,395 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 43 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:10,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 337 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 04:30:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 04:30:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-09 04:30:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 53 states have internal predecessors, (68), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 04:30:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2024-11-09 04:30:10,465 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 38 [2024-11-09 04:30:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:10,466 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2024-11-09 04:30:10,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 04:30:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2024-11-09 04:30:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 04:30:10,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:10,473 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:10,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 04:30:10,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-09 04:30:10,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:10,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash -897604571, now seen corresponding path program 1 times [2024-11-09 04:30:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:10,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541715075] [2024-11-09 04:30:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:10,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 04:30:11,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:11,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541715075] [2024-11-09 04:30:11,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541715075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:30:11,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978762638] [2024-11-09 04:30:11,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:11,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:11,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:11,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:11,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:30:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:11,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 04:30:11,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:11,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 04:30:11,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 04:30:11,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-09 04:30:11,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:11,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 04:30:11,770 INFO L378 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-09 04:30:11,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:11,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 04:30:11,969 INFO L349 Elim1Store]: treesize reduction 119, result has 15.6 percent of original size [2024-11-09 04:30:11,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 68 [2024-11-09 04:30:11,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:11,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:11,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2024-11-09 04:30:12,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2024-11-09 04:30:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 04:30:14,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:30:17,556 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_181 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_184))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_181))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (or (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_181 Int)) (not (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_184))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_181))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_180 Int)) (not (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_180)))) (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_181 Int)) (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_184))) (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_181))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse7) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_180 Int)) (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_180)))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse7) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_180 Int)) (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_180)))) (store .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (let ((.cse11 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_181 Int)) (not (= (select (select (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_184))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_181))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse11) 0))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_180 Int)) (not (= (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_180)))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse11) 0))))))) is different from false [2024-11-09 04:30:17,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:30:17,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 449 [2024-11-09 04:30:18,857 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 04:30:18,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 19 [2024-11-09 04:30:18,883 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:18,908 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-09 04:30:18,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 31 [2024-11-09 04:30:18,948 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 04:30:18,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 35 [2024-11-09 04:30:18,983 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 04:30:18,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2024-11-09 04:30:19,116 INFO L349 Elim1Store]: treesize reduction 34, result has 49.3 percent of original size [2024-11-09 04:30:19,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 193 treesize of output 243 [2024-11-09 04:30:19,250 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:30:19,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 04:30:19,304 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:30:19,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 04:30:19,375 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:30:19,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 04:30:19,426 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:30:19,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 04:30:19,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2024-11-09 04:30:19,579 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 04:30:19,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 13 [2024-11-09 04:30:19,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0))) (.cse10 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse3 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (forall ((v_prenex_37 Int) (v_DerPreprocessor_33 Int) (v_DerPreprocessor_34 Int) (v_DerPreprocessor_39 Int) (v_DerPreprocessor_38 Int) (v_prenex_34 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int)) (or (not (= (select (store (store v_prenex_34 v_subst_2 v_DerPreprocessor_38) v_subst_4 v_DerPreprocessor_39) v_subst_2) v_DerPreprocessor_38)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_prenex_34))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3) 0) (not (= v_DerPreprocessor_33 (select (store (store v_prenex_34 v_subst_2 v_DerPreprocessor_33) v_prenex_37 v_DerPreprocessor_34) v_subst_2))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0))) (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (forall ((v_prenex_3 (Array Int Int))) (= (select (select (store .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_prenex_3) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (forall ((v_arrayElimArr_8 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_8))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (forall ((v_prenex_5 (Array Int Int))) (not (= (select (select (store .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_prenex_5) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_subst_3 Int) (v_DerPreprocessor_31 Int) (v_subst_2 Int) (v_DerPreprocessor_32 Int)) (or (not (= (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_3))) (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= v_DerPreprocessor_31 (select (store (store v_arrayElimArr_3 v_subst_3 v_DerPreprocessor_31) v_subst_2 v_DerPreprocessor_32) v_subst_3))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (let ((.cse7 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (forall ((v_ArrVal_184 (Array Int Int))) (not (= (select (select (store .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_ArrVal_184) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse7) 0))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_DerPreprocessor_29 Int) (v_subst_2 Int) (v_subst_1 Int) (v_DerPreprocessor_30 Int)) (or (not (= v_DerPreprocessor_29 (select (store (store v_arrayElimArr_5 v_subst_1 v_DerPreprocessor_29) v_subst_2 v_DerPreprocessor_30) v_subst_1))) (not (= (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_5))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse7) 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_4))) (store .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse10) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_7) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_25 Int) (v_DerPreprocessor_26 Int) (v_subst_4 Int) (v_subst_2 Int)) (or (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_6))) (store .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3) 0) (not (= v_DerPreprocessor_25 (select (store (store v_arrayElimArr_6 v_subst_4 v_DerPreprocessor_25) v_subst_2 v_DerPreprocessor_26) v_subst_4))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (forall ((v_prenex_8 (Array Int Int))) (= (select (select (store .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_prenex_8) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse10) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0))) (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (= (select (select (let ((.cse12 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_6))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3) 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0))))) is different from false [2024-11-09 04:30:20,250 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-09 04:30:20,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 144 [2024-11-09 04:30:20,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:30:20,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 204 [2024-11-09 04:30:20,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 153 [2024-11-09 04:30:20,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-09 04:30:20,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:30:20,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 79 [2024-11-09 04:30:20,571 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 04:30:20,572 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 1 [2024-11-09 04:30:20,582 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 04:30:20,583 INFO L378 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 3 case distinctions, treesize of input 30 treesize of output 1 [2024-11-09 04:30:20,587 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:20,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:20,597 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 04:30:20,598 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-09 04:30:20,602 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:20,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:20,613 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 04:30:20,613 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-09 04:30:20,626 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:20,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:20,638 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 04:30:20,638 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-09 04:30:20,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:20,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:20,682 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2024-11-09 04:30:20,683 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 37 [2024-11-09 04:30:20,713 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2024-11-09 04:30:20,713 INFO L378 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 3 case distinctions, treesize of input 35 treesize of output 36 [2024-11-09 04:30:20,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 80 [2024-11-09 04:30:20,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:20,737 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:20,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 67 [2024-11-09 04:30:20,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2024-11-09 04:30:20,776 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:20,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:20,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:20,784 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:20,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 04:30:20,811 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:30:20,816 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:20,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:20,822 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:20,823 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:20,828 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 04:30:20,829 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-09 04:30:20,836 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:20,837 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:20,842 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 04:30:20,843 INFO L378 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 3 case distinctions, treesize of input 30 treesize of output 1 [2024-11-09 04:30:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2024-11-09 04:30:20,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978762638] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:30:20,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [836665713] [2024-11-09 04:30:20,988 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-09 04:30:20,988 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:30:20,992 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:30:20,998 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:30:20,998 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:30:26,173 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 82 for LOIs [2024-11-09 04:30:26,278 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2024-11-09 04:30:26,282 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2024-11-09 04:30:26,313 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:30:29,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [836665713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:29,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:30:29,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [5, 10, 9] total 33 [2024-11-09 04:30:29,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082365167] [2024-11-09 04:30:29,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:29,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 04:30:29,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:29,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 04:30:29,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=828, Unknown=6, NotChecked=118, Total=1056 [2024-11-09 04:30:29,760 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand has 14 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 04:30:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:34,405 INFO L93 Difference]: Finished difference Result 149 states and 200 transitions. [2024-11-09 04:30:34,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 04:30:34,407 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 40 [2024-11-09 04:30:34,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:34,416 INFO L225 Difference]: With dead ends: 149 [2024-11-09 04:30:34,416 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 04:30:34,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 81 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=149, Invalid=1183, Unknown=8, NotChecked=142, Total=1482 [2024-11-09 04:30:34,418 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:34,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 275 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 485 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 04:30:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 04:30:34,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 04:30:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 76 states have internal predecessors, (101), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2024-11-09 04:30:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 152 transitions. [2024-11-09 04:30:34,464 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 152 transitions. Word has length 40 [2024-11-09 04:30:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:34,465 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 152 transitions. [2024-11-09 04:30:34,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 04:30:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 152 transitions. [2024-11-09 04:30:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 04:30:34,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:34,467 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:34,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:30:34,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-09 04:30:34,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:34,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:34,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1171320865, now seen corresponding path program 1 times [2024-11-09 04:30:34,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:34,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626279202] [2024-11-09 04:30:34,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:34,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 04:30:34,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:34,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626279202] [2024-11-09 04:30:34,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626279202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:30:34,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013801211] [2024-11-09 04:30:34,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:34,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:34,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:34,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:34,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:30:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:35,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 04:30:35,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 04:30:35,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:30:35,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013801211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:35,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:30:35,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-09 04:30:35,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405273652] [2024-11-09 04:30:35,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:35,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:30:35,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:35,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:30:35,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:30:35,347 INFO L87 Difference]: Start difference. First operand 113 states and 152 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 04:30:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:35,578 INFO L93 Difference]: Finished difference Result 231 states and 308 transitions. [2024-11-09 04:30:35,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:30:35,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2024-11-09 04:30:35,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:35,580 INFO L225 Difference]: With dead ends: 231 [2024-11-09 04:30:35,580 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 04:30:35,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:30:35,582 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:35,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 196 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:30:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 04:30:35,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2024-11-09 04:30:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 73 states have (on average 1.356164383561644) internal successors, (99), 76 states have internal predecessors, (99), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2024-11-09 04:30:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 150 transitions. [2024-11-09 04:30:35,634 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 150 transitions. Word has length 42 [2024-11-09 04:30:35,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:35,635 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 150 transitions. [2024-11-09 04:30:35,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 04:30:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 150 transitions. [2024-11-09 04:30:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 04:30:35,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:35,641 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:35,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 04:30:35,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:35,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:35,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:35,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2003729891, now seen corresponding path program 1 times [2024-11-09 04:30:35,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:35,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206027543] [2024-11-09 04:30:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:35,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 04:30:36,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:36,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206027543] [2024-11-09 04:30:36,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206027543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:30:36,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785099227] [2024-11-09 04:30:36,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:36,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:36,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:36,167 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:36,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 04:30:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:36,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 04:30:36,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 04:30:36,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:30:36,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785099227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:36,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:30:36,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-11-09 04:30:36,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788309860] [2024-11-09 04:30:36,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:36,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:30:36,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:36,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:30:36,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:30:36,629 INFO L87 Difference]: Start difference. First operand 113 states and 150 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 04:30:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:37,006 INFO L93 Difference]: Finished difference Result 261 states and 354 transitions. [2024-11-09 04:30:37,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:30:37,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2024-11-09 04:30:37,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:37,009 INFO L225 Difference]: With dead ends: 261 [2024-11-09 04:30:37,009 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 04:30:37,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:30:37,011 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 29 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:37,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 216 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:30:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 04:30:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 117. [2024-11-09 04:30:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 80 states have internal predecessors, (103), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2024-11-09 04:30:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 154 transitions. [2024-11-09 04:30:37,055 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 154 transitions. Word has length 44 [2024-11-09 04:30:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:37,055 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 154 transitions. [2024-11-09 04:30:37,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 04:30:37,056 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 154 transitions. [2024-11-09 04:30:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 04:30:37,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:37,058 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:37,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 04:30:37,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:37,259 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:37,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:37,259 INFO L85 PathProgramCache]: Analyzing trace with hash -87339218, now seen corresponding path program 1 times [2024-11-09 04:30:37,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:37,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453548614] [2024-11-09 04:30:37,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:37,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 04:30:37,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:37,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453548614] [2024-11-09 04:30:37,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453548614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:30:37,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527893911] [2024-11-09 04:30:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:37,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:37,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:37,679 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:37,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 04:30:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:37,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:30:37,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 04:30:37,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:30:37,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527893911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:37,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:30:37,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-09 04:30:37,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380548808] [2024-11-09 04:30:37,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:37,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:30:37,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:37,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:30:37,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:30:37,956 INFO L87 Difference]: Start difference. First operand 117 states and 154 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 04:30:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:38,064 INFO L93 Difference]: Finished difference Result 237 states and 329 transitions. [2024-11-09 04:30:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:30:38,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2024-11-09 04:30:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:38,067 INFO L225 Difference]: With dead ends: 237 [2024-11-09 04:30:38,067 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 04:30:38,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:30:38,069 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:38,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 95 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:30:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 04:30:38,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2024-11-09 04:30:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 88 states have internal predecessors, (115), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2024-11-09 04:30:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2024-11-09 04:30:38,110 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 46 [2024-11-09 04:30:38,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:38,110 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2024-11-09 04:30:38,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 04:30:38,111 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2024-11-09 04:30:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 04:30:38,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:38,113 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:38,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 04:30:38,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:38,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:38,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:38,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1250630270, now seen corresponding path program 1 times [2024-11-09 04:30:38,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:38,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057903791] [2024-11-09 04:30:38,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:38,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 04:30:38,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:38,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057903791] [2024-11-09 04:30:38,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057903791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:30:38,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343976700] [2024-11-09 04:30:38,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:38,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:38,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:38,763 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:38,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 04:30:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:39,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 04:30:39,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:39,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 04:30:39,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 04:30:39,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-09 04:30:39,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:39,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 04:30:39,520 INFO L378 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-09 04:30:39,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:39,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 04:30:39,891 INFO L349 Elim1Store]: treesize reduction 119, result has 15.6 percent of original size [2024-11-09 04:30:39,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 68 [2024-11-09 04:30:39,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:39,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:39,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2024-11-09 04:30:39,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2024-11-09 04:30:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 04:30:44,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:30:48,279 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse10 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse6 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (let ((.cse2 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (forall ((v_ArrVal_593 Int) (v_ArrVal_598 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_598))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_593))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_594 Int)) (not (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_594)))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0))))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_594 Int)) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_594)))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse6) 0)) (or (forall ((v_ArrVal_593 Int) (v_ArrVal_598 (Array Int Int))) (not (= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_598))) (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_593))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_594 Int)) (not (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_594)))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_594 Int)) (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_594)))) (store .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse10) 0)) (forall ((v_ArrVal_593 Int) (v_ArrVal_598 (Array Int Int))) (= (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_598))) (store .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_593))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse10) 0)) (forall ((v_ArrVal_593 Int) (v_ArrVal_598 (Array Int Int))) (= (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_598))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_593))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse6) 0)))) is different from false [2024-11-09 04:30:49,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:30:49,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 449 [2024-11-09 04:30:50,605 INFO L349 Elim1Store]: treesize reduction 73, result has 7.6 percent of original size [2024-11-09 04:30:50,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 109 [2024-11-09 04:30:51,234 INFO L349 Elim1Store]: treesize reduction 46, result has 51.6 percent of original size [2024-11-09 04:30:51,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 348 treesize of output 502 [2024-11-09 04:30:51,624 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:30:51,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 04:30:51,697 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:30:51,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 04:30:51,767 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:30:51,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 04:30:51,949 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:30:51,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 04:30:52,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-09 04:30:52,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-09 04:30:52,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-09 04:30:52,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-09 04:30:52,735 INFO L224 Elim1Store]: Index analysis took 192 ms [2024-11-09 04:30:52,755 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-09 04:30:52,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 100 [2024-11-09 04:30:52,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:52,922 INFO L224 Elim1Store]: Index analysis took 127 ms [2024-11-09 04:30:52,940 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 04:30:52,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 100 [2024-11-09 04:30:53,298 INFO L224 Elim1Store]: Index analysis took 261 ms [2024-11-09 04:30:53,324 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 04:30:53,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 100 [2024-11-09 04:30:53,787 INFO L224 Elim1Store]: Index analysis took 354 ms [2024-11-09 04:30:53,807 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-09 04:30:53,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 100 [2024-11-09 04:30:53,986 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:30:53,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 04:30:54,026 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:30:54,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 04:30:54,196 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:30:54,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 04:30:54,329 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:30:54,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 04:30:54,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-09 04:30:54,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-09 04:30:54,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-09 04:30:54,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-09 04:30:54,623 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-11-09 04:30:54,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 63 [2024-11-09 04:30:54,821 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-11-09 04:30:54,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 63 [2024-11-09 04:30:54,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:54,982 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2024-11-09 04:30:54,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 63 [2024-11-09 04:30:55,178 INFO L224 Elim1Store]: Index analysis took 117 ms [2024-11-09 04:30:55,256 INFO L349 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2024-11-09 04:30:55,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 63 [2024-11-09 04:30:55,753 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 04:30:55,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2024-11-09 04:30:55,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-11-09 04:30:55,920 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 04:30:55,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2024-11-09 04:30:58,426 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse9 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24)) (.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0))) (.cse4 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) (and (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 0) (forall ((v_prenex_47 (Array Int Int))) (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_prenex_47) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse1) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 1)))) (forall ((v_prenex_50 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| Int)) (or (not (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_prenex_50) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 0) (forall ((v_DerPreprocessor_79 Int) (v_DerPreprocessor_78 Int) (v_arrayElimArr_26 (Array Int Int)) (v_subst_8 Int) (v_subst_7 Int)) (or (not (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_arrayElimArr_26))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (not (= v_DerPreprocessor_78 (select (store (store v_arrayElimArr_26 v_subst_7 v_DerPreprocessor_78) v_subst_8 v_DerPreprocessor_79) v_subst_7))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 1)))) (forall ((v_prenex_50 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| Int)) (or (not (= (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_arrayElimArr_29))) (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (not (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_prenex_50) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 0) (forall ((v_DerPreprocessor_66 Int) (v_arrayElimArr_23 (Array Int Int)) (v_DerPreprocessor_67 Int) (v_subst_7 Int) (v_subst_5 Int)) (or (= (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_arrayElimArr_23))) (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse1) 0) (not (= (select (store (store v_arrayElimArr_23 v_subst_7 v_DerPreprocessor_66) v_subst_5 v_DerPreprocessor_67) v_subst_7) v_DerPreprocessor_66)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| Int)) (or (forall ((v_arrayElimArr_24 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_arrayElimArr_24))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse9) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 1)))) (forall ((v_prenex_50 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| Int)) (or (not (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_prenex_50) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 0) (forall ((v_subst_8 Int) (v_subst_7 Int) (v_prenex_79 (Array Int Int)) (v_DerPreprocessor_80 Int) (v_DerPreprocessor_81 Int)) (or (not (= (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_prenex_79))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (not (= v_DerPreprocessor_80 (select (store (store v_prenex_79 v_subst_7 v_DerPreprocessor_80) v_subst_8 v_DerPreprocessor_81) v_subst_7))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_ArrVal_598) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse9) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 1)))) (forall ((v_prenex_50 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| Int)) (or (not (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_prenex_50) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 1)) (forall ((v_arrayElimArr_28 (Array Int Int)) (v_subst_8 Int) (v_subst_7 Int) (v_DerPreprocessor_75 Int) (v_DerPreprocessor_74 Int)) (or (not (= v_DerPreprocessor_74 (select (store (store v_arrayElimArr_28 v_subst_7 v_DerPreprocessor_74) v_subst_8 v_DerPreprocessor_75) v_subst_7))) (not (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_arrayElimArr_28))) (store .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))))) (forall ((v_prenex_50 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| Int)) (or (not (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_prenex_50) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_DerPreprocessor_77 Int) (v_subst_8 Int) (v_arrayElimArr_27 (Array Int Int)) (v_subst_7 Int) (v_DerPreprocessor_93 Int) (v_subst_5 Int) (v_DerPreprocessor_94 Int) (v_prenex_76 Int) (v_DerPreprocessor_91 Int) (v_DerPreprocessor_92 Int) (v_DerPreprocessor_76 Int)) (let ((.cse14 (store v_arrayElimArr_27 v_prenex_76 v_DerPreprocessor_91))) (let ((.cse12 (store v_arrayElimArr_27 v_prenex_76 v_DerPreprocessor_93)) (.cse13 (store .cse14 v_subst_7 v_DerPreprocessor_92))) (or (not (= (select (store .cse12 v_subst_5 v_DerPreprocessor_94) v_prenex_76) v_DerPreprocessor_93)) (not (= .cse13 (store (store .cse12 v_subst_5 (select .cse13 v_subst_5)) v_subst_7 v_DerPreprocessor_92))) (not (= v_DerPreprocessor_91 (select .cse13 v_prenex_76))) (not (= v_DerPreprocessor_76 (select (store (store .cse14 v_subst_7 v_DerPreprocessor_76) v_subst_8 v_DerPreprocessor_77) v_subst_7))) (not (= (select (select (let ((.cse15 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_arrayElimArr_27))) (store .cse15 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse15 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| Int)) (or (forall ((v_prenex_43 (Array Int Int))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_prenex_43) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 0) (forall ((v_arrayElimArr_21 (Array Int Int))) (not (= (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_arrayElimArr_21))) (store .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 1)))))) is different from false [2024-11-09 04:30:58,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:30:58,974 INFO L378 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 3 case distinctions, treesize of input 31 treesize of output 42 [2024-11-09 04:30:59,175 INFO L349 Elim1Store]: treesize reduction 90, result has 44.8 percent of original size [2024-11-09 04:30:59,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 120 treesize of output 151 [2024-11-09 04:30:59,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:30:59,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 228 [2024-11-09 04:30:59,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 154 [2024-11-09 04:30:59,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:30:59,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 78 [2024-11-09 04:30:59,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-09 04:30:59,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-09 04:30:59,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:30:59,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 76 [2024-11-09 04:30:59,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:30:59,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:30:59,855 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2024-11-09 04:30:59,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 70 [2024-11-09 04:30:59,898 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:59,909 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:59,910 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:59,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:30:59,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2024-11-09 04:30:59,937 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:59,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 04:30:59,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:59,995 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:30:59,999 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 04:30:59,999 INFO L378 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 3 case distinctions, treesize of input 30 treesize of output 1 [2024-11-09 04:31:00,007 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:31:00,013 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:31:00,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:31:00,020 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:31:00,021 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:31:00,025 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 04:31:00,025 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 1 [2024-11-09 04:31:00,032 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:31:00,038 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:31:00,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:31:00,045 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:31:00,046 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:31:00,050 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 04:31:00,050 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-09 04:31:00,068 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:31:00,068 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:31:00,072 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 04:31:00,073 INFO L378 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 3 case distinctions, treesize of input 30 treesize of output 1 [2024-11-09 04:31:00,079 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:31:00,089 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:31:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2024-11-09 04:31:00,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343976700] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:31:00,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [683989702] [2024-11-09 04:31:00,264 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2024-11-09 04:31:00,264 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:31:00,265 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:31:00,265 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:31:00,265 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:31:02,323 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 82 for LOIs [2024-11-09 04:31:02,470 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2024-11-09 04:31:02,474 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2024-11-09 04:31:02,492 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 17 for LOIs [2024-11-09 04:31:02,524 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:31:07,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [683989702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:31:07,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:31:07,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [5, 10, 9] total 38 [2024-11-09 04:31:07,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30170636] [2024-11-09 04:31:07,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:31:07,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 04:31:07,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:31:07,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 04:31:07,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1138, Unknown=9, NotChecked=138, Total=1406 [2024-11-09 04:31:07,554 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand has 19 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 04:31:14,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:31:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:31:16,481 INFO L93 Difference]: Finished difference Result 251 states and 331 transitions. [2024-11-09 04:31:16,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 04:31:16,482 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2024-11-09 04:31:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:31:16,484 INFO L225 Difference]: With dead ends: 251 [2024-11-09 04:31:16,485 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 04:31:16,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 99 SyntacticMatches, 15 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=178, Invalid=1707, Unknown=15, NotChecked=170, Total=2070 [2024-11-09 04:31:16,487 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:31:16,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 206 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 638 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2024-11-09 04:31:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 04:31:16,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2024-11-09 04:31:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 96 states have internal predecessors, (124), 28 states have call successors, (28), 14 states have call predecessors, (28), 16 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2024-11-09 04:31:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 180 transitions. [2024-11-09 04:31:16,540 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 180 transitions. Word has length 49 [2024-11-09 04:31:16,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:31:16,540 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 180 transitions. [2024-11-09 04:31:16,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 04:31:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 180 transitions. [2024-11-09 04:31:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 04:31:16,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:31:16,543 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:31:16,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 04:31:16,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 04:31:16,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:31:16,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:31:16,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1626496194, now seen corresponding path program 1 times [2024-11-09 04:31:16,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:31:16,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702102891] [2024-11-09 04:31:16,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:31:16,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:31:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:31:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 04:31:17,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:31:17,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702102891] [2024-11-09 04:31:17,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702102891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:31:17,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493781491] [2024-11-09 04:31:17,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:31:17,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:31:17,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:31:17,992 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:31:17,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_946107d1-e4dc-47a7-9d37-109b3462aac4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 04:31:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:31:18,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 04:31:18,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:31:18,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 04:31:18,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 04:31:18,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-09 04:31:18,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:31:18,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 04:31:18,928 INFO L378 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-09 04:31:18,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:31:18,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 04:31:19,249 INFO L349 Elim1Store]: treesize reduction 119, result has 15.6 percent of original size [2024-11-09 04:31:19,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 68 [2024-11-09 04:31:19,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:31:19,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:31:19,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2024-11-09 04:31:19,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2024-11-09 04:31:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 04:31:23,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:31:27,070 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse7 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse5 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (or (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_707 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_707)))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))) (forall ((v_ArrVal_709 Int) (v_ArrVal_706 (Array Int Int))) (not (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_706))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_709))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)))) (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_707 Int)) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_707)))) (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse5) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_707 Int)) (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_707)))) (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse7) 0)) (let ((.cse9 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_707 Int)) (not (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_707)))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse9) 0))) (forall ((v_ArrVal_709 Int) (v_ArrVal_706 (Array Int Int))) (not (= (select (select (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_706))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_709))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse9) 0))))) (forall ((v_ArrVal_709 Int) (v_ArrVal_706 (Array Int Int))) (= (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_706))) (store .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_709))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse7) 0)) (forall ((v_ArrVal_709 Int) (v_ArrVal_706 (Array Int Int))) (= (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_706))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_709))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse5) 0)))) is different from false [2024-11-09 04:31:28,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:31:28,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 449 [2024-11-09 04:31:28,419 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-09 04:31:28,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-09 04:31:28,465 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-09 04:31:28,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-09 04:31:28,520 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-09 04:31:28,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-09 04:31:28,617 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-09 04:31:28,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-09 04:31:28,703 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-09 04:31:28,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-09 04:31:28,874 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-09 04:31:28,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-09 04:31:29,349 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:31:29,373 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 04:31:29,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 19 [2024-11-09 04:31:29,413 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 04:31:29,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2024-11-09 04:31:29,438 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 04:31:29,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2024-11-09 04:31:29,485 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 04:31:29,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 19 [2024-11-09 04:31:29,889 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24)) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0))) (.cse5 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse12 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int) (v_prenex_96 (Array Int Int))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 0) (forall ((v_arrayElimArr_40 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_arrayElimArr_40))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3) 0))) (not (= (select (select (store .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_prenex_96) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)))) (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 0) (forall ((v_prenex_91 (Array Int Int))) (= (select (select (store .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_prenex_91) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse5) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int) (v_prenex_96 (Array Int Int)) (v_arrayElimArr_40 (Array Int Int))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 0) (not (= (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_arrayElimArr_40))) (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3) 0)) (not (= (select (select (store .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_prenex_96) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int)) (or (forall ((v_ArrVal_706 (Array Int Int))) (not (= (select (select (store .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_ArrVal_706) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)) (forall ((v_DerPreprocessor_108 Int) (v_DerPreprocessor_109 Int) (v_subst_12 Int) (v_subst_9 Int) (v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_110 Int) (v_DerPreprocessor_111 Int) (v_subst_11 Int) (v_subst_10 Int) (v_DerPreprocessor_104 Int) (v_DerPreprocessor_105 Int)) (let ((.cse8 (store v_arrayElimArr_39 v_subst_9 v_DerPreprocessor_110))) (let ((.cse11 (store .cse8 v_subst_12 v_DerPreprocessor_108))) (let ((.cse7 (store .cse11 v_subst_10 v_DerPreprocessor_109)) (.cse9 (store (store .cse11 v_subst_10 v_DerPreprocessor_104) v_subst_11 v_DerPreprocessor_105))) (or (not (= (select .cse7 v_subst_12) v_DerPreprocessor_108)) (not (= v_DerPreprocessor_110 (select (store .cse8 v_subst_12 v_DerPreprocessor_111) v_subst_9))) (not (= (store (store .cse8 v_subst_12 (select .cse9 v_subst_12)) v_subst_11 v_DerPreprocessor_105) .cse9)) (not (= (store (store v_arrayElimArr_39 v_subst_9 (select .cse7 v_subst_9)) v_subst_10 v_DerPreprocessor_109) .cse7)) (not (= (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_arrayElimArr_39))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= v_DerPreprocessor_104 (select .cse9 v_subst_10))) (not (= (store (store v_arrayElimArr_39 v_subst_9 (select .cse9 v_subst_9)) v_subst_11 v_DerPreprocessor_105) .cse9))))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 0) (forall ((v_prenex_93 (Array Int Int))) (= (select (select (store .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_prenex_93) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse12) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int)) (or (forall ((v_DerPreprocessor_107 Int) (v_subst_11 Int) (v_subst_10 Int) (v_arrayElimArr_41 (Array Int Int)) (v_DerPreprocessor_106 Int)) (or (not (= v_DerPreprocessor_106 (select (store (store v_arrayElimArr_41 v_subst_10 v_DerPreprocessor_106) v_subst_11 v_DerPreprocessor_107) v_subst_10))) (= (select (select (let ((.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_arrayElimArr_41))) (store .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse5) 0))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int)) (or (forall ((v_subst_12 Int) (v_DerPreprocessor_102 Int) (v_DerPreprocessor_114 Int) (v_subst_11 Int) (v_DerPreprocessor_103 Int) (v_subst_10 Int) (v_DerPreprocessor_115 Int) (v_arrayElimArr_42 (Array Int Int))) (let ((.cse15 (store v_arrayElimArr_42 v_subst_12 v_DerPreprocessor_114))) (let ((.cse14 (store (store .cse15 v_subst_10 v_DerPreprocessor_102) v_subst_11 v_DerPreprocessor_103))) (or (not (= .cse14 (store (store v_arrayElimArr_42 v_subst_12 (select .cse14 v_subst_12)) v_subst_11 v_DerPreprocessor_103))) (not (= v_DerPreprocessor_114 (select (store .cse15 v_subst_10 v_DerPreprocessor_115) v_subst_12))) (not (= (select .cse14 v_subst_10) v_DerPreprocessor_102)) (= (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_arrayElimArr_42))) (store .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse12) 0))))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)))))) is different from false [2024-11-09 04:31:30,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:31:30,326 INFO L378 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 3 case distinctions, treesize of input 29 treesize of output 40 [2024-11-09 04:31:30,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:31:30,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 70 [2024-11-09 04:31:30,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-09 04:31:30,692 INFO L349 Elim1Store]: treesize reduction 78, result has 46.9 percent of original size [2024-11-09 04:31:30,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 141 [2024-11-09 04:31:30,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:31:30,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 221 [2024-11-09 04:31:38,100 WARN L286 SmtUtils]: Spent 7.33s on a formula simplification. DAG size of input: 351 DAG size of output: 131 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 04:31:38,100 INFO L349 Elim1Store]: treesize reduction 942, result has 20.5 percent of original size [2024-11-09 04:31:38,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 12 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 13 new quantified variables, introduced 42 case distinctions, treesize of input 672 treesize of output 1964 [2024-11-09 04:31:59,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 04:31:59,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 04:32:29,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:29,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 246 treesize of output 236