./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:35:52,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:35:52,390 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:35:52,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:35:52,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:35:52,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:35:52,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:35:52,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:35:52,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:35:52,435 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:35:52,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:35:52,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:35:52,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:35:52,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:35:52,438 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:35:52,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:35:52,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:35:52,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:35:52,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:35:52,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:35:52,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:35:52,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:35:52,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:35:52,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:35:52,447 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:35:52,447 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:35:52,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:35:52,448 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:35:52,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:35:52,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:35:52,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:35:52,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:35:52,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:35:52,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:35:52,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:35:52,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:35:52,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:35:52,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:35:52,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:35:52,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:35:52,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:35:52,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:35:52,454 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/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_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2024-11-08 18:35:52,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:35:52,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:35:52,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:35:52,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:35:52,813 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:35:52,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i Unable to find full path for "g++" [2024-11-08 18:35:55,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:35:55,574 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:35:55,575 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-08 18:35:55,595 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/data/0fcfb065a/896a56c188c94c8e8bd265ee80dcbc50/FLAGcfe26578c [2024-11-08 18:35:55,851 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/data/0fcfb065a/896a56c188c94c8e8bd265ee80dcbc50 [2024-11-08 18:35:55,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:35:55,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:35:55,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:35:55,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:35:55,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:35:55,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:35:55" (1/1) ... [2024-11-08 18:35:55,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d52d9ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:55, skipping insertion in model container [2024-11-08 18:35:55,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:35:55" (1/1) ... [2024-11-08 18:35:55,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:35:56,518 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_df0b2312-2272-4e5d-b409-19932f81d739/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2024-11-08 18:35:56,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:35:56,539 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:35:56,618 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_df0b2312-2272-4e5d-b409-19932f81d739/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2024-11-08 18:35:56,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:35:56,672 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:35:56,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56 WrapperNode [2024-11-08 18:35:56,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:35:56,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:35:56,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:35:56,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:35:56,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56" (1/1) ... [2024-11-08 18:35:56,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56" (1/1) ... [2024-11-08 18:35:56,748 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2024-11-08 18:35:56,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:35:56,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:35:56,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:35:56,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:35:56,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56" (1/1) ... [2024-11-08 18:35:56,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56" (1/1) ... [2024-11-08 18:35:56,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56" (1/1) ... [2024-11-08 18:35:56,801 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 9, 6]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2024-11-08 18:35:56,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56" (1/1) ... [2024-11-08 18:35:56,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56" (1/1) ... [2024-11-08 18:35:56,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56" (1/1) ... [2024-11-08 18:35:56,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56" (1/1) ... [2024-11-08 18:35:56,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56" (1/1) ... [2024-11-08 18:35:56,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56" (1/1) ... [2024-11-08 18:35:56,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:35:56,828 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:35:56,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:35:56,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:35:56,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56" (1/1) ... [2024-11-08 18:35:56,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:35:56,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:35:56,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:35:56,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:35:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 18:35:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 18:35:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 18:35:56,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 18:35:56,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 18:35:56,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 18:35:56,992 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-08 18:35:56,993 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-08 18:35:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 18:35:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:35:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 18:35:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 18:35:56,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 18:35:56,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 18:35:56,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 18:35:56,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 18:35:56,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 18:35:56,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 18:35:56,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 18:35:56,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 18:35:56,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 18:35:56,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:35:56,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 18:35:57,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 18:35:57,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:35:57,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:35:57,334 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:35:57,338 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:35:57,738 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-08 18:35:57,738 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:35:57,762 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:35:57,763 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:35:57,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:35:57 BoogieIcfgContainer [2024-11-08 18:35:57,764 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:35:57,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:35:57,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:35:57,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:35:57,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:35:55" (1/3) ... [2024-11-08 18:35:57,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e060a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:35:57, skipping insertion in model container [2024-11-08 18:35:57,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:35:56" (2/3) ... [2024-11-08 18:35:57,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e060a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:35:57, skipping insertion in model container [2024-11-08 18:35:57,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:35:57" (3/3) ... [2024-11-08 18:35:57,780 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2024-11-08 18:35:57,812 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:35:57,815 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:35:57,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:35:57,958 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=PETRI_NET, 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;@3c6246e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:35:57,958 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:35:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:35:57,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 18:35:57,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:57,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:57,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:57,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash -821525012, now seen corresponding path program 1 times [2024-11-08 18:35:58,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:58,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204007409] [2024-11-08 18:35:58,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:58,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:58,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:35:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:35:58,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:58,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204007409] [2024-11-08 18:35:58,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204007409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:58,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:58,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:35:58,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111931734] [2024-11-08 18:35:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:58,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:35:58,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:58,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:35:58,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:35:58,725 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:35:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:58,885 INFO L93 Difference]: Finished difference Result 64 states and 88 transitions. [2024-11-08 18:35:58,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:35:58,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-08 18:35:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:58,896 INFO L225 Difference]: With dead ends: 64 [2024-11-08 18:35:58,897 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 18:35:58,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:35:58,906 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:58,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 102 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:35:58,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 18:35:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-08 18:35:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:35:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-08 18:35:58,971 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2024-11-08 18:35:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:58,972 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-08 18:35:58,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:35:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-08 18:35:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 18:35:58,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:58,977 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:35:58,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:35:58,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:58,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:58,980 INFO L85 PathProgramCache]: Analyzing trace with hash -963325564, now seen corresponding path program 1 times [2024-11-08 18:35:58,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:58,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279548740] [2024-11-08 18:35:58,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:58,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:59,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 18:35:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:59,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 18:35:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:35:59,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:59,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279548740] [2024-11-08 18:35:59,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279548740] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:35:59,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362168500] [2024-11-08 18:35:59,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:59,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:35:59,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:35:59,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:35:59,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:35:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:59,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:35:59,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:35:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:35:59,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:35:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:35:59,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362168500] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:35:59,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:35:59,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-08 18:35:59,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273906903] [2024-11-08 18:35:59,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:35:59,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:35:59,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:59,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:35:59,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:35:59,884 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:36:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:00,026 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2024-11-08 18:36:00,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:36:00,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-11-08 18:36:00,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:00,029 INFO L225 Difference]: With dead ends: 51 [2024-11-08 18:36:00,029 INFO L226 Difference]: Without dead ends: 31 [2024-11-08 18:36:00,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:36:00,034 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:00,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 71 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:36:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-08 18:36:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-08 18:36:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:36:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-08 18:36:00,052 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 26 [2024-11-08 18:36:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:00,052 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-08 18:36:00,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:36:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-08 18:36:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 18:36:00,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:00,058 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:00,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:36:00,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:00,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:00,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:00,265 INFO L85 PathProgramCache]: Analyzing trace with hash 474484972, now seen corresponding path program 2 times [2024-11-08 18:36:00,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:00,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376885088] [2024-11-08 18:36:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:00,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:01,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 18:36:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:01,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 18:36:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:36:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 18:36:01,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:01,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376885088] [2024-11-08 18:36:01,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376885088] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:36:01,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755512798] [2024-11-08 18:36:01,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:36:01,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:01,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:01,718 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:01,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:36:01,931 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 18:36:01,931 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:36:01,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 18:36:01,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:02,239 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 15 treesize of output 1 [2024-11-08 18:36:02,257 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 16 treesize of output 8 [2024-11-08 18:36:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 18:36:02,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:02,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755512798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:02,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:36:02,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2024-11-08 18:36:02,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536542729] [2024-11-08 18:36:02,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:02,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:36:02,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:02,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:36:02,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2024-11-08 18:36:02,266 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:36:02,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:02,391 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-08 18:36:02,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:36:02,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-08 18:36:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:02,394 INFO L225 Difference]: With dead ends: 43 [2024-11-08 18:36:02,394 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 18:36:02,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2024-11-08 18:36:02,398 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:02,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 175 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:36:02,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 18:36:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2024-11-08 18:36:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:36:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-08 18:36:02,411 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 35 [2024-11-08 18:36:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:02,412 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-08 18:36:02,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:36:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-08 18:36:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 18:36:02,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:02,413 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:02,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:36:02,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:02,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:02,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:02,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1823763484, now seen corresponding path program 1 times [2024-11-08 18:36:02,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:02,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985406848] [2024-11-08 18:36:02,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:02,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:03,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 18:36:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:03,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 18:36:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:03,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:36:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 18:36:03,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:03,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985406848] [2024-11-08 18:36:03,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985406848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:03,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:03,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 18:36:03,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454536485] [2024-11-08 18:36:03,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:03,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 18:36:03,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:03,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 18:36:03,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:36:03,777 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:36:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:04,106 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-11-08 18:36:04,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 18:36:04,107 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-11-08 18:36:04,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:04,109 INFO L225 Difference]: With dead ends: 43 [2024-11-08 18:36:04,109 INFO L226 Difference]: Without dead ends: 41 [2024-11-08 18:36:04,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:36:04,112 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:04,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 163 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:36:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-08 18:36:04,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2024-11-08 18:36:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:36:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-08 18:36:04,122 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 36 [2024-11-08 18:36:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:04,123 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-08 18:36:04,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:36:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-11-08 18:36:04,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 18:36:04,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:04,126 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:04,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:36:04,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:04,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:04,127 INFO L85 PathProgramCache]: Analyzing trace with hash 290092726, now seen corresponding path program 1 times [2024-11-08 18:36:04,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:04,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770459467] [2024-11-08 18:36:04,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:04,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:04,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 18:36:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:04,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 18:36:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:04,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:36:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 18:36:04,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:04,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770459467] [2024-11-08 18:36:04,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770459467] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:36:04,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119304181] [2024-11-08 18:36:04,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:04,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:04,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:04,657 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:04,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:36:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:04,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 18:36:04,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:05,096 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 16 treesize of output 8 [2024-11-08 18:36:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:36:05,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:36:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 18:36:05,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119304181] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:36:05,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:36:05,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-11-08 18:36:05,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633827799] [2024-11-08 18:36:05,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:36:05,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:36:05,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:05,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:36:05,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:36:05,211 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 18:36:09,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:36:13,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:36:17,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:36:21,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:36:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:21,546 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-08 18:36:21,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:36:21,547 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-11-08 18:36:21,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:21,548 INFO L225 Difference]: With dead ends: 46 [2024-11-08 18:36:21,549 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 18:36:21,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:36:21,550 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:21,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 225 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2024-11-08 18:36:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 18:36:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-08 18:36:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:36:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-08 18:36:21,559 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 38 [2024-11-08 18:36:21,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:21,560 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-08 18:36:21,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 18:36:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-08 18:36:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 18:36:21,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:21,562 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:21,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 18:36:21,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:21,764 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:21,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2045985416, now seen corresponding path program 1 times [2024-11-08 18:36:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:21,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599237102] [2024-11-08 18:36:21,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:21,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:22,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 18:36:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:22,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 18:36:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:22,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:36:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 18:36:22,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:22,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599237102] [2024-11-08 18:36:22,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599237102] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:36:22,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064394403] [2024-11-08 18:36:22,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:22,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:22,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:22,134 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:22,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:36:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:22,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 18:36:22,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:22,485 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 16 treesize of output 8 [2024-11-08 18:36:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:36:22,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:36:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 18:36:22,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064394403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:36:22,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:36:22,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 11 [2024-11-08 18:36:22,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526821662] [2024-11-08 18:36:22,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:36:22,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 18:36:22,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:22,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 18:36:22,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:36:22,571 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 18:36:26,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:36:30,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:36:34,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:36:38,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:36:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:38,874 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-08 18:36:38,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:36:38,875 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-11-08 18:36:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:38,876 INFO L225 Difference]: With dead ends: 41 [2024-11-08 18:36:38,877 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 18:36:38,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:36:38,878 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:38,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 182 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2024-11-08 18:36:38,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 18:36:38,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 18:36:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:36:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-08 18:36:38,888 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 38 [2024-11-08 18:36:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:38,888 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-08 18:36:38,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 18:36:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-08 18:36:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 18:36:38,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:38,890 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:38,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 18:36:39,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:39,092 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:39,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:39,093 INFO L85 PathProgramCache]: Analyzing trace with hash 998592784, now seen corresponding path program 1 times [2024-11-08 18:36:39,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:39,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899947134] [2024-11-08 18:36:39,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:39,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:40,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 18:36:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:40,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 18:36:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:40,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:36:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 18:36:40,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:40,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899947134] [2024-11-08 18:36:40,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899947134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:36:40,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141591104] [2024-11-08 18:36:40,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:40,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:40,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:40,611 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:40,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 18:36:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:40,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-08 18:36:40,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:41,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 18:36:41,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:36:41,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 18:36:41,493 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 11 treesize of output 3 [2024-11-08 18:36:41,499 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 9 treesize of output 3 [2024-11-08 18:36:41,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-08 18:36:41,697 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_37| Int)) (let ((.cse0 (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_37|))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_37| .cse0)) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_37|) 0) (= |c_node_create_#in~data#1| (select .cse0 0)))))) is different from true [2024-11-08 18:36:41,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:36:41,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:36:41,790 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 18:36:41,791 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 15 treesize of output 15 [2024-11-08 18:36:42,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-08 18:36:42,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 18:36:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2024-11-08 18:36:42,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:36:42,569 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (v_ArrVal_825 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_825) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_825 (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_825 .cse0))))))) is different from false [2024-11-08 18:36:42,622 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (v_ArrVal_825 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_825) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_825 (let ((.cse0 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_825 .cse0))))))) is different from false [2024-11-08 18:36:42,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:36:42,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2024-11-08 18:36:42,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141591104] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:36:42,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:36:42,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2024-11-08 18:36:42,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398329410] [2024-11-08 18:36:42,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:36:42,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 18:36:42,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:42,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 18:36:42,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=790, Unknown=3, NotChecked=174, Total=1056 [2024-11-08 18:36:42,947 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 30 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 26 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 18:36:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:44,231 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-11-08 18:36:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 18:36:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 26 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2024-11-08 18:36:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:44,236 INFO L225 Difference]: With dead ends: 53 [2024-11-08 18:36:44,236 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 18:36:44,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=151, Invalid=1498, Unknown=3, NotChecked=240, Total=1892 [2024-11-08 18:36:44,240 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:44,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 238 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 453 Invalid, 0 Unknown, 53 Unchecked, 0.6s Time] [2024-11-08 18:36:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 18:36:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-11-08 18:36:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:36:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-11-08 18:36:44,267 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 39 [2024-11-08 18:36:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:44,268 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-08 18:36:44,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 26 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 18:36:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-11-08 18:36:44,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 18:36:44,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:44,270 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:44,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 18:36:44,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 18:36:44,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:44,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1869999786, now seen corresponding path program 1 times [2024-11-08 18:36:44,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:44,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526655709] [2024-11-08 18:36:44,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:44,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:45,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 18:36:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:45,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 18:36:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:36:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:36:45,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:45,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526655709] [2024-11-08 18:36:45,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526655709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:36:45,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647325573] [2024-11-08 18:36:45,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:45,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:45,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:45,862 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:45,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 18:36:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:46,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-08 18:36:46,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:46,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 18:36:46,260 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 19 treesize of output 1 [2024-11-08 18:36:46,407 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 18 treesize of output 4 [2024-11-08 18:36:46,412 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 9 treesize of output 3 [2024-11-08 18:36:46,470 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_46| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_46|) 0) (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_46| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_46|)) |c_#memory_$Pointer$#1.base|))) is different from true [2024-11-08 18:36:46,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:36:46,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-08 18:36:46,507 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 18:36:46,507 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 15 treesize of output 15 [2024-11-08 18:36:46,707 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2024-11-08 18:36:46,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 42 [2024-11-08 18:36:46,719 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 26 treesize of output 18 [2024-11-08 18:36:46,723 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 22 treesize of output 14 [2024-11-08 18:36:46,772 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 20 treesize of output 8 [2024-11-08 18:36:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-08 18:36:46,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:36:47,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647325573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:36:47,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:36:47,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 32 [2024-11-08 18:36:47,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003087230] [2024-11-08 18:36:47,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:36:47,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 18:36:47,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:47,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 18:36:47,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1029, Unknown=4, NotChecked=64, Total=1190 [2024-11-08 18:36:47,280 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 32 states, 30 states have (on average 1.9) internal successors, (57), 27 states have internal predecessors, (57), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 18:36:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:48,202 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2024-11-08 18:36:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 18:36:48,204 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.9) internal successors, (57), 27 states have internal predecessors, (57), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2024-11-08 18:36:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:48,206 INFO L225 Difference]: With dead ends: 58 [2024-11-08 18:36:48,207 INFO L226 Difference]: Without dead ends: 47 [2024-11-08 18:36:48,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=141, Invalid=1665, Unknown=4, NotChecked=82, Total=1892 [2024-11-08 18:36:48,209 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:48,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 375 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 540 Invalid, 0 Unknown, 47 Unchecked, 0.5s Time] [2024-11-08 18:36:48,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-08 18:36:48,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2024-11-08 18:36:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:36:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-11-08 18:36:48,221 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 41 [2024-11-08 18:36:48,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:48,221 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-08 18:36:48,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.9) internal successors, (57), 27 states have internal predecessors, (57), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 18:36:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-11-08 18:36:48,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 18:36:48,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:48,223 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:48,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 18:36:48,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 18:36:48,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:48,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1059180693, now seen corresponding path program 1 times [2024-11-08 18:36:48,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:48,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017948927] [2024-11-08 18:36:48,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:48,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:50,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 18:36:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 18:36:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:50,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:36:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:36:50,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:50,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017948927] [2024-11-08 18:36:50,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017948927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:36:50,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994613058] [2024-11-08 18:36:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:50,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:50,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:50,867 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:50,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 18:36:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:51,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-08 18:36:51,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:51,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 18:36:51,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:36:51,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:36:51,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 18:36:51,966 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 11 treesize of output 3 [2024-11-08 18:36:51,973 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 11 treesize of output 3 [2024-11-08 18:36:51,979 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 9 treesize of output 3 [2024-11-08 18:36:52,187 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_54| Int)) (and (= (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_54| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_54|)) |c_#memory_$Pointer$#1.offset|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_54| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_54|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_54|) 0))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2024-11-08 18:36:52,258 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 18:36:52,258 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 15 treesize of output 15 [2024-11-08 18:36:52,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:36:52,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:36:52,753 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-08 18:36:52,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2024-11-08 18:36:52,762 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 19 treesize of output 11 [2024-11-08 18:36:52,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 18:36:52,866 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 19 treesize of output 11 [2024-11-08 18:36:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-08 18:36:52,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:36:53,115 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (v_ArrVal_1145 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1145) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1145 .cse0))) v_ArrVal_1145)))) is different from false [2024-11-08 18:36:58,080 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.base_25| Int) (|v_node_create_~temp~0#1.base_59| Int) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1152 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |v_node_create_~temp~0#1.base_59| v_ArrVal_1153))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_59|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |v_ULTIMATE.start_sll_append_~last~0#1.base_25| v_ArrVal_1145) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (let ((.cse1 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_59| v_ArrVal_1152) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))))) (store (select .cse0 |v_ULTIMATE.start_sll_append_~last~0#1.base_25|) .cse1 (select v_ArrVal_1145 .cse1))) v_ArrVal_1145))))) is different from false [2024-11-08 18:36:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994613058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:36:58,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:36:58,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 39 [2024-11-08 18:36:58,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643124192] [2024-11-08 18:36:58,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:36:58,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-08 18:36:58,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:58,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-08 18:36:58,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1475, Unknown=29, NotChecked=240, Total=1892 [2024-11-08 18:36:58,087 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 39 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 33 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:36:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:59,497 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2024-11-08 18:36:59,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 18:36:59,498 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 33 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2024-11-08 18:36:59,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:59,501 INFO L225 Difference]: With dead ends: 60 [2024-11-08 18:36:59,502 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 18:36:59,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=225, Invalid=2410, Unknown=29, NotChecked=306, Total=2970 [2024-11-08 18:36:59,506 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:59,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 304 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 487 Invalid, 0 Unknown, 55 Unchecked, 0.7s Time] [2024-11-08 18:36:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 18:36:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2024-11-08 18:36:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:36:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-08 18:36:59,539 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 41 [2024-11-08 18:36:59,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:59,540 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-08 18:36:59,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 33 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:36:59,541 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-08 18:36:59,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 18:36:59,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:59,542 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:59,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 18:36:59,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-08 18:36:59,743 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:59,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:59,744 INFO L85 PathProgramCache]: Analyzing trace with hash -845380902, now seen corresponding path program 2 times [2024-11-08 18:36:59,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:59,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902762617] [2024-11-08 18:36:59,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:59,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:02,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 18:37:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:02,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 18:37:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:03,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:37:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:37:03,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:37:03,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902762617] [2024-11-08 18:37:03,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902762617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:37:03,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283565085] [2024-11-08 18:37:03,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:37:03,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:37:03,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:37:03,557 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:37:03,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 18:37:03,881 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:37:03,881 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:37:03,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 143 conjuncts are in the unsatisfiable core [2024-11-08 18:37:03,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:37:04,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 18:37:04,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 18:37:04,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:37:04,741 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 18:37:04,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 18:37:04,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-08 18:37:04,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-08 18:37:04,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 18:37:04,962 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 15 treesize of output 1 [2024-11-08 18:37:05,522 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 55 treesize of output 31 [2024-11-08 18:37:05,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-08 18:37:05,544 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 18:37:05,552 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 11 treesize of output 3 [2024-11-08 18:37:05,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-08 18:37:10,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:37:10,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 46 [2024-11-08 18:37:10,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:37:10,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:37:10,461 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2024-11-08 18:37:10,564 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 18:37:10,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-08 18:37:10,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:37:14,080 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-08 18:37:14,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 49 [2024-11-08 18:37:14,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-08 18:37:14,199 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2024-11-08 18:37:14,200 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 24 [2024-11-08 18:37:14,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 18:37:15,183 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:37:15,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:37:18,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:37:18,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 132 [2024-11-08 18:37:18,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283565085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:37:18,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:37:18,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 50 [2024-11-08 18:37:18,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168634052] [2024-11-08 18:37:18,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:37:18,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-08 18:37:18,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:37:18,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-08 18:37:18,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3085, Unknown=9, NotChecked=0, Total=3306 [2024-11-08 18:37:18,852 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 50 states, 48 states have (on average 1.5) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:37:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:37:30,655 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2024-11-08 18:37:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-08 18:37:30,656 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.5) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 43 [2024-11-08 18:37:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:37:30,657 INFO L225 Difference]: With dead ends: 87 [2024-11-08 18:37:30,657 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 18:37:30,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=494, Invalid=6979, Unknown=9, NotChecked=0, Total=7482 [2024-11-08 18:37:30,659 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:37:30,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 593 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-08 18:37:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 18:37:30,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 52. [2024-11-08 18:37:30,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:37:30,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2024-11-08 18:37:30,682 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2024-11-08 18:37:30,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:37:30,682 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-08 18:37:30,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.5) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:37:30,683 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2024-11-08 18:37:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 18:37:30,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:37:30,684 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:37:30,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 18:37:30,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 18:37:30,889 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:37:30,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:37:30,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1071784839, now seen corresponding path program 1 times [2024-11-08 18:37:30,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:37:30,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40944799] [2024-11-08 18:37:30,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:37:30,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:37:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:35,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 18:37:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:36,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 18:37:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:36,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:37:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:37:37,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:37:37,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40944799] [2024-11-08 18:37:37,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40944799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:37:37,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601761982] [2024-11-08 18:37:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:37:37,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:37:37,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:37:37,736 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:37:37,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 18:37:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:38,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-08 18:37:38,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:37:38,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 18:37:38,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:37:38,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 18:37:43,958 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1) (or (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (= (select (select |v_#memory_int#1_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))))) is different from false [2024-11-08 18:37:43,966 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1) (or (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (= (select (select |v_#memory_int#1_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))))) is different from true [2024-11-08 18:37:44,091 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 18:37:44,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-08 18:37:44,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:37:44,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 18:37:44,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1))))) is different from false [2024-11-08 18:37:44,271 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1))))) is different from true [2024-11-08 18:37:44,492 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|)))) is different from false [2024-11-08 18:37:44,499 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|)))) is different from true [2024-11-08 18:37:44,630 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0)))) is different from false [2024-11-08 18:37:44,638 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0)))) is different from true [2024-11-08 18:37:44,665 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 45 treesize of output 21 [2024-11-08 18:37:44,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 18:37:44,696 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 11 treesize of output 3 [2024-11-08 18:37:44,786 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-08 18:37:44,793 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-08 18:37:44,891 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-08 18:37:44,898 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-08 18:37:45,141 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_72| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_72|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_72| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_72|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_72|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_72| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_72|)))))) is different from false [2024-11-08 18:37:45,151 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_72| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_72|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_72| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_72|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_72|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_72| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_72|)))))) is different from true [2024-11-08 18:37:45,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:37:45,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2024-11-08 18:37:45,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:37:45,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2024-11-08 18:37:45,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:37:45,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:37:45,543 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 0))) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) (= .cse2 .cse4)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0)))) is different from false [2024-11-08 18:37:45,552 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 0))) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) (= .cse2 .cse4)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0)))) is different from true [2024-11-08 18:37:45,984 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 0))) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) (= .cse2 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse4 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)))) is different from false [2024-11-08 18:37:45,993 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 0))) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) (= .cse2 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse4 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)))) is different from true [2024-11-08 18:37:46,384 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 0))) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) (= .cse2 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|)))) is different from false [2024-11-08 18:37:46,393 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 0))) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) (= .cse2 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|)))) is different from true [2024-11-08 18:37:47,000 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-08 18:37:47,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 83 [2024-11-08 18:37:47,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 35 [2024-11-08 18:37:47,157 INFO L349 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2024-11-08 18:37:47,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2024-11-08 18:37:47,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse5 (= .cse2 .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 0))) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse5) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) .cse5))))) is different from false [2024-11-08 18:37:47,231 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse5 (= .cse2 .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 0))) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse5) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) .cse5))))) is different from true [2024-11-08 18:37:47,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:37:47,300 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 115 treesize of output 75 [2024-11-08 18:37:47,379 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 18:37:47,380 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 15 treesize of output 7 [2024-11-08 18:37:47,451 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse2 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1)))) is different from false [2024-11-08 18:37:47,458 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse2 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1)))) is different from true [2024-11-08 18:37:47,588 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 51 treesize of output 31 [2024-11-08 18:37:47,604 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 19 treesize of output 11 [2024-11-08 18:37:47,731 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 1)))) is different from false [2024-11-08 18:37:47,738 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 1)))) is different from true [2024-11-08 18:37:47,822 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2024-11-08 18:37:47,830 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2024-11-08 18:37:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2024-11-08 18:37:48,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:37:48,679 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1492 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1493) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1492) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1494) .cse0) .cse1)))) (not (= v_ArrVal_1493 (let ((.cse2 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2 (select v_ArrVal_1493 .cse2))))))) is different from false [2024-11-08 18:37:48,768 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1492 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2))) (or (not (= (let ((.cse1 (+ 4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2)))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1493 .cse1))) v_ArrVal_1493)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| .cse0 v_ArrVal_1493) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1492) .cse3) .cse4)) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1494) .cse3) .cse4)))))))) is different from false [2024-11-08 18:37:48,841 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1492 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3))) (or (not (= (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3) 4))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1493 .cse1))) v_ArrVal_1493)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| .cse0 v_ArrVal_1493) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1492) .cse4) .cse5)) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1494) .cse4) .cse5)))))))) is different from false [2024-11-08 18:37:49,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601761982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:37:49,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:37:49,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 47 [2024-11-08 18:37:49,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116371655] [2024-11-08 18:37:49,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:37:49,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-08 18:37:49,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:37:49,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-08 18:37:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1165, Unknown=31, NotChecked=1428, Total=2756 [2024-11-08 18:37:49,653 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 47 states, 45 states have (on average 1.511111111111111) internal successors, (68), 39 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:37:51,243 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1) (or .cse0 (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse3 (select |c_#memory_int#1| .cse3))) (= (select (select |v_#memory_int#1_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= .cse3 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))))))) is different from false [2024-11-08 18:37:51,252 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1) (or .cse0 (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse3 (select |c_#memory_int#1| .cse3))) (= (select (select |v_#memory_int#1_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= .cse3 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))))))) is different from true [2024-11-08 18:37:51,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= .cse1 1) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1)))))) is different from false [2024-11-08 18:37:51,271 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= .cse1 1) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1)))))) is different from true [2024-11-08 18:37:51,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= .cse1 1) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1)))))) is different from false [2024-11-08 18:37:51,289 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= .cse1 1) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1)))))) is different from true [2024-11-08 18:37:51,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_int#1| .cse0) 0)) (.cse3 (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 1 (select |c_#valid| .cse0)) (not .cse3) (or (= .cse2 1) .cse3)))) is different from false [2024-11-08 18:37:51,307 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_int#1| .cse0) 0)) (.cse3 (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 1 (select |c_#valid| .cse0)) (not .cse3) (or (= .cse2 1) .cse3)))) is different from true [2024-11-08 18:37:51,318 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse2 (select .cse4 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse2)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= 1 (select |c_#valid| .cse3)) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_25| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)) (= (select |c_#valid| .cse6) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0))))) is different from false [2024-11-08 18:37:51,326 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse2 (select .cse4 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse2)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= 1 (select |c_#valid| .cse3)) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_25| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)) (= (select |c_#valid| .cse6) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0))))) is different from true [2024-11-08 18:37:51,336 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from false [2024-11-08 18:37:51,346 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from true [2024-11-08 18:37:51,358 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-08 18:37:51,365 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-08 18:37:51,387 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|))) (let ((.cse5 (store |c_old(#memory_int#1)| .cse4 (select |c_#memory_int#1| .cse4)))) (let ((.cse7 (= |c_#memory_int#1| .cse5)) (.cse6 (@diff .cse5 |c_#memory_int#1|)) (.cse3 (= |c_#memory_int#1| |c_old(#memory_int#1)|)) (.cse9 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (or .cse3 (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_int#1| (store .cse5 .cse6 (select |c_#memory_int#1| .cse6))) .cse7 (or .cse7 (= (select |c_old(#valid)| .cse6) 0)) (or .cse3 (= .cse4 |c_node_create_#res#1.base|)) (exists ((|v_node_create_~temp~0#1.base_72| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_72| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_72|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_72| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_72|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_72|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_72| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_72|))))) (= |c_#valid| (let ((.cse8 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse8 (select |c_#valid| .cse8)))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse9) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse9 (select |c_#memory_$Pointer$#1.offset| .cse9))) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 0)))))) is different from false [2024-11-08 18:37:51,401 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|))) (let ((.cse5 (store |c_old(#memory_int#1)| .cse4 (select |c_#memory_int#1| .cse4)))) (let ((.cse7 (= |c_#memory_int#1| .cse5)) (.cse6 (@diff .cse5 |c_#memory_int#1|)) (.cse3 (= |c_#memory_int#1| |c_old(#memory_int#1)|)) (.cse9 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse0) 0)))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (or .cse3 (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_int#1| (store .cse5 .cse6 (select |c_#memory_int#1| .cse6))) .cse7 (or .cse7 (= (select |c_old(#valid)| .cse6) 0)) (or .cse3 (= .cse4 |c_node_create_#res#1.base|)) (exists ((|v_node_create_~temp~0#1.base_72| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_72| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_72|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_72| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_72|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_72|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_72| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_72|))))) (= |c_#valid| (let ((.cse8 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse8 (select |c_#valid| .cse8)))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse9) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse9 (select |c_#memory_$Pointer$#1.offset| .cse9))) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 0)))))) is different from true [2024-11-08 18:37:51,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse5 (select .cse7 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse5)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (not (= .cse6 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse6) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4) 0))))) is different from false [2024-11-08 18:37:51,437 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse5 (select .cse7 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse5)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (not (= .cse6 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse6) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4) 0))))) is different from true [2024-11-08 18:37:51,457 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse5 (select .cse7 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse5)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (not (= .cse6 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse6) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4) 0))))) is different from false [2024-11-08 18:37:51,466 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse5 (select .cse7 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse5)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (not (= .cse6 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse6) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4) 0))))) is different from true [2024-11-08 18:37:51,487 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse7 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse5 (select |v_old(#valid)_AFTER_CALL_26| .cse5))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse6) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse4) 0) 1) (= .cse4 .cse6)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse6 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)))))) is different from false [2024-11-08 18:37:51,496 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse7 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse5 (select |v_old(#valid)_AFTER_CALL_26| .cse5))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse6) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse4) 0) 1) (= .cse4 .cse6)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse6 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)))))) is different from true [2024-11-08 18:37:51,533 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse7 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse5 (select |v_old(#valid)_AFTER_CALL_26| .cse5))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse6) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse4) 0) 1) (= .cse4 .cse6)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= .cse6 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)))))) is different from false [2024-11-08 18:37:51,543 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse7 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse5 (select |v_old(#valid)_AFTER_CALL_26| .cse5))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse6) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse4) 0) 1) (= .cse4 .cse6)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= .cse6 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)))))) is different from true [2024-11-08 18:37:51,565 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 0)) (.cse7 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)) (.cse8 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse5)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse8 .cse6)) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse7)) (or (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from false [2024-11-08 18:37:51,575 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 0)) (.cse7 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)) (.cse8 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse5)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse8 .cse6)) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse7)) (or (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from true [2024-11-08 18:37:51,596 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse10 0)) (.cse7 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)) (.cse8 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse5)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse8 .cse6)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8))) (or (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| .cse9)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| .cse9))) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse7)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from false [2024-11-08 18:37:51,606 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse10 0)) (.cse7 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)) (.cse8 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse5)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse8 .cse6)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8))) (or (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| .cse9)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| .cse9))) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse7)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from true [2024-11-08 18:37:51,627 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 0)) (.cse7 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)) (.cse8 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse5)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse8 .cse6)) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse7)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from false [2024-11-08 18:37:51,636 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 0)) (.cse7 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)) (.cse8 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse5)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse8 .cse6)) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse7)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from true [2024-11-08 18:37:51,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse8 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= .cse3 .cse5))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) .cse6) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) .cse6)))))) is different from false [2024-11-08 18:37:51,670 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse8 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= .cse3 .cse5))) (and (= (select .cse0 0) 0) (exists ((v_arrayElimCell_62 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_25| v_arrayElimCell_62) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_25| |v_#valid_BEFORE_CALL_13|))) (store |v_old(#valid)_AFTER_CALL_25| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_25| .cse1) 0)))) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) .cse6) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) .cse6)))))) is different from true [2024-11-08 18:37:51,719 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse3 (select |c_#memory_int#1| .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse2 (= (select .cse3 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 .cse4)) (or (= .cse4 0) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1)))) is different from false [2024-11-08 18:37:51,728 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse3 (select |c_#memory_int#1| .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse2 (= (select .cse3 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 .cse4)) (or (= .cse4 0) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1)))) is different from true [2024-11-08 18:37:51,846 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~temp~2#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 1))))) is different from false [2024-11-08 18:37:51,853 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~temp~2#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 1))))) is different from true [2024-11-08 18:37:51,880 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from false [2024-11-08 18:37:51,887 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|v_node_create_~temp~0#1.base_72| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |v_node_create_~temp~0#1.base_72|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_27| |v_old(#valid)_AFTER_CALL_26|))) (store |v_old(#valid)_AFTER_CALL_27| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1))) |v_old(#valid)_AFTER_CALL_26|) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from true [2024-11-08 18:37:52,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1) (or .cse0 (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse3 (select |c_#memory_int#1| .cse3))) (= (select (select |v_#memory_int#1_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= .cse3 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))))))) is different from false [2024-11-08 18:37:52,214 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_25| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_25| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_25| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_25| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1) (or .cse0 (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse3 (select |c_#memory_int#1| .cse3))) (= (select (select |v_#memory_int#1_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= .cse3 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))))))) is different from true [2024-11-08 18:37:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:37:52,436 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2024-11-08 18:37:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 18:37:52,437 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 1.511111111111111) internal successors, (68), 39 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2024-11-08 18:37:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:37:52,438 INFO L225 Difference]: With dead ends: 84 [2024-11-08 18:37:52,438 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 18:37:52,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 37 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=194, Invalid=1443, Unknown=71, NotChecked=4144, Total=5852 [2024-11-08 18:37:52,440 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1840 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:37:52,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 453 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 348 Invalid, 0 Unknown, 1840 Unchecked, 1.4s Time] [2024-11-08 18:37:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 18:37:52,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-08 18:37:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 72 states have internal predecessors, (83), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:37:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2024-11-08 18:37:52,467 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 44 [2024-11-08 18:37:52,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:37:52,467 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2024-11-08 18:37:52,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 1.511111111111111) internal successors, (68), 39 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:37:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2024-11-08 18:37:52,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 18:37:52,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:37:52,469 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:37:52,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 18:37:52,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 18:37:52,670 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:37:52,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:37:52,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1473005601, now seen corresponding path program 3 times [2024-11-08 18:37:52,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:37:52,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295255569] [2024-11-08 18:37:52,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:37:52,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:37:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:55,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 18:37:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:55,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 18:37:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:56,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:37:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:37:57,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:37:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295255569] [2024-11-08 18:37:57,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295255569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:37:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038943167] [2024-11-08 18:37:57,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 18:37:57,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:37:57,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:37:57,296 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:37:57,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 18:37:57,717 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 18:37:57,717 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:37:57,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-08 18:37:57,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:37:57,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 18:37:58,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:37:58,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:37:59,143 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 18:37:59,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-08 18:37:59,257 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 18:37:59,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 18:37:59,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 18:37:59,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-08 18:37:59,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 18:38:00,763 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 18:38:00,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-11-08 18:38:00,777 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 18:38:00,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-08 18:38:01,334 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_81| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_81| (store (store (select |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_81|) 4 0) 0 (select (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_81|) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_81| (store (store (select |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_81|) 4 0) 0 (select (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_81|) 0)))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_81|) 0))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0))) is different from true [2024-11-08 18:38:01,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:38:01,516 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-08 18:38:01,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 52 [2024-11-08 18:38:01,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:38:01,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:38:01,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2024-11-08 18:38:01,696 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 18:38:01,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-08 18:38:02,297 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 85 treesize of output 53 [2024-11-08 18:38:03,389 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2024-11-08 18:38:03,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 34 [2024-11-08 18:38:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2024-11-08 18:38:03,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:38:05,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038943167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:38:05,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:38:05,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2024-11-08 18:38:05,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987219431] [2024-11-08 18:38:05,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:38:05,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-08 18:38:05,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:38:05,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-08 18:38:05,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1513, Unknown=1, NotChecked=78, Total=1722 [2024-11-08 18:38:05,312 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand has 37 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 30 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:38:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:38:08,884 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2024-11-08 18:38:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 18:38:08,885 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 30 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2024-11-08 18:38:08,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:38:08,888 INFO L225 Difference]: With dead ends: 119 [2024-11-08 18:38:08,888 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 18:38:08,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=171, Invalid=1994, Unknown=1, NotChecked=90, Total=2256 [2024-11-08 18:38:08,890 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:38:08,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 424 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 583 Invalid, 0 Unknown, 60 Unchecked, 2.4s Time] [2024-11-08 18:38:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 18:38:08,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-11-08 18:38:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.130952380952381) internal successors, (95), 84 states have internal predecessors, (95), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 18:38:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2024-11-08 18:38:08,928 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 45 [2024-11-08 18:38:08,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:38:08,929 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2024-11-08 18:38:08,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 30 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:38:08,929 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2024-11-08 18:38:08,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 18:38:08,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:38:08,931 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:38:08,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-08 18:38:09,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 18:38:09,131 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:38:09,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:38:09,132 INFO L85 PathProgramCache]: Analyzing trace with hash 806962131, now seen corresponding path program 1 times [2024-11-08 18:38:09,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:38:09,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812657625] [2024-11-08 18:38:09,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:38:09,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:38:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:38:12,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 18:38:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:38:13,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 18:38:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:38:13,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:38:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:38:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:38:14,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:38:14,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812657625] [2024-11-08 18:38:14,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812657625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:38:14,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839975469] [2024-11-08 18:38:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:38:14,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:38:14,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:38:14,216 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:38:14,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 18:38:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:38:14,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 123 conjuncts are in the unsatisfiable core [2024-11-08 18:38:14,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:38:14,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 18:38:16,403 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 18:38:16,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 18:38:16,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:38:16,718 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 15 treesize of output 1 [2024-11-08 18:38:17,697 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 30 treesize of output 14 [2024-11-08 18:38:17,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 18:38:17,721 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 18:38:18,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:38:18,887 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 38 treesize of output 27 [2024-11-08 18:38:18,981 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 18:38:18,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-08 18:38:19,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:38:22,031 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-08 18:38:22,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 80 [2024-11-08 18:38:22,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2024-11-08 18:38:22,446 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 94 treesize of output 62 [2024-11-08 18:38:22,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:38:22,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-08 18:38:23,762 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:38:23,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2024-11-08 18:38:23,778 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:38:23,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:38:27,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839975469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:38:27,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:38:27,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 49 [2024-11-08 18:38:27,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938660902] [2024-11-08 18:38:27,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:38:27,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-08 18:38:27,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:38:27,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-08 18:38:27,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3334, Unknown=4, NotChecked=0, Total=3540 [2024-11-08 18:38:27,495 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 49 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 40 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:38:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:38:34,312 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2024-11-08 18:38:34,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 18:38:34,313 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 40 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2024-11-08 18:38:34,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:38:34,314 INFO L225 Difference]: With dead ends: 117 [2024-11-08 18:38:34,314 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 18:38:34,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=336, Invalid=5360, Unknown=4, NotChecked=0, Total=5700 [2024-11-08 18:38:34,318 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 74 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:38:34,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 587 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 18:38:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 18:38:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2024-11-08 18:38:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 86 states have (on average 1.127906976744186) internal successors, (97), 86 states have internal predecessors, (97), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 18:38:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2024-11-08 18:38:34,341 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 46 [2024-11-08 18:38:34,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:38:34,341 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2024-11-08 18:38:34,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 40 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:38:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2024-11-08 18:38:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 18:38:34,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:38:34,343 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:38:34,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 18:38:34,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 18:38:34,548 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:38:34,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:38:34,548 INFO L85 PathProgramCache]: Analyzing trace with hash -754346475, now seen corresponding path program 2 times [2024-11-08 18:38:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:38:34,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957426254] [2024-11-08 18:38:34,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:38:34,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:38:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:38:39,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 18:38:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:38:39,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 18:38:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:38:40,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:38:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:38:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:38:41,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:38:41,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957426254] [2024-11-08 18:38:41,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957426254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:38:41,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698978254] [2024-11-08 18:38:41,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:38:41,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:38:41,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:38:41,008 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:38:41,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 18:38:41,336 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:38:41,336 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:38:41,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 140 conjuncts are in the unsatisfiable core [2024-11-08 18:38:41,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:38:41,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 18:38:42,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:38:42,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:38:47,587 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| |c_#memory_$Pointer$#1.offset|))) (and (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| .cse0 (select |c_#memory_$Pointer$#1.offset| .cse0))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse0))))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from false [2024-11-08 18:38:47,593 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| |c_#memory_$Pointer$#1.offset|))) (and (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| .cse0 (select |c_#memory_$Pointer$#1.offset| .cse0))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse0))))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from true [2024-11-08 18:38:47,678 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-08 18:38:47,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2024-11-08 18:38:47,778 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-08 18:38:47,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-11-08 18:38:47,830 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_#memory_$Pointer$#1.offset_117| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_117| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#1.offset_117| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| |v_#memory_$Pointer$#1.offset_117|))) (and (= (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| .cse0 (select |v_#memory_$Pointer$#1.offset_117| .cse0)) |v_#memory_$Pointer$#1.offset_117|) (= 0 (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| .cse1) 4)) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0)))))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0))) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (not (= .cse1 0)) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-08 18:38:47,837 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_#memory_$Pointer$#1.offset_117| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_117| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#1.offset_117| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| |v_#memory_$Pointer$#1.offset_117|))) (and (= (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| .cse0 (select |v_#memory_$Pointer$#1.offset_117| .cse0)) |v_#memory_$Pointer$#1.offset_117|) (= 0 (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_16| .cse1) 4)) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0)))))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0))) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (not (= .cse1 0)) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-08 18:38:47,925 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-08 18:38:47,930 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-08 18:38:48,003 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_create_#res#1.base|)) (not (= .cse1 0)))) is different from false [2024-11-08 18:38:48,008 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_create_#res#1.base|)) (not (= .cse1 0)))) is different from true [2024-11-08 18:38:48,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~data#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 0)) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1)))))) is different from false [2024-11-08 18:38:48,100 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~data#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 0)) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1)))))) is different from true [2024-11-08 18:38:48,120 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 18:38:48,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 31 [2024-11-08 18:38:48,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:38:48,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-08 18:38:48,198 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse1)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse1))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-08 18:38:48,203 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse1)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse1))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-08 18:38:48,281 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse1)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse1))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-08 18:38:48,286 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse1)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse1))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-08 18:38:48,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:38:48,456 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse1)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse1))))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 0))) is different from false [2024-11-08 18:38:48,461 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse1)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse1))))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 0))) is different from true [2024-11-08 18:38:48,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:38:48,647 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 18:38:48,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 57 [2024-11-08 18:38:48,821 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-11-08 18:38:48,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 73 [2024-11-08 18:38:48,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_36| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_old(#valid)_AFTER_CALL_36| .cse1))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (not (= .cse2 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse4)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse4))))) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0) (= .cse2 .cse0)) (or (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0))))) is different from false [2024-11-08 18:38:48,924 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_36| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_old(#valid)_AFTER_CALL_36| .cse1))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (not (= .cse2 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse4)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse4))))) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0) (= .cse2 .cse0)) (or (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0))))) is different from true [2024-11-08 18:38:49,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (or (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_old(#valid)_AFTER_CALL_36| .cse2))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_36| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 1))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1) (not (= .cse1 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse4)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse4))))) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= .cse1 .cse0))))) is different from false [2024-11-08 18:38:49,112 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (or (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_old(#valid)_AFTER_CALL_36| .cse2))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_36| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 1))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1) (not (= .cse1 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse4)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse4))))) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= .cse1 .cse0))))) is different from true [2024-11-08 18:38:49,602 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (or (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_old(#valid)_AFTER_CALL_36| .cse2))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_36| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 1))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1) (not (= .cse1 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse4)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse4))))) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= .cse1 .cse0))))) is different from false [2024-11-08 18:38:49,609 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (or (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_old(#valid)_AFTER_CALL_36| .cse2))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_36| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 1))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1) (not (= .cse1 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse4)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse4))))) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= .cse1 .cse0))))) is different from true [2024-11-08 18:38:49,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (or (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_old(#valid)_AFTER_CALL_36| .cse2))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_36| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 1))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1) (not (= .cse1 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse4)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse4))))) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= .cse1 .cse0))))) is different from false [2024-11-08 18:38:49,830 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (or (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_old(#valid)_AFTER_CALL_36| .cse2))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_36| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 1))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1) (not (= .cse1 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse4)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse4))))) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= .cse1 .cse0))))) is different from true [2024-11-08 18:38:50,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (or (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_old(#valid)_AFTER_CALL_36| .cse2))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_36| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 1))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1) (not (= .cse1 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse4)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse4))))) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= .cse1 .cse0))))) is different from false [2024-11-08 18:38:50,066 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (or (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_old(#valid)_AFTER_CALL_36| .cse2))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_36| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 1))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) 1) (not (= .cse1 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse4)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse4))))) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= .cse1 .cse0))))) is different from true [2024-11-08 18:38:50,580 INFO L349 Elim1Store]: treesize reduction 156, result has 26.4 percent of original size [2024-11-08 18:38:50,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 260 treesize of output 187 [2024-11-08 18:38:50,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:38:50,764 INFO L349 Elim1Store]: treesize reduction 84, result has 24.3 percent of original size [2024-11-08 18:38:50,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 74 [2024-11-08 18:38:50,845 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-11-08 18:38:50,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2024-11-08 18:38:57,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse2)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse2))))) (let ((.cse13 (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse14 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0))) (or (and (= .cse3 0) (or (and (or (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse4)) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4))) (.cse7 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7))) (and (= (select |v_old(#valid)_AFTER_CALL_36| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7) 0) (= (select (select |c_#memory_int#1| .cse5) 0) 1) (not (= .cse6 |v_ULTIMATE.start_sll_append_~last~0#1.base_50|)))))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse8 (select |v_old(#valid)_AFTER_CALL_36| .cse8))) |v_old(#valid)_AFTER_CALL_36|))) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1))) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse4)) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse9 (select |v_old(#valid)_AFTER_CALL_36| .cse9))) |v_old(#valid)_AFTER_CALL_36|) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4))) (.cse12 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| .cse11) .cse12))) (and (= (select |v_old(#valid)_AFTER_CALL_36| .cse10) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse11) .cse12) 0) (= .cse11 .cse10) (not (= .cse11 |v_ULTIMATE.start_sll_append_~last~0#1.base_50|))))))))))) .cse13 .cse14) (and (let ((.cse15 (select |c_#memory_$Pointer$#1.offset| 0)) (.cse17 (select |c_#memory_$Pointer$#1.base| 0))) (or (and .cse13 (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int)) (let ((.cse16 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (and (= (select .cse15 .cse16) 0) (= (select .cse17 .cse16) 0)))) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse4)) (= (select |v_old(#valid)_AFTER_CALL_36| 0) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (let ((.cse18 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse18 (select |v_old(#valid)_AFTER_CALL_36| .cse18))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1)))) (and .cse13 (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (let ((.cse19 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse20 (select .cse17 .cse19))) (and (= (select .cse15 .cse19) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse4)) (= (select (select |c_#memory_int#1| .cse20) 0) 1) (= (select |v_old(#valid)_AFTER_CALL_36| .cse20) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (let ((.cse21 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse21 (select |v_old(#valid)_AFTER_CALL_36| .cse21))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1)))))))) .cse14) (and .cse13 (or (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse4)) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4))) (.cse24 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| .cse23) .cse24))) (and (= (select |v_old(#valid)_AFTER_CALL_36| .cse22) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse23) .cse24) 0) (= (select (select |c_#memory_int#1| .cse22) 0) 1) (not (= |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| |v_ULTIMATE.start_sll_append_~last~0#1.offset_51|)))))) (= (let ((.cse25 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse25 (select |v_old(#valid)_AFTER_CALL_36| .cse25))) |v_old(#valid)_AFTER_CALL_36|))) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1))) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse4)) (= (let ((.cse26 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse26 (select |v_old(#valid)_AFTER_CALL_36| .cse26))) |v_old(#valid)_AFTER_CALL_36|) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (let ((.cse28 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4))) (.cse29 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse27 (select (select |c_#memory_$Pointer$#1.base| .cse28) .cse29))) (and (= (select |v_old(#valid)_AFTER_CALL_36| .cse27) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse28) .cse29) 0) (not (= |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| |v_ULTIMATE.start_sll_append_~last~0#1.offset_51|)) (= .cse28 .cse27))))))) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1)))) .cse14))) (and (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse4)) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (let ((.cse30 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse30 (select |v_old(#valid)_AFTER_CALL_36| .cse30))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_36| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1))) .cse13 (= (select (select |c_#memory_int#1| .cse3) 0) 1) .cse14 (or (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) .cse0) (not (= |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 0)))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) .cse0) (not (= |v_ULTIMATE.start_sll_append_~last~0#1.base_50| .cse0))))))))))) is different from false [2024-11-08 18:38:57,277 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (v_arrayElimIndex_9 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_23|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| v_arrayElimIndex_9) 1) (not (= v_arrayElimIndex_9 0)) (= 0 (select |v_#valid_BEFORE_CALL_24| .cse2)) (= 1 (select |v_#valid_BEFORE_CALL_25| .cse2))))) (let ((.cse13 (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse14 (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0))) (or (and (= .cse3 0) (or (and (or (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse4)) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4))) (.cse7 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7))) (and (= (select |v_old(#valid)_AFTER_CALL_36| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7) 0) (= (select (select |c_#memory_int#1| .cse5) 0) 1) (not (= .cse6 |v_ULTIMATE.start_sll_append_~last~0#1.base_50|)))))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse8 (select |v_old(#valid)_AFTER_CALL_36| .cse8))) |v_old(#valid)_AFTER_CALL_36|))) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1))) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse4)) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse9 (select |v_old(#valid)_AFTER_CALL_36| .cse9))) |v_old(#valid)_AFTER_CALL_36|) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4))) (.cse12 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| .cse11) .cse12))) (and (= (select |v_old(#valid)_AFTER_CALL_36| .cse10) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse11) .cse12) 0) (= .cse11 .cse10) (not (= .cse11 |v_ULTIMATE.start_sll_append_~last~0#1.base_50|))))))))))) .cse13 .cse14) (and (let ((.cse15 (select |c_#memory_$Pointer$#1.offset| 0)) (.cse17 (select |c_#memory_$Pointer$#1.base| 0))) (or (and .cse13 (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int)) (let ((.cse16 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (and (= (select .cse15 .cse16) 0) (= (select .cse17 .cse16) 0)))) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse4)) (= (select |v_old(#valid)_AFTER_CALL_36| 0) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (let ((.cse18 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse18 (select |v_old(#valid)_AFTER_CALL_36| .cse18))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1)))) (and .cse13 (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (let ((.cse19 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse20 (select .cse17 .cse19))) (and (= (select .cse15 .cse19) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse4)) (= (select (select |c_#memory_int#1| .cse20) 0) 1) (= (select |v_old(#valid)_AFTER_CALL_36| .cse20) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (let ((.cse21 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse21 (select |v_old(#valid)_AFTER_CALL_36| .cse21))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1)))))))) .cse14) (and .cse13 (or (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse4)) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4))) (.cse24 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| .cse23) .cse24))) (and (= (select |v_old(#valid)_AFTER_CALL_36| .cse22) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse23) .cse24) 0) (= (select (select |c_#memory_int#1| .cse22) 0) 1) (not (= |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| |v_ULTIMATE.start_sll_append_~last~0#1.offset_51|)))))) (= (let ((.cse25 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse25 (select |v_old(#valid)_AFTER_CALL_36| .cse25))) |v_old(#valid)_AFTER_CALL_36|))) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1))) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse4)) (= (let ((.cse26 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse26 (select |v_old(#valid)_AFTER_CALL_36| .cse26))) |v_old(#valid)_AFTER_CALL_36|) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (let ((.cse28 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4))) (.cse29 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse27 (select (select |c_#memory_$Pointer$#1.base| .cse28) .cse29))) (and (= (select |v_old(#valid)_AFTER_CALL_36| .cse27) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse28) .cse29) 0) (not (= |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| |v_ULTIMATE.start_sll_append_~last~0#1.offset_51|)) (= .cse28 .cse27))))))) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1)))) .cse14))) (and (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= 1 (select |v_old(#valid)_AFTER_CALL_36| .cse4)) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (let ((.cse30 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse30 (select |v_old(#valid)_AFTER_CALL_36| .cse30))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_36| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1))) .cse13 (= (select (select |c_#memory_int#1| .cse3) 0) 1) .cse14 (or (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) .cse0) (not (= |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 0)))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) .cse0) (not (= |v_ULTIMATE.start_sll_append_~last~0#1.base_50| .cse0))))))))))) is different from true [2024-11-08 18:38:57,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:38:57,705 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 870 treesize of output 722 [2024-11-08 18:38:58,345 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 18:38:58,345 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 15 treesize of output 7 [2024-11-08 18:39:02,394 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse2 (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)))) (or (and (= .cse0 0) (or (and .cse1 (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| 0)) (.cse8 (select |c_#memory_$Pointer$#1.base| 0))) (or (and .cse2 (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (v_prenex_141 (Array Int Int)) (v_prenex_142 (Array Int Int))) (let ((.cse4 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse6 (select .cse8 .cse4))) (and (= (select .cse3 .cse4) 0) (= (select v_prenex_142 .cse5) 1) (= (select (select |c_#memory_int#1| .cse6) 0) 1) (= (let ((.cse7 (@diff v_prenex_142 v_prenex_141))) (store v_prenex_142 .cse7 (select v_prenex_141 .cse7))) v_prenex_141) (= (select v_prenex_141 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_142 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_141 .cse6) 0)))))) (and (exists ((v_prenex_119 Int)) (let ((.cse9 (+ v_prenex_119 4))) (and (= (select .cse3 .cse9) 0) (= (select .cse8 .cse9) 0)))) (exists ((v_prenex_120 (Array Int Int)) (v_prenex_121 (Array Int Int))) (and (= (select v_prenex_121 .cse5) 1) (= (select v_prenex_121 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_120 0) 0) (= v_prenex_120 (let ((.cse10 (@diff v_prenex_121 v_prenex_120))) (store v_prenex_121 .cse10 (select v_prenex_120 .cse10)))) (= (select v_prenex_120 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) .cse2)))) (and .cse1 .cse2 (or (exists ((v_prenex_126 Int) (v_prenex_123 Int) (v_prenex_122 Int) (v_prenex_124 (Array Int Int)) (v_prenex_125 (Array Int Int))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| v_prenex_126) (+ v_prenex_122 4))) (.cse14 (+ v_prenex_123 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse13) .cse14))) (and (= (select v_prenex_124 .cse11) 0) (= (select v_prenex_125 .cse5) 1) (= (select v_prenex_124 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_125 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= v_prenex_124 (let ((.cse12 (@diff v_prenex_125 v_prenex_124))) (store v_prenex_125 .cse12 (select v_prenex_124 .cse12)))) (= .cse11 .cse13) (= (select (select |c_#memory_$Pointer$#1.offset| .cse13) .cse14) 0) (not (= v_prenex_123 v_prenex_122)))))) (exists ((v_prenex_143 Int) (v_prenex_132 Int) (v_prenex_133 (Array Int Int)) (v_prenex_134 (Array Int Int)) (v_prenex_140 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| v_prenex_143) (+ v_prenex_140 4))) (.cse16 (+ v_prenex_132 4))) (let ((.cse18 (select (select |c_#memory_$Pointer$#1.base| .cse15) .cse16))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse15) .cse16) 0) (= (select v_prenex_134 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= v_prenex_133 (let ((.cse17 (@diff v_prenex_134 v_prenex_133))) (store v_prenex_134 .cse17 (select v_prenex_133 .cse17)))) (= 1 (select (select |c_#memory_int#1| .cse18) 0)) (= (select v_prenex_134 .cse5) 1) (= (select v_prenex_133 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_133 .cse18) 0) (not (= v_prenex_132 v_prenex_140)))))))) (and (or (exists ((v_prenex_127 Int) (v_prenex_129 (Array Int Int)) (v_prenex_128 Int) (v_prenex_130 (Array Int Int)) (v_prenex_131 Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$#1.base| v_prenex_131) (+ v_prenex_127 4))) (.cse20 (+ v_prenex_128 4))) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| .cse19) .cse20))) (and (not (= .cse19 v_prenex_131)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse19) .cse20) 0) (= (let ((.cse21 (@diff v_prenex_130 v_prenex_129))) (store v_prenex_130 .cse21 (select v_prenex_129 .cse21))) v_prenex_129) (= (select v_prenex_130 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_130 .cse5) 1) (= (select v_prenex_129 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_129 .cse22) 0) (= (select (select |c_#memory_int#1| .cse22) 0) 1))))) (exists ((v_prenex_139 Int) (v_prenex_136 Int) (v_prenex_135 Int) (v_prenex_137 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse24 (select (select |c_#memory_$Pointer$#1.base| v_prenex_139) (+ v_prenex_135 4))) (.cse26 (+ v_prenex_136 4))) (let ((.cse23 (select (select |c_#memory_$Pointer$#1.base| .cse24) .cse26))) (and (= (select v_prenex_137 .cse23) 0) (not (= .cse24 v_prenex_139)) (= .cse24 .cse23) (= (select v_prenex_138 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_137 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_138 .cse5) 1) (= v_prenex_137 (let ((.cse25 (@diff v_prenex_138 v_prenex_137))) (store v_prenex_138 .cse25 (select v_prenex_137 .cse25)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse24) .cse26) 0)))))) .cse1 .cse2))) (and (or (exists ((v_prenex_117 Int) (v_prenex_118 Int)) (and (= .cse5 (select (select |c_#memory_$Pointer$#1.base| v_prenex_118) (+ v_prenex_117 4))) (not (= v_prenex_117 0)))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) .cse5) (not (= |v_ULTIMATE.start_sll_append_~last~0#1.base_50| .cse5))))) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_36| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_36| .cse0) 0) (= (let ((.cse27 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse27 (select |v_old(#valid)_AFTER_CALL_36| .cse27))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) .cse2))) (not (= .cse5 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from false [2024-11-08 18:39:02,409 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse2 (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)))) (or (and (= .cse0 0) (or (and .cse1 (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| 0)) (.cse8 (select |c_#memory_$Pointer$#1.base| 0))) (or (and .cse2 (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (v_prenex_141 (Array Int Int)) (v_prenex_142 (Array Int Int))) (let ((.cse4 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse6 (select .cse8 .cse4))) (and (= (select .cse3 .cse4) 0) (= (select v_prenex_142 .cse5) 1) (= (select (select |c_#memory_int#1| .cse6) 0) 1) (= (let ((.cse7 (@diff v_prenex_142 v_prenex_141))) (store v_prenex_142 .cse7 (select v_prenex_141 .cse7))) v_prenex_141) (= (select v_prenex_141 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_142 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_141 .cse6) 0)))))) (and (exists ((v_prenex_119 Int)) (let ((.cse9 (+ v_prenex_119 4))) (and (= (select .cse3 .cse9) 0) (= (select .cse8 .cse9) 0)))) (exists ((v_prenex_120 (Array Int Int)) (v_prenex_121 (Array Int Int))) (and (= (select v_prenex_121 .cse5) 1) (= (select v_prenex_121 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_120 0) 0) (= v_prenex_120 (let ((.cse10 (@diff v_prenex_121 v_prenex_120))) (store v_prenex_121 .cse10 (select v_prenex_120 .cse10)))) (= (select v_prenex_120 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) .cse2)))) (and .cse1 .cse2 (or (exists ((v_prenex_126 Int) (v_prenex_123 Int) (v_prenex_122 Int) (v_prenex_124 (Array Int Int)) (v_prenex_125 (Array Int Int))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| v_prenex_126) (+ v_prenex_122 4))) (.cse14 (+ v_prenex_123 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse13) .cse14))) (and (= (select v_prenex_124 .cse11) 0) (= (select v_prenex_125 .cse5) 1) (= (select v_prenex_124 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_125 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= v_prenex_124 (let ((.cse12 (@diff v_prenex_125 v_prenex_124))) (store v_prenex_125 .cse12 (select v_prenex_124 .cse12)))) (= .cse11 .cse13) (= (select (select |c_#memory_$Pointer$#1.offset| .cse13) .cse14) 0) (not (= v_prenex_123 v_prenex_122)))))) (exists ((v_prenex_143 Int) (v_prenex_132 Int) (v_prenex_133 (Array Int Int)) (v_prenex_134 (Array Int Int)) (v_prenex_140 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| v_prenex_143) (+ v_prenex_140 4))) (.cse16 (+ v_prenex_132 4))) (let ((.cse18 (select (select |c_#memory_$Pointer$#1.base| .cse15) .cse16))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse15) .cse16) 0) (= (select v_prenex_134 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= v_prenex_133 (let ((.cse17 (@diff v_prenex_134 v_prenex_133))) (store v_prenex_134 .cse17 (select v_prenex_133 .cse17)))) (= 1 (select (select |c_#memory_int#1| .cse18) 0)) (= (select v_prenex_134 .cse5) 1) (= (select v_prenex_133 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_133 .cse18) 0) (not (= v_prenex_132 v_prenex_140)))))))) (and (or (exists ((v_prenex_127 Int) (v_prenex_129 (Array Int Int)) (v_prenex_128 Int) (v_prenex_130 (Array Int Int)) (v_prenex_131 Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$#1.base| v_prenex_131) (+ v_prenex_127 4))) (.cse20 (+ v_prenex_128 4))) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| .cse19) .cse20))) (and (not (= .cse19 v_prenex_131)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse19) .cse20) 0) (= (let ((.cse21 (@diff v_prenex_130 v_prenex_129))) (store v_prenex_130 .cse21 (select v_prenex_129 .cse21))) v_prenex_129) (= (select v_prenex_130 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_130 .cse5) 1) (= (select v_prenex_129 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_129 .cse22) 0) (= (select (select |c_#memory_int#1| .cse22) 0) 1))))) (exists ((v_prenex_139 Int) (v_prenex_136 Int) (v_prenex_135 Int) (v_prenex_137 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse24 (select (select |c_#memory_$Pointer$#1.base| v_prenex_139) (+ v_prenex_135 4))) (.cse26 (+ v_prenex_136 4))) (let ((.cse23 (select (select |c_#memory_$Pointer$#1.base| .cse24) .cse26))) (and (= (select v_prenex_137 .cse23) 0) (not (= .cse24 v_prenex_139)) (= .cse24 .cse23) (= (select v_prenex_138 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_137 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_138 .cse5) 1) (= v_prenex_137 (let ((.cse25 (@diff v_prenex_138 v_prenex_137))) (store v_prenex_138 .cse25 (select v_prenex_137 .cse25)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse24) .cse26) 0)))))) .cse1 .cse2))) (and (or (exists ((v_prenex_117 Int) (v_prenex_118 Int)) (and (= .cse5 (select (select |c_#memory_$Pointer$#1.base| v_prenex_118) (+ v_prenex_117 4))) (not (= v_prenex_117 0)))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (and (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) .cse5) (not (= |v_ULTIMATE.start_sll_append_~last~0#1.base_50| .cse5))))) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_36| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_36| .cse0) 0) (= (let ((.cse27 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse27 (select |v_old(#valid)_AFTER_CALL_36| .cse27))) |v_old(#valid)_AFTER_CALL_36|) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) .cse2))) (not (= .cse5 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from true [2024-11-08 18:39:08,496 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse10 (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) (or (and (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (exists ((v_prenex_126 Int) (v_prenex_123 Int) (v_prenex_122 Int) (v_prenex_124 (Array Int Int)) (v_prenex_125 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| v_prenex_126) (+ v_prenex_122 4))) (.cse4 (+ v_prenex_123 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4))) (and (= (select v_prenex_125 .cse0) 1) (= (select v_prenex_125 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select v_prenex_124 .cse1) 0) (= v_prenex_124 (let ((.cse2 (@diff v_prenex_125 v_prenex_124))) (store v_prenex_125 .cse2 (select v_prenex_124 .cse2)))) (= (select v_prenex_124 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= .cse1 .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) 0) (not (= v_prenex_123 v_prenex_122)))))) (= .cse0 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= .cse5 |c_ULTIMATE.start_main_~temp~2#1.base|) (exists ((v_prenex_143 Int) (v_prenex_132 Int) (v_prenex_133 (Array Int Int)) (v_prenex_134 (Array Int Int)) (v_prenex_140 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| v_prenex_143) (+ v_prenex_140 4))) (.cse7 (+ v_prenex_132 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7))) (and (= (select v_prenex_133 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select v_prenex_134 .cse5) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7) 0) (= (select v_prenex_134 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= v_prenex_133 (let ((.cse8 (@diff v_prenex_134 v_prenex_133))) (store v_prenex_134 .cse8 (select v_prenex_133 .cse8)))) (= 1 (select (select |c_#memory_int#1| .cse9) 0)) (= (select v_prenex_133 .cse9) 0) (not (= v_prenex_132 v_prenex_140)))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 4) 0) (not (= .cse5 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))) .cse10) (and (let ((.cse11 (select |c_#memory_$Pointer$#1.offset| 0)) (.cse13 (select |c_#memory_$Pointer$#1.base| 0))) (or (and (exists ((v_prenex_119 Int)) (let ((.cse12 (+ v_prenex_119 4))) (and (= (select .cse11 .cse12) 0) (= (select .cse13 .cse12) 0)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int) (v_prenex_120 (Array Int Int)) (v_prenex_121 (Array Int Int))) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= (select v_prenex_121 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= .cse14 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select v_prenex_120 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select v_prenex_120 0) 0) (= v_prenex_120 (let ((.cse15 (@diff v_prenex_121 v_prenex_120))) (store v_prenex_121 .cse15 (select v_prenex_120 .cse15)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse14) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse14) 4) 0) (= (select v_prenex_121 .cse14) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= .cse16 |c_ULTIMATE.start_main_~temp~2#1.base|) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (v_prenex_141 (Array Int Int)) (v_prenex_142 (Array Int Int))) (let ((.cse17 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse18 (select .cse13 .cse17))) (and (= (select .cse11 .cse17) 0) (= (select v_prenex_141 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select (select |c_#memory_int#1| .cse18) 0) 1) (= (select v_prenex_142 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (let ((.cse19 (@diff v_prenex_142 v_prenex_141))) (store v_prenex_142 .cse19 (select v_prenex_141 .cse19))) v_prenex_141) (= (select v_prenex_142 .cse16) 1) (= (select v_prenex_141 .cse18) 0))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse16) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse16) 4) 0) (not (= .cse16 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))))) .cse10) (and (or (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (let ((.cse20 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse20 (select |v_old(#valid)_AFTER_CALL_36| .cse20))) |v_old(#valid)_AFTER_CALL_36|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (let ((.cse21 (select (select |c_#memory_$Pointer$#1.base| .cse22) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_36| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select |v_old(#valid)_AFTER_CALL_36| .cse21) 0) (= .cse22 |c_ULTIMATE.start_main_~temp~2#1.base|) (= 1 (select |v_#valid_BEFORE_CALL_27| .cse22)) (= (select (select |c_#memory_int#1| .cse21) 0) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse22) 4) 0) (exists ((v_prenex_117 Int) (v_prenex_118 Int)) (and (= .cse22 (select (select |c_#memory_$Pointer$#1.base| v_prenex_118) (+ v_prenex_117 4))) (not (= v_prenex_117 0)))) (not (= .cse22 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))))) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (let ((.cse23 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse23 (select |v_old(#valid)_AFTER_CALL_36| .cse23))) |v_old(#valid)_AFTER_CALL_36|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse25 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (let ((.cse24 (select (select |c_#memory_$Pointer$#1.base| .cse25) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_36| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select |v_old(#valid)_AFTER_CALL_36| .cse24) 0) (= .cse25 |c_ULTIMATE.start_main_~temp~2#1.base|) (= 1 (select |v_#valid_BEFORE_CALL_27| .cse25)) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (and (not (= .cse25 |v_ULTIMATE.start_sll_append_~last~0#1.base_50|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) .cse25))) (= (select (select |c_#memory_int#1| .cse24) 0) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse25) 4) 0) (not (= .cse25 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))))))) .cse10) (and (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= .cse26 |c_ULTIMATE.start_main_~temp~2#1.base|) (exists ((v_prenex_127 Int) (v_prenex_129 (Array Int Int)) (v_prenex_128 Int) (v_prenex_130 (Array Int Int)) (v_prenex_131 Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$#1.base| v_prenex_131) (+ v_prenex_127 4))) (.cse28 (+ v_prenex_128 4))) (let ((.cse30 (select (select |c_#memory_$Pointer$#1.base| .cse27) .cse28))) (and (not (= .cse27 v_prenex_131)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse27) .cse28) 0) (= (select v_prenex_130 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (let ((.cse29 (@diff v_prenex_130 v_prenex_129))) (store v_prenex_130 .cse29 (select v_prenex_129 .cse29))) v_prenex_129) (= (select v_prenex_130 .cse26) 1) (= (select v_prenex_129 .cse30) 0) (= (select (select |c_#memory_int#1| .cse30) 0) 1) (= (select v_prenex_129 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse26) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse26) 4) 0) (not (= .cse26 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse31 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= .cse31 |c_ULTIMATE.start_main_~temp~2#1.base|) (exists ((v_prenex_139 Int) (v_prenex_136 Int) (v_prenex_135 Int) (v_prenex_137 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse33 (select (select |c_#memory_$Pointer$#1.base| v_prenex_139) (+ v_prenex_135 4))) (.cse35 (+ v_prenex_136 4))) (let ((.cse32 (select (select |c_#memory_$Pointer$#1.base| .cse33) .cse35))) (and (= (select v_prenex_137 .cse32) 0) (not (= .cse33 v_prenex_139)) (= .cse33 .cse32) (= (select v_prenex_137 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= v_prenex_137 (let ((.cse34 (@diff v_prenex_138 v_prenex_137))) (store v_prenex_138 .cse34 (select v_prenex_137 .cse34)))) (= (select v_prenex_138 .cse31) 1) (= (select v_prenex_138 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse33) .cse35) 0))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse31) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse31) 4) 0) (not (= .cse31 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))) .cse10)))) is different from false [2024-11-08 18:39:08,512 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse10 (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) (or (and (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (exists ((v_prenex_126 Int) (v_prenex_123 Int) (v_prenex_122 Int) (v_prenex_124 (Array Int Int)) (v_prenex_125 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| v_prenex_126) (+ v_prenex_122 4))) (.cse4 (+ v_prenex_123 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4))) (and (= (select v_prenex_125 .cse0) 1) (= (select v_prenex_125 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select v_prenex_124 .cse1) 0) (= v_prenex_124 (let ((.cse2 (@diff v_prenex_125 v_prenex_124))) (store v_prenex_125 .cse2 (select v_prenex_124 .cse2)))) (= (select v_prenex_124 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= .cse1 .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) 0) (not (= v_prenex_123 v_prenex_122)))))) (= .cse0 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= .cse5 |c_ULTIMATE.start_main_~temp~2#1.base|) (exists ((v_prenex_143 Int) (v_prenex_132 Int) (v_prenex_133 (Array Int Int)) (v_prenex_134 (Array Int Int)) (v_prenex_140 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| v_prenex_143) (+ v_prenex_140 4))) (.cse7 (+ v_prenex_132 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7))) (and (= (select v_prenex_133 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select v_prenex_134 .cse5) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7) 0) (= (select v_prenex_134 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= v_prenex_133 (let ((.cse8 (@diff v_prenex_134 v_prenex_133))) (store v_prenex_134 .cse8 (select v_prenex_133 .cse8)))) (= 1 (select (select |c_#memory_int#1| .cse9) 0)) (= (select v_prenex_133 .cse9) 0) (not (= v_prenex_132 v_prenex_140)))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 4) 0) (not (= .cse5 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))) .cse10) (and (let ((.cse11 (select |c_#memory_$Pointer$#1.offset| 0)) (.cse13 (select |c_#memory_$Pointer$#1.base| 0))) (or (and (exists ((v_prenex_119 Int)) (let ((.cse12 (+ v_prenex_119 4))) (and (= (select .cse11 .cse12) 0) (= (select .cse13 .cse12) 0)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int) (v_prenex_120 (Array Int Int)) (v_prenex_121 (Array Int Int))) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= (select v_prenex_121 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= .cse14 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select v_prenex_120 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select v_prenex_120 0) 0) (= v_prenex_120 (let ((.cse15 (@diff v_prenex_121 v_prenex_120))) (store v_prenex_121 .cse15 (select v_prenex_120 .cse15)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse14) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse14) 4) 0) (= (select v_prenex_121 .cse14) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= .cse16 |c_ULTIMATE.start_main_~temp~2#1.base|) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (v_prenex_141 (Array Int Int)) (v_prenex_142 (Array Int Int))) (let ((.cse17 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse18 (select .cse13 .cse17))) (and (= (select .cse11 .cse17) 0) (= (select v_prenex_141 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select (select |c_#memory_int#1| .cse18) 0) 1) (= (select v_prenex_142 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (let ((.cse19 (@diff v_prenex_142 v_prenex_141))) (store v_prenex_142 .cse19 (select v_prenex_141 .cse19))) v_prenex_141) (= (select v_prenex_142 .cse16) 1) (= (select v_prenex_141 .cse18) 0))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse16) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse16) 4) 0) (not (= .cse16 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))))) .cse10) (and (or (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (let ((.cse20 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse20 (select |v_old(#valid)_AFTER_CALL_36| .cse20))) |v_old(#valid)_AFTER_CALL_36|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (let ((.cse21 (select (select |c_#memory_$Pointer$#1.base| .cse22) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_36| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select |v_old(#valid)_AFTER_CALL_36| .cse21) 0) (= .cse22 |c_ULTIMATE.start_main_~temp~2#1.base|) (= 1 (select |v_#valid_BEFORE_CALL_27| .cse22)) (= (select (select |c_#memory_int#1| .cse21) 0) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse22) 4) 0) (exists ((v_prenex_117 Int) (v_prenex_118 Int)) (and (= .cse22 (select (select |c_#memory_$Pointer$#1.base| v_prenex_118) (+ v_prenex_117 4))) (not (= v_prenex_117 0)))) (not (= .cse22 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))))) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (let ((.cse23 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse23 (select |v_old(#valid)_AFTER_CALL_36| .cse23))) |v_old(#valid)_AFTER_CALL_36|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse25 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (let ((.cse24 (select (select |c_#memory_$Pointer$#1.base| .cse25) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_36| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select |v_old(#valid)_AFTER_CALL_36| .cse24) 0) (= .cse25 |c_ULTIMATE.start_main_~temp~2#1.base|) (= 1 (select |v_#valid_BEFORE_CALL_27| .cse25)) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (and (not (= .cse25 |v_ULTIMATE.start_sll_append_~last~0#1.base_50|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) .cse25))) (= (select (select |c_#memory_int#1| .cse24) 0) 1) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse25) 4) 0) (not (= .cse25 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))))))) .cse10) (and (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= .cse26 |c_ULTIMATE.start_main_~temp~2#1.base|) (exists ((v_prenex_127 Int) (v_prenex_129 (Array Int Int)) (v_prenex_128 Int) (v_prenex_130 (Array Int Int)) (v_prenex_131 Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$#1.base| v_prenex_131) (+ v_prenex_127 4))) (.cse28 (+ v_prenex_128 4))) (let ((.cse30 (select (select |c_#memory_$Pointer$#1.base| .cse27) .cse28))) (and (not (= .cse27 v_prenex_131)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse27) .cse28) 0) (= (select v_prenex_130 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (let ((.cse29 (@diff v_prenex_130 v_prenex_129))) (store v_prenex_130 .cse29 (select v_prenex_129 .cse29))) v_prenex_129) (= (select v_prenex_130 .cse26) 1) (= (select v_prenex_129 .cse30) 0) (= (select (select |c_#memory_int#1| .cse30) 0) 1) (= (select v_prenex_129 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse26) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse26) 4) 0) (not (= .cse26 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse31 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= .cse31 |c_ULTIMATE.start_main_~temp~2#1.base|) (exists ((v_prenex_139 Int) (v_prenex_136 Int) (v_prenex_135 Int) (v_prenex_137 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse33 (select (select |c_#memory_$Pointer$#1.base| v_prenex_139) (+ v_prenex_135 4))) (.cse35 (+ v_prenex_136 4))) (let ((.cse32 (select (select |c_#memory_$Pointer$#1.base| .cse33) .cse35))) (and (= (select v_prenex_137 .cse32) 0) (not (= .cse33 v_prenex_139)) (= .cse33 .cse32) (= (select v_prenex_137 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= v_prenex_137 (let ((.cse34 (@diff v_prenex_138 v_prenex_137))) (store v_prenex_138 .cse34 (select v_prenex_137 .cse34)))) (= (select v_prenex_138 .cse31) 1) (= (select v_prenex_138 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse33) .cse35) 0))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse31) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse31) 4) 0) (not (= .cse31 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))) .cse10)))) is different from true [2024-11-08 18:39:13,668 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (exists ((v_prenex_143 Int) (v_prenex_132 Int) (v_prenex_133 (Array Int Int)) (v_prenex_134 (Array Int Int)) (v_prenex_140 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| v_prenex_143) (+ v_prenex_140 4))) (.cse3 (+ v_prenex_132 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3))) (and (= (select v_prenex_133 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select v_prenex_134 .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3) 0) (= (select v_prenex_134 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= v_prenex_133 (let ((.cse4 (@diff v_prenex_134 v_prenex_133))) (store v_prenex_134 .cse4 (select v_prenex_133 .cse4)))) (= 1 (select (select |c_#memory_int#1| .cse5) 0)) (= (select v_prenex_133 .cse5) 0) (not (= v_prenex_132 v_prenex_140)))))) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (exists ((v_prenex_126 Int) (v_prenex_123 Int) (v_prenex_122 Int) (v_prenex_124 (Array Int Int)) (v_prenex_125 (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| v_prenex_126) (+ v_prenex_122 4))) (.cse10 (+ v_prenex_123 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse9) .cse10))) (and (= (select v_prenex_125 .cse6) 1) (= (select v_prenex_125 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select v_prenex_124 .cse7) 0) (= v_prenex_124 (let ((.cse8 (@diff v_prenex_125 v_prenex_124))) (store v_prenex_125 .cse8 (select v_prenex_124 .cse8)))) (= (select v_prenex_124 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= .cse7 .cse9) (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) .cse10) 0) (not (= v_prenex_123 v_prenex_122)))))) (= .cse6 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse6) 4) 0) (not (= .cse6 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))))) (and .cse0 (or (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse12) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_36| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select |v_old(#valid)_AFTER_CALL_36| .cse11) 0) (= 1 (select |v_#valid_BEFORE_CALL_27| .cse12)) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (and (not (= .cse12 |v_ULTIMATE.start_sll_append_~last~0#1.base_50|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) .cse12))) (= (select (select |c_#memory_int#1| .cse11) 0) 1) (= .cse12 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse12) 4) 0) (not (= .cse12 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))) (= (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse13 (select |v_old(#valid)_AFTER_CALL_36| .cse13))) |v_old(#valid)_AFTER_CALL_36|))) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse14 (select |v_old(#valid)_AFTER_CALL_36| .cse14))) |v_old(#valid)_AFTER_CALL_36|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| .cse16) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_36| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select |v_old(#valid)_AFTER_CALL_36| .cse15) 0) (= 1 (select |v_#valid_BEFORE_CALL_27| .cse16)) (= (select (select |c_#memory_int#1| .cse15) 0) 1) (= .cse16 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse16) 4) 0) (exists ((v_prenex_117 Int) (v_prenex_118 Int)) (and (= .cse16 (select (select |c_#memory_$Pointer$#1.base| v_prenex_118) (+ v_prenex_117 4))) (not (= v_prenex_117 0)))) (not (= .cse16 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))))))) (and .cse0 (let ((.cse17 (select |c_#memory_$Pointer$#1.offset| 0)) (.cse19 (select |c_#memory_$Pointer$#1.base| 0))) (or (and (exists ((v_prenex_119 Int)) (let ((.cse18 (+ v_prenex_119 4))) (and (= (select .cse17 .cse18) 0) (= (select .cse19 .cse18) 0)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int) (v_prenex_120 (Array Int Int)) (v_prenex_121 (Array Int Int))) (let ((.cse20 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= (select v_prenex_121 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select v_prenex_120 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= .cse20 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select v_prenex_120 0) 0) (= v_prenex_120 (let ((.cse21 (@diff v_prenex_121 v_prenex_120))) (store v_prenex_121 .cse21 (select v_prenex_120 .cse21)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse20) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse20) 4) 0) (= (select v_prenex_121 .cse20) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= .cse22 |c_ULTIMATE.start_main_~ptr~0#1.base|) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (v_prenex_141 (Array Int Int)) (v_prenex_142 (Array Int Int))) (let ((.cse23 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse24 (select .cse19 .cse23))) (and (= (select .cse17 .cse23) 0) (= (select v_prenex_141 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select (select |c_#memory_int#1| .cse24) 0) 1) (= (select v_prenex_142 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (let ((.cse25 (@diff v_prenex_142 v_prenex_141))) (store v_prenex_142 .cse25 (select v_prenex_141 .cse25))) v_prenex_141) (= (select v_prenex_142 .cse22) 1) (= (select v_prenex_141 .cse24) 0))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse22) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse22) 4) 0) (not (= .cse22 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))))) (and .cse0 (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= .cse26 |c_ULTIMATE.start_main_~ptr~0#1.base|) (exists ((v_prenex_127 Int) (v_prenex_129 (Array Int Int)) (v_prenex_128 Int) (v_prenex_130 (Array Int Int)) (v_prenex_131 Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$#1.base| v_prenex_131) (+ v_prenex_127 4))) (.cse28 (+ v_prenex_128 4))) (let ((.cse30 (select (select |c_#memory_$Pointer$#1.base| .cse27) .cse28))) (and (not (= .cse27 v_prenex_131)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse27) .cse28) 0) (= (select v_prenex_130 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (let ((.cse29 (@diff v_prenex_130 v_prenex_129))) (store v_prenex_130 .cse29 (select v_prenex_129 .cse29))) v_prenex_129) (= (select v_prenex_130 .cse26) 1) (= (select v_prenex_129 .cse30) 0) (= (select (select |c_#memory_int#1| .cse30) 0) 1) (= (select v_prenex_129 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse26) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse26) 4) 0) (not (= .cse26 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse34 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (exists ((v_prenex_139 Int) (v_prenex_136 Int) (v_prenex_135 Int) (v_prenex_137 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse32 (select (select |c_#memory_$Pointer$#1.base| v_prenex_139) (+ v_prenex_135 4))) (.cse35 (+ v_prenex_136 4))) (let ((.cse31 (select (select |c_#memory_$Pointer$#1.base| .cse32) .cse35))) (and (= (select v_prenex_137 .cse31) 0) (not (= .cse32 v_prenex_139)) (= .cse32 .cse31) (= (select v_prenex_137 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= v_prenex_137 (let ((.cse33 (@diff v_prenex_138 v_prenex_137))) (store v_prenex_138 .cse33 (select v_prenex_137 .cse33)))) (= (select v_prenex_138 .cse34) 1) (= (select v_prenex_138 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse32) .cse35) 0))))) (= .cse34 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse34) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse34) 4) 0) (not (= .cse34 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2024-11-08 18:39:13,686 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (exists ((v_prenex_143 Int) (v_prenex_132 Int) (v_prenex_133 (Array Int Int)) (v_prenex_134 (Array Int Int)) (v_prenex_140 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| v_prenex_143) (+ v_prenex_140 4))) (.cse3 (+ v_prenex_132 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3))) (and (= (select v_prenex_133 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select v_prenex_134 .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3) 0) (= (select v_prenex_134 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= v_prenex_133 (let ((.cse4 (@diff v_prenex_134 v_prenex_133))) (store v_prenex_134 .cse4 (select v_prenex_133 .cse4)))) (= 1 (select (select |c_#memory_int#1| .cse5) 0)) (= (select v_prenex_133 .cse5) 0) (not (= v_prenex_132 v_prenex_140)))))) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (exists ((v_prenex_126 Int) (v_prenex_123 Int) (v_prenex_122 Int) (v_prenex_124 (Array Int Int)) (v_prenex_125 (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| v_prenex_126) (+ v_prenex_122 4))) (.cse10 (+ v_prenex_123 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| .cse9) .cse10))) (and (= (select v_prenex_125 .cse6) 1) (= (select v_prenex_125 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select v_prenex_124 .cse7) 0) (= v_prenex_124 (let ((.cse8 (@diff v_prenex_125 v_prenex_124))) (store v_prenex_125 .cse8 (select v_prenex_124 .cse8)))) (= (select v_prenex_124 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= .cse7 .cse9) (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) .cse10) 0) (not (= v_prenex_123 v_prenex_122)))))) (= .cse6 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse6) 4) 0) (not (= .cse6 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))))) (and .cse0 (or (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse12) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_36| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select |v_old(#valid)_AFTER_CALL_36| .cse11) 0) (= 1 (select |v_#valid_BEFORE_CALL_27| .cse12)) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_51| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_50| Int)) (and (not (= .cse12 |v_ULTIMATE.start_sll_append_~last~0#1.base_50|)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_50|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_51| 4)) .cse12))) (= (select (select |c_#memory_int#1| .cse11) 0) 1) (= .cse12 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse12) 4) 0) (not (= .cse12 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))) (= (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse13 (select |v_old(#valid)_AFTER_CALL_36| .cse13))) |v_old(#valid)_AFTER_CALL_36|))) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_27| |v_old(#valid)_AFTER_CALL_36|))) (store |v_#valid_BEFORE_CALL_27| .cse14 (select |v_old(#valid)_AFTER_CALL_36| .cse14))) |v_old(#valid)_AFTER_CALL_36|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| .cse16) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_36| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select |v_old(#valid)_AFTER_CALL_36| .cse15) 0) (= 1 (select |v_#valid_BEFORE_CALL_27| .cse16)) (= (select (select |c_#memory_int#1| .cse15) 0) 1) (= .cse16 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse16) 4) 0) (exists ((v_prenex_117 Int) (v_prenex_118 Int)) (and (= .cse16 (select (select |c_#memory_$Pointer$#1.base| v_prenex_118) (+ v_prenex_117 4))) (not (= v_prenex_117 0)))) (not (= .cse16 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))))))) (and .cse0 (let ((.cse17 (select |c_#memory_$Pointer$#1.offset| 0)) (.cse19 (select |c_#memory_$Pointer$#1.base| 0))) (or (and (exists ((v_prenex_119 Int)) (let ((.cse18 (+ v_prenex_119 4))) (and (= (select .cse17 .cse18) 0) (= (select .cse19 .cse18) 0)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int) (v_prenex_120 (Array Int Int)) (v_prenex_121 (Array Int Int))) (let ((.cse20 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= (select v_prenex_121 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select v_prenex_120 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= .cse20 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select v_prenex_120 0) 0) (= v_prenex_120 (let ((.cse21 (@diff v_prenex_121 v_prenex_120))) (store v_prenex_121 .cse21 (select v_prenex_120 .cse21)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse20) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse20) 4) 0) (= (select v_prenex_121 .cse20) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= .cse22 |c_ULTIMATE.start_main_~ptr~0#1.base|) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (v_prenex_141 (Array Int Int)) (v_prenex_142 (Array Int Int))) (let ((.cse23 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (let ((.cse24 (select .cse19 .cse23))) (and (= (select .cse17 .cse23) 0) (= (select v_prenex_141 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= (select (select |c_#memory_int#1| .cse24) 0) 1) (= (select v_prenex_142 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (let ((.cse25 (@diff v_prenex_142 v_prenex_141))) (store v_prenex_142 .cse25 (select v_prenex_141 .cse25))) v_prenex_141) (= (select v_prenex_142 .cse22) 1) (= (select v_prenex_141 .cse24) 0))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse22) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse22) 4) 0) (not (= .cse22 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0))))))) (and .cse0 (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (= .cse26 |c_ULTIMATE.start_main_~ptr~0#1.base|) (exists ((v_prenex_127 Int) (v_prenex_129 (Array Int Int)) (v_prenex_128 Int) (v_prenex_130 (Array Int Int)) (v_prenex_131 Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$#1.base| v_prenex_131) (+ v_prenex_127 4))) (.cse28 (+ v_prenex_128 4))) (let ((.cse30 (select (select |c_#memory_$Pointer$#1.base| .cse27) .cse28))) (and (not (= .cse27 v_prenex_131)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse27) .cse28) 0) (= (select v_prenex_130 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (let ((.cse29 (@diff v_prenex_130 v_prenex_129))) (store v_prenex_130 .cse29 (select v_prenex_129 .cse29))) v_prenex_129) (= (select v_prenex_130 .cse26) 1) (= (select v_prenex_129 .cse30) 0) (= (select (select |c_#memory_int#1| .cse30) 0) 1) (= (select v_prenex_129 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse26) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse26) 4) 0) (not (= .cse26 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_37| Int)) (let ((.cse34 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4))) (and (exists ((v_prenex_139 Int) (v_prenex_136 Int) (v_prenex_135 Int) (v_prenex_137 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse32 (select (select |c_#memory_$Pointer$#1.base| v_prenex_139) (+ v_prenex_135 4))) (.cse35 (+ v_prenex_136 4))) (let ((.cse31 (select (select |c_#memory_$Pointer$#1.base| .cse32) .cse35))) (and (= (select v_prenex_137 .cse31) 0) (not (= .cse32 v_prenex_139)) (= .cse32 .cse31) (= (select v_prenex_137 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 1) (= v_prenex_137 (let ((.cse33 (@diff v_prenex_138 v_prenex_137))) (store v_prenex_138 .cse33 (select v_prenex_137 .cse33)))) (= (select v_prenex_138 .cse34) 1) (= (select v_prenex_138 |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse32) .cse35) 0))))) (= .cse34 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse34) 4) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse34) 4) 0) (not (= .cse34 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_37|) 4) 0)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2024-11-08 18:40:22,086 WARN L286 SmtUtils]: Spent 1.12m on a formula simplification. DAG size of input: 1794 DAG size of output: 1716 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-08 18:40:22,088 INFO L349 Elim1Store]: treesize reduction 208, result has 95.2 percent of original size [2024-11-08 18:40:22,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 29 select indices, 29 select index equivalence classes, 0 disjoint index pairs (out of 406 index pairs), introduced 41 new quantified variables, introduced 406 case distinctions, treesize of input 993 treesize of output 4751 [2024-11-08 18:40:25,653 INFO L224 Elim1Store]: Index analysis took 1916 ms [2024-11-08 18:41:03,381 WARN L286 SmtUtils]: Spent 37.57s on a formula simplification. DAG size of input: 1062 DAG size of output: 1008 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-08 18:41:03,381 INFO L349 Elim1Store]: treesize reduction 136, result has 94.5 percent of original size [2024-11-08 18:41:03,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 23 select indices, 23 select index equivalence classes, 0 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 253 case distinctions, treesize of input 603 treesize of output 2851 [2024-11-08 18:47:14,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-08 18:47:14,132 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-08 18:47:14,133 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-08 18:47:14,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-08 18:47:14,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 18:47:14,334 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:584) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:274) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 67 more [2024-11-08 18:47:14,346 INFO L158 Benchmark]: Toolchain (without parser) took 678481.99ms. Allocated memory was 151.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 113.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-08 18:47:14,346 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory was 81.7MB in the beginning and 81.7MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:47:14,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 812.80ms. Allocated memory is still 151.0MB. Free memory was 113.5MB in the beginning and 93.3MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 18:47:14,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.21ms. Allocated memory is still 151.0MB. Free memory was 93.3MB in the beginning and 90.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:47:14,347 INFO L158 Benchmark]: Boogie Preprocessor took 73.51ms. Allocated memory is still 151.0MB. Free memory was 90.9MB in the beginning and 88.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:47:14,347 INFO L158 Benchmark]: RCFGBuilder took 936.25ms. Allocated memory is still 151.0MB. Free memory was 88.0MB in the beginning and 107.8MB in the end (delta: -19.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-08 18:47:14,348 INFO L158 Benchmark]: TraceAbstraction took 676572.44ms. Allocated memory was 151.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 107.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-08 18:47:14,350 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory was 81.7MB in the beginning and 81.7MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 812.80ms. Allocated memory is still 151.0MB. Free memory was 113.5MB in the beginning and 93.3MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.21ms. Allocated memory is still 151.0MB. Free memory was 93.3MB in the beginning and 90.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.51ms. Allocated memory is still 151.0MB. Free memory was 90.9MB in the beginning and 88.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 936.25ms. Allocated memory is still 151.0MB. Free memory was 88.0MB in the beginning and 107.8MB in the end (delta: -19.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 676572.44ms. Allocated memory was 151.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 107.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:47:17,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:47:17,217 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:47:17,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:47:17,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:47:17,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:47:17,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:47:17,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:47:17,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:47:17,274 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:47:17,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:47:17,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:47:17,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:47:17,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:47:17,277 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:47:17,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:47:17,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:47:17,279 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:47:17,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:47:17,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:47:17,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:47:17,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:47:17,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:47:17,282 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:47:17,283 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:47:17,283 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:47:17,284 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:47:17,285 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:47:17,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:47:17,286 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:47:17,286 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:47:17,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:47:17,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:47:17,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:47:17,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:47:17,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:47:17,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:47:17,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:47:17,290 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:47:17,290 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:47:17,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:47:17,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:47:17,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:47:17,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:47:17,293 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/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_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2024-11-08 18:47:17,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:47:17,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:47:17,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:47:17,869 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:47:17,870 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:47:17,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i Unable to find full path for "g++" [2024-11-08 18:47:21,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:47:21,534 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:47:21,534 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-08 18:47:21,555 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/data/0c4e67685/5355f7643e6a4e08b4413bebf4299c14/FLAG55f69c230 [2024-11-08 18:47:21,710 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/data/0c4e67685/5355f7643e6a4e08b4413bebf4299c14 [2024-11-08 18:47:21,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:47:21,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:47:21,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:47:21,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:47:21,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:47:21,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:47:21" (1/1) ... [2024-11-08 18:47:21,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed4b03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:21, skipping insertion in model container [2024-11-08 18:47:21,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:47:21" (1/1) ... [2024-11-08 18:47:21,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:47:22,474 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_df0b2312-2272-4e5d-b409-19932f81d739/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2024-11-08 18:47:22,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:47:22,497 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:47:22,574 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_df0b2312-2272-4e5d-b409-19932f81d739/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2024-11-08 18:47:22,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:47:22,633 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:47:22,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:22 WrapperNode [2024-11-08 18:47:22,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:47:22,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:47:22,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:47:22,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:47:22,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:22" (1/1) ... [2024-11-08 18:47:22,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:22" (1/1) ... [2024-11-08 18:47:22,714 INFO L138 Inliner]: procedures = 130, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2024-11-08 18:47:22,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:47:22,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:47:22,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:47:22,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:47:22,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:22" (1/1) ... [2024-11-08 18:47:22,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:22" (1/1) ... [2024-11-08 18:47:22,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:22" (1/1) ... [2024-11-08 18:47:22,767 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 9, 6]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2024-11-08 18:47:22,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:22" (1/1) ... [2024-11-08 18:47:22,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:22" (1/1) ... [2024-11-08 18:47:22,792 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:22" (1/1) ... [2024-11-08 18:47:22,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:22" (1/1) ... [2024-11-08 18:47:22,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:22" (1/1) ... [2024-11-08 18:47:22,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:22" (1/1) ... [2024-11-08 18:47:22,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:47:22,825 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:47:22,825 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:47:22,825 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:47:22,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:22" (1/1) ... [2024-11-08 18:47:22,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:47:22,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:47:22,868 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:47:22,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:47:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 18:47:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 18:47:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 18:47:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-08 18:47:22,908 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-08 18:47:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 18:47:22,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:47:22,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 18:47:22,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 18:47:22,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 18:47:22,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 18:47:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 18:47:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 18:47:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 18:47:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 18:47:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 18:47:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 18:47:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 18:47:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 18:47:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 18:47:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 18:47:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:47:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 18:47:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 18:47:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:47:22,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:47:23,150 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:47:23,154 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:47:23,658 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-08 18:47:23,659 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:47:23,718 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:47:23,719 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:47:23,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:47:23 BoogieIcfgContainer [2024-11-08 18:47:23,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:47:23,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:47:23,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:47:23,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:47:23,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:47:21" (1/3) ... [2024-11-08 18:47:23,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e97100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:47:23, skipping insertion in model container [2024-11-08 18:47:23,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:22" (2/3) ... [2024-11-08 18:47:23,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e97100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:47:23, skipping insertion in model container [2024-11-08 18:47:23,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:47:23" (3/3) ... [2024-11-08 18:47:23,733 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2024-11-08 18:47:23,762 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:47:23,763 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:47:23,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:47:23,877 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=PETRI_NET, 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;@37f623e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:47:23,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:47:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:47:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 18:47:23,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:23,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:47:23,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:23,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:23,906 INFO L85 PathProgramCache]: Analyzing trace with hash -821525012, now seen corresponding path program 1 times [2024-11-08 18:47:23,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:47:23,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141015065] [2024-11-08 18:47:23,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:23,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:23,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:47:23,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:47:23,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:47:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:24,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 18:47:24,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:47:24,642 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 15 treesize of output 1 [2024-11-08 18:47:24,687 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 16 treesize of output 8 [2024-11-08 18:47:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:47:24,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:47:24,717 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:47:24,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141015065] [2024-11-08 18:47:24,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141015065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:47:24,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:47:24,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:47:24,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136170302] [2024-11-08 18:47:24,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:47:24,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:47:24,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:47:24,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:47:24,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:47:24,777 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:47:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:47:25,259 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2024-11-08 18:47:25,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:47:25,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-08 18:47:25,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:47:25,279 INFO L225 Difference]: With dead ends: 56 [2024-11-08 18:47:25,281 INFO L226 Difference]: Without dead ends: 35 [2024-11-08 18:47:25,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:47:25,295 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:47:25,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 230 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:47:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-08 18:47:25,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2024-11-08 18:47:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:47:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-08 18:47:25,362 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 17 [2024-11-08 18:47:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:47:25,366 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-08 18:47:25,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:47:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-08 18:47:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 18:47:25,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:25,373 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:47:25,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:47:25,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:25,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:25,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:25,576 INFO L85 PathProgramCache]: Analyzing trace with hash 302159644, now seen corresponding path program 1 times [2024-11-08 18:47:25,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:47:25,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2037587311] [2024-11-08 18:47:25,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:25,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:25,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:47:25,582 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:47:25,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:47:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:25,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 18:47:25,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:47:25,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:47:26,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 18:47:26,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 18:47:26,199 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 23 treesize of output 15 [2024-11-08 18:47:26,210 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 19 treesize of output 11 [2024-11-08 18:47:26,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 18:47:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:47:26,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:47:26,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:47:26,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037587311] [2024-11-08 18:47:26,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037587311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:47:26,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:47:26,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 18:47:26,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60575426] [2024-11-08 18:47:26,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:47:26,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:47:26,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:47:26,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:47:26,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:47:26,341 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:47:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:47:27,181 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-11-08 18:47:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:47:27,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-08 18:47:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:47:27,184 INFO L225 Difference]: With dead ends: 38 [2024-11-08 18:47:27,184 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 18:47:27,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:47:27,187 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:47:27,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 167 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:47:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 18:47:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2024-11-08 18:47:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:47:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-08 18:47:27,198 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2024-11-08 18:47:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:47:27,199 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-08 18:47:27,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:47:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-08 18:47:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 18:47:27,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:27,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:47:27,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:47:27,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:27,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:27,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:27,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1682316874, now seen corresponding path program 1 times [2024-11-08 18:47:27,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:47:27,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [353950604] [2024-11-08 18:47:27,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:27,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:27,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:47:27,409 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:47:27,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:47:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:27,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:47:27,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:47:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 18:47:27,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:47:27,604 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:47:27,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353950604] [2024-11-08 18:47:27,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353950604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:47:27,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:47:27,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:47:27,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911933157] [2024-11-08 18:47:27,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:47:27,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:47:27,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:47:27,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:47:27,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:47:27,608 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:47:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:47:27,658 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2024-11-08 18:47:27,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:47:27,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-08 18:47:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:47:27,660 INFO L225 Difference]: With dead ends: 58 [2024-11-08 18:47:27,660 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 18:47:27,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:47:27,662 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:47:27,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 56 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:47:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 18:47:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-08 18:47:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:47:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-08 18:47:27,679 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 20 [2024-11-08 18:47:27,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:47:27,680 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-08 18:47:27,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:47:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-08 18:47:27,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 18:47:27,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:27,684 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:47:27,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 18:47:27,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:27,889 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:27,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:27,890 INFO L85 PathProgramCache]: Analyzing trace with hash 185257758, now seen corresponding path program 1 times [2024-11-08 18:47:27,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:47:27,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456837594] [2024-11-08 18:47:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:27,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:27,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:47:27,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:47:27,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:47:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:28,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 18:47:28,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:47:28,422 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 16 treesize of output 8 [2024-11-08 18:47:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 18:47:28,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:47:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 18:47:28,552 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:47:28,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456837594] [2024-11-08 18:47:28,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456837594] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:47:28,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:47:28,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2024-11-08 18:47:28,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562128955] [2024-11-08 18:47:28,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:47:28,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:47:28,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:47:28,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:47:28,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:47:28,557 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 18:47:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:47:29,246 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2024-11-08 18:47:29,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:47:29,249 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-11-08 18:47:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:47:29,250 INFO L225 Difference]: With dead ends: 45 [2024-11-08 18:47:29,250 INFO L226 Difference]: Without dead ends: 35 [2024-11-08 18:47:29,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:47:29,252 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:47:29,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 217 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:47:29,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-08 18:47:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-08 18:47:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:47:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-08 18:47:29,276 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 29 [2024-11-08 18:47:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:47:29,277 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-08 18:47:29,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 18:47:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-08 18:47:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 18:47:29,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:29,279 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:47:29,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 18:47:29,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:29,481 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:29,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:29,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2144146912, now seen corresponding path program 1 times [2024-11-08 18:47:29,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:47:29,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799446150] [2024-11-08 18:47:29,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:29,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:29,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:47:29,487 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:47:29,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 18:47:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:29,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 18:47:29,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:47:29,930 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 16 treesize of output 8 [2024-11-08 18:47:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:47:29,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:47:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 18:47:30,073 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:47:30,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799446150] [2024-11-08 18:47:30,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799446150] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:47:30,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:47:30,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2024-11-08 18:47:30,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337198477] [2024-11-08 18:47:30,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:47:30,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:47:30,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:47:30,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:47:30,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:47:30,081 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 18:47:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:47:30,683 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-08 18:47:30,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:47:30,685 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-11-08 18:47:30,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:47:30,686 INFO L225 Difference]: With dead ends: 40 [2024-11-08 18:47:30,686 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 18:47:30,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:47:30,688 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:47:30,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 200 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:47:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 18:47:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-08 18:47:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:47:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-08 18:47:30,699 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 29 [2024-11-08 18:47:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:47:30,699 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-08 18:47:30,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 18:47:30,700 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-08 18:47:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 18:47:30,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:30,701 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:47:30,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 18:47:30,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:30,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:30,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2043676072, now seen corresponding path program 1 times [2024-11-08 18:47:30,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:47:30,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [554334410] [2024-11-08 18:47:30,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:30,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:30,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:47:30,906 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:47:30,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 18:47:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:31,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:47:31,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:47:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:47:31,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:47:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:47:31,297 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:47:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554334410] [2024-11-08 18:47:31,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554334410] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:47:31,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:47:31,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2024-11-08 18:47:31,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25996187] [2024-11-08 18:47:31,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:47:31,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:47:31,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:47:31,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:47:31,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:47:31,305 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:47:31,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:47:31,572 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2024-11-08 18:47:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:47:31,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2024-11-08 18:47:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:47:31,575 INFO L225 Difference]: With dead ends: 68 [2024-11-08 18:47:31,575 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 18:47:31,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:47:31,577 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:47:31,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 129 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:47:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 18:47:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 18:47:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 18:47:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-08 18:47:31,594 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 30 [2024-11-08 18:47:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:47:31,595 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-08 18:47:31,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:47:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-11-08 18:47:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 18:47:31,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:31,598 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:47:31,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 18:47:31,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:31,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:31,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:31,800 INFO L85 PathProgramCache]: Analyzing trace with hash 998592784, now seen corresponding path program 2 times [2024-11-08 18:47:31,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:47:31,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024581332] [2024-11-08 18:47:31,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:47:31,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:31,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:47:31,804 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:47:31,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 18:47:32,190 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:47:32,191 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:47:32,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 18:47:32,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:47:32,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 18:47:32,447 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 15 treesize of output 1 [2024-11-08 18:47:32,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 12 treesize of output 4 [2024-11-08 18:47:32,743 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 5 [2024-11-08 18:47:32,975 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_5|))) (exists ((|v_node_create_~temp~0#1.base_33| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_33|)) (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_33| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_33|)) |c_#memory_$Pointer$#1.base|)))) is different from true [2024-11-08 18:47:33,090 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-08 18:47:33,091 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 17 [2024-11-08 18:47:33,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-08 18:47:33,313 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 20 treesize of output 12 [2024-11-08 18:47:33,497 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 16 treesize of output 8 [2024-11-08 18:47:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-08 18:47:33,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:47:35,720 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:47:35,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024581332] [2024-11-08 18:47:35,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024581332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:47:35,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2061194073] [2024-11-08 18:47:35,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:47:35,723 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:47:35,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:47:35,729 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:47:35,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-08 18:47:36,295 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:47:36,295 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:47:36,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 18:47:36,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:47:36,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:47:37,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 18:47:37,707 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 11 treesize of output 3 [2024-11-08 18:47:38,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-08 18:47:38,080 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) (_ bv0 32)))) (exists ((|v_node_create_~temp~0#1.base_41| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_41|))) (and (= |c_node_create_#in~data#1| (select .cse0 (_ bv0 32))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_41| .cse0)))))) is different from true [2024-11-08 18:47:38,176 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 18:47:38,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-08 18:47:39,064 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 18:47:39,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 25 [2024-11-08 18:47:39,341 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 19 treesize of output 11 [2024-11-08 18:47:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2024-11-08 18:47:39,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:47:41,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:47:41,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 50 [2024-11-08 18:47:41,226 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_46| (_ BitVec 32)) (v_ArrVal_308 (_ BitVec 32)) (v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int#1| |v_node_create_~temp~0#1.base_46| v_arrayElimArr_2)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) v_ArrVal_308))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |c_ULTIMATE.start_sll_append_~data#1| (select v_arrayElimArr_2 (_ bv0 32)))))) is different from false [2024-11-08 18:47:41,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2061194073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:47:41,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:47:41,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2024-11-08 18:47:41,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479480105] [2024-11-08 18:47:41,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:47:41,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-08 18:47:41,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:47:41,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-08 18:47:41,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1450, Unknown=15, NotChecked=234, Total=1806 [2024-11-08 18:47:41,243 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 33 states, 31 states have (on average 2.0) internal successors, (62), 28 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 18:47:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:47:45,552 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2024-11-08 18:47:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 18:47:45,555 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.0) internal successors, (62), 28 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2024-11-08 18:47:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:47:45,557 INFO L225 Difference]: With dead ends: 58 [2024-11-08 18:47:45,557 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 18:47:45,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=206, Invalid=2653, Unknown=15, NotChecked=318, Total=3192 [2024-11-08 18:47:45,564 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:47:45,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 498 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 534 Invalid, 0 Unknown, 88 Unchecked, 2.4s Time] [2024-11-08 18:47:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 18:47:45,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 18:47:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 18:47:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-11-08 18:47:45,603 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 39 [2024-11-08 18:47:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:47:45,604 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-11-08 18:47:45,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.0) internal successors, (62), 28 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 18:47:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-11-08 18:47:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 18:47:45,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:45,610 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:47:45,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 18:47:45,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-11-08 18:47:46,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 18:47:46,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:46,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:46,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1059180693, now seen corresponding path program 1 times [2024-11-08 18:47:46,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:47:46,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449988106] [2024-11-08 18:47:46,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:46,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:46,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:47:46,016 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:47:46,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 18:47:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:46,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-08 18:47:46,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:47:46,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 18:47:46,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:47:46,673 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-08 18:47:46,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-08 18:47:46,779 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 15 treesize of output 1 [2024-11-08 18:47:46,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 18:47:47,151 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 32 treesize of output 16 [2024-11-08 18:47:47,162 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 18:47:47,362 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_7|) (_ bv0 32))) (exists ((|v_node_create_~temp~0#1.base_50| (_ BitVec 32))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_50| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_50|))) (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_50|)) (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_50| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_50|)) |c_#memory_$Pointer$#1.base|)))) is different from true [2024-11-08 18:47:47,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:47:47,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2024-11-08 18:47:47,498 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-08 18:47:47,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-08 18:47:47,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:47:47,893 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 28 treesize of output 12 [2024-11-08 18:47:48,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:47:48,163 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 19 treesize of output 11 [2024-11-08 18:47:48,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 18:47:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-08 18:47:48,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:47:48,884 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) v_ArrVal_379) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2024-11-08 18:47:49,092 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_55| (_ BitVec 32)) (v_ArrVal_385 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_55|))) (= (select (select (store (store |c_#memory_int#1| |v_node_create_~temp~0#1.base_55| v_ArrVal_385) (select (select (store |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_55| v_ArrVal_386) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) v_ArrVal_379) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2024-11-08 18:47:49,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:47:49,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449988106] [2024-11-08 18:47:49,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449988106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:47:49,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1804387582] [2024-11-08 18:47:49,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:49,098 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:47:49,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:47:49,100 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:47:49,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-08 18:47:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:49,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-08 18:47:49,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:47:49,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 18:47:50,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:47:50,191 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-08 18:47:50,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-08 18:47:50,427 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 15 treesize of output 1 [2024-11-08 18:47:50,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 18:47:51,065 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 32 treesize of output 16 [2024-11-08 18:47:51,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 18:47:51,081 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 18:47:51,385 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_59| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_59|)) (= (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_59| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_59|)) |c_#memory_int#1|) (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_59| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_59|)) |c_#memory_$Pointer$#1.base|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) (_ bv0 32)) (_ bv0 32)))) is different from true [2024-11-08 18:47:51,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:47:51,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2024-11-08 18:47:51,507 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-08 18:47:51,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-08 18:47:51,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:47:52,115 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 28 treesize of output 12 [2024-11-08 18:47:52,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:47:52,569 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 19 treesize of output 11 [2024-11-08 18:47:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-08 18:47:52,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:47:53,195 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (= (select (select (store (store |c_#memory_int#1| |v_node_create_~temp~0#1.base_65| v_ArrVal_459) (select (select (store |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_65| v_ArrVal_458) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) v_ArrVal_379) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2024-11-08 18:47:53,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1804387582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:47:53,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:47:53,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 39 [2024-11-08 18:47:53,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316003087] [2024-11-08 18:47:53,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:47:53,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-08 18:47:53,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:47:53,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-08 18:47:53,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1490, Unknown=25, NotChecked=410, Total=2070 [2024-11-08 18:47:53,204 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 39 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 32 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:47:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:47:56,515 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2024-11-08 18:47:56,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 18:47:56,516 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 32 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2024-11-08 18:47:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:47:56,517 INFO L225 Difference]: With dead ends: 63 [2024-11-08 18:47:56,517 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 18:47:56,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=194, Invalid=2057, Unknown=25, NotChecked=480, Total=2756 [2024-11-08 18:47:56,520 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:47:56,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 374 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 654 Invalid, 0 Unknown, 120 Unchecked, 2.5s Time] [2024-11-08 18:47:56,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 18:47:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-11-08 18:47:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 18:47:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-11-08 18:47:56,538 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 41 [2024-11-08 18:47:56,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:47:56,539 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-11-08 18:47:56,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 32 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:47:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-11-08 18:47:56,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 18:47:56,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:56,541 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:47:56,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-11-08 18:47:56,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 18:47:56,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:56,942 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:56,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:56,942 INFO L85 PathProgramCache]: Analyzing trace with hash -34561809, now seen corresponding path program 1 times [2024-11-08 18:47:56,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:47:56,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289699703] [2024-11-08 18:47:56,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:56,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:47:56,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:47:56,946 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:47:56,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 18:47:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:57,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 18:47:57,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:47:57,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 18:47:57,534 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-08 18:47:57,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-08 18:47:57,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 18:47:57,949 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 44 treesize of output 20 [2024-11-08 18:47:57,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 18:47:58,138 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_9| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_9|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_9|))) (exists ((|v_node_create_~temp~0#1.base_68| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_68|)) (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_68| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_68|)) |c_#memory_$Pointer$#1.base|)))) is different from true [2024-11-08 18:47:58,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:47:58,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2024-11-08 18:47:58,262 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-08 18:47:58,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-08 18:47:58,854 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-08 18:47:58,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 40 [2024-11-08 18:47:58,980 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 36 treesize of output 20 [2024-11-08 18:47:59,119 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 24 treesize of output 12 [2024-11-08 18:47:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-08 18:47:59,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:47:59,455 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_521) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2024-11-08 18:47:59,492 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)) v_ArrVal_521) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-08 18:47:59,522 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) v_ArrVal_521) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-08 18:47:59,621 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_73| (_ BitVec 32)) (v_ArrVal_524 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_73|))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_73| v_ArrVal_524))) (store .cse0 (select (select .cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) v_ArrVal_521)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2024-11-08 18:47:59,625 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:47:59,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289699703] [2024-11-08 18:47:59,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289699703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:47:59,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [24429654] [2024-11-08 18:47:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:59,626 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:47:59,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:47:59,628 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:47:59,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-08 18:48:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:00,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-08 18:48:00,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:48:00,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 18:48:00,663 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-08 18:48:00,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-08 18:48:00,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 18:48:01,350 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 44 treesize of output 20 [2024-11-08 18:48:01,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 18:48:01,625 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_77| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_77|)) (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_77| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_77|)) |c_#memory_$Pointer$#1.base|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10|) (_ bv0 32))))) is different from true [2024-11-08 18:48:01,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:48:01,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2024-11-08 18:48:01,704 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-08 18:48:01,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-08 18:48:02,426 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-08 18:48:02,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 40 [2024-11-08 18:48:02,592 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 36 treesize of output 20 [2024-11-08 18:48:02,630 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 24 treesize of output 12 [2024-11-08 18:48:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-08 18:48:02,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:48:02,670 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_586) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-08 18:48:03,242 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_82| (_ BitVec 32)) (v_ArrVal_589 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_82| v_ArrVal_589))) (store .cse0 (select (select .cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) v_ArrVal_586)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_82|))))) is different from false [2024-11-08 18:48:03,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [24429654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:48:03,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:48:03,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 37 [2024-11-08 18:48:03,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278202125] [2024-11-08 18:48:03,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:48:03,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-08 18:48:03,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:48:03,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-08 18:48:03,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1338, Unknown=26, NotChecked=648, Total=2162 [2024-11-08 18:48:03,250 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 37 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 30 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:48:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:48:06,541 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2024-11-08 18:48:06,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 18:48:06,542 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 30 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 43 [2024-11-08 18:48:06,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:48:06,543 INFO L225 Difference]: With dead ends: 66 [2024-11-08 18:48:06,543 INFO L226 Difference]: Without dead ends: 63 [2024-11-08 18:48:06,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=219, Invalid=2138, Unknown=27, NotChecked=808, Total=3192 [2024-11-08 18:48:06,545 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:48:06,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 568 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 734 Invalid, 0 Unknown, 124 Unchecked, 2.5s Time] [2024-11-08 18:48:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-08 18:48:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2024-11-08 18:48:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 18:48:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-11-08 18:48:06,561 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 43 [2024-11-08 18:48:06,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:48:06,561 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-11-08 18:48:06,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 30 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:48:06,562 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-11-08 18:48:06,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 18:48:06,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:48:06,563 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:48:06,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 18:48:06,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-08 18:48:06,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 18:48:06,966 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:48:06,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:48:06,967 INFO L85 PathProgramCache]: Analyzing trace with hash -845380902, now seen corresponding path program 2 times [2024-11-08 18:48:06,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:48:06,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1976031215] [2024-11-08 18:48:06,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:48:06,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:48:06,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:48:06,970 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:48:06,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 18:48:07,221 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:48:07,221 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:48:07,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-08 18:48:07,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:48:07,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 18:48:07,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:48:07,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:48:07,694 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 18:48:07,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-08 18:48:07,742 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-08 18:48:07,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-08 18:48:07,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:48:07,888 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 27 treesize of output 15 [2024-11-08 18:48:07,903 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 23 treesize of output 11 [2024-11-08 18:48:08,255 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 18:48:08,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-08 18:48:08,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2024-11-08 18:48:08,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 18:48:08,488 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_11| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_11|)) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_11|))))) (exists ((|v_node_create_~temp~0#1.base_86| (_ BitVec 32))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_86| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_86|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_86| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_86|)) |c_#memory_$Pointer$#1.offset|) (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_86| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_86|)) |c_#memory_$Pointer$#1.base|) (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_86|))))) is different from true [2024-11-08 18:48:08,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:48:08,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:48:08,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:48:08,603 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 18:48:08,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 34 [2024-11-08 18:48:08,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:48:08,654 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-08 18:48:08,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-08 18:48:08,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:48:09,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 18:48:09,379 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 18:48:09,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-08 18:48:09,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:48:09,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:48:09,677 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 35 treesize of output 31 [2024-11-08 18:48:09,697 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 18:48:09,697 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 15 treesize of output 7 [2024-11-08 18:48:09,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 18:48:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-08 18:48:09,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:48:11,014 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_91| (_ BitVec 32)) (v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_91|))) (= (select (select (store (store |c_#memory_int#1| |v_node_create_~temp~0#1.base_91| v_ArrVal_669) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_91| v_ArrVal_670))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_91| v_ArrVal_671) .cse1) .cse2)))) v_ArrVal_661) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2024-11-08 18:48:11,019 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:48:11,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976031215] [2024-11-08 18:48:11,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976031215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:48:11,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1277691502] [2024-11-08 18:48:11,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:48:11,019 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:48:11,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:48:11,021 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:48:11,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-08 18:48:11,556 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:48:11,556 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:48:11,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-08 18:48:11,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:48:11,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 18:48:11,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:48:12,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:48:12,249 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-08 18:48:12,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-08 18:48:12,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 18:48:12,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:48:12,516 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 23 treesize of output 11 [2024-11-08 18:48:12,543 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 27 treesize of output 15 [2024-11-08 18:48:13,349 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 18:48:13,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-08 18:48:13,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 18:48:13,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 18:48:13,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 18:48:13,881 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_95| (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_95| (store (store (select |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_95|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_95|) (_ bv0 32)))) |c_#memory_$Pointer$#1.base|) (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_95|)) (= (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_95| (store (store (select |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_95|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_95|) (_ bv0 32)))) |c_#memory_$Pointer$#1.offset|) (= (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_95| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_95|)) |c_#memory_int#1|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (and (not (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_12|) (_ bv0 32)) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_12|) (_ bv0 32)) (_ bv0 32))))) is different from true [2024-11-08 18:48:14,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:48:14,046 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-08 18:48:14,047 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 2 case distinctions, treesize of input 49 treesize of output 39 [2024-11-08 18:48:14,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:48:14,133 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-08 18:48:14,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-08 18:48:14,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-08 18:48:14,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:48:16,207 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-08 18:48:16,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 22 [2024-11-08 18:48:16,234 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 18:48:16,234 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 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-08 18:48:16,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:48:16,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:48:16,750 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 35 treesize of output 27 [2024-11-08 18:48:16,769 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 18:48:16,769 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 15 treesize of output 7 [2024-11-08 18:48:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-08 18:48:17,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:48:19,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (and (forall ((|v_node_create_~temp~0#1.base_100| (_ BitVec 32))) (or (forall ((v_ArrVal_759 (_ BitVec 32)) (v_ArrVal_758 (_ BitVec 32)) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_100| (store (store (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_100|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_758)))) (select .cse3 (select (select .cse3 .cse4) .cse5))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_100| (store (store (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_100|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_759)) .cse4) .cse5))))) (or (= (_ bv0 32) .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_node_create_~temp~0#1.base_100| v_ArrVal_757) .cse0 v_ArrVal_661) .cse1) .cse2))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_100|))))) (forall ((|v_node_create_~temp~0#1.base_100| (_ BitVec 32))) (or (forall ((v_ArrVal_759 (_ BitVec 32)) (v_ArrVal_758 (_ BitVec 32)) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_100| (store (store (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_100|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_759))) (.cse9 (store |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_100| (store (store (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_100|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_758)))) (let ((.cse7 (select (select .cse9 .cse4) .cse5)) (.cse8 (bvadd (_ bv4 32) (select (select .cse6 .cse4) .cse5)))) (or (= (_ bv0 32) (select (select .cse6 .cse7) .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_node_create_~temp~0#1.base_100| v_ArrVal_757) (select (select .cse9 .cse7) .cse8) v_ArrVal_661) .cse1) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_100|))))))) is different from false [2024-11-08 18:48:19,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1277691502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:48:19,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:48:19,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 42 [2024-11-08 18:48:19,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875936278] [2024-11-08 18:48:19,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:48:19,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-08 18:48:19,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:48:19,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-08 18:48:19,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2235, Unknown=31, NotChecked=396, Total=2862 [2024-11-08 18:48:19,297 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 42 states, 40 states have (on average 1.6) internal successors, (64), 35 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:48:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:48:23,213 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2024-11-08 18:48:23,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 18:48:23,214 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.6) internal successors, (64), 35 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 43 [2024-11-08 18:48:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:48:23,215 INFO L225 Difference]: With dead ends: 94 [2024-11-08 18:48:23,215 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 18:48:23,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=242, Invalid=2822, Unknown=32, NotChecked=444, Total=3540 [2024-11-08 18:48:23,217 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:48:23,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 394 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 781 Invalid, 0 Unknown, 160 Unchecked, 2.7s Time] [2024-11-08 18:48:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 18:48:23,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2024-11-08 18:48:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 66 states have internal predecessors, (75), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:48:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2024-11-08 18:48:23,240 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 43 [2024-11-08 18:48:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:48:23,241 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2024-11-08 18:48:23,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.6) internal successors, (64), 35 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:48:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2024-11-08 18:48:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 18:48:23,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:48:23,242 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:48:23,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2024-11-08 18:48:23,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-08 18:48:23,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:48:23,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:48:23,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:48:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1071784839, now seen corresponding path program 1 times [2024-11-08 18:48:23,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:48:23,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [691402130] [2024-11-08 18:48:23,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:48:23,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:48:23,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:48:23,645 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:48:23,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 18:48:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:23,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-08 18:48:23,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:48:23,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 18:48:23,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:48:24,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 18:48:24,316 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-08 18:48:24,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-08 18:48:24,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 18:48:24,448 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 15 treesize of output 1 [2024-11-08 18:48:24,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:48:24,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:48:24,883 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 32 treesize of output 16 [2024-11-08 18:48:24,893 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 18:48:24,901 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 11 treesize of output 3 [2024-11-08 18:48:25,135 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_104| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_104|)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_104| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_104|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_104| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_104|))) (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_104| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_104|)) |c_#memory_$Pointer$#1.base|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_13| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_13| (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_13|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_13|)))) is different from true [2024-11-08 18:48:25,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:48:25,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2024-11-08 18:48:25,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:48:25,214 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 24 treesize of output 19 [2024-11-08 18:48:25,260 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-08 18:48:25,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-08 18:48:25,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:48:25,991 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-08 18:48:25,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 76 [2024-11-08 18:48:25,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-08 18:48:26,013 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 55 treesize of output 19 [2024-11-08 18:48:26,156 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 50 treesize of output 30 [2024-11-08 18:48:26,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 18:48:26,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 18:48:26,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 18:48:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-08 18:48:26,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:48:27,064 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (_ BitVec 32)) (v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) v_ArrVal_832)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_835) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_834) .cse0) .cse1))))) is different from false [2024-11-08 18:48:28,117 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (_ BitVec 32)) (v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_110| (_ BitVec 32)) (v_ArrVal_843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_834 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_110|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_110| v_ArrVal_845)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_110| v_ArrVal_843)) (.cse1 (select (select .cse5 .cse3) .cse4)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int#1| |v_node_create_~temp~0#1.base_110| v_ArrVal_844))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd (select (select .cse2 .cse3) .cse4) (_ bv4 32)) v_ArrVal_832))) (select (select (store .cse5 .cse1 v_ArrVal_835) .cse6) .cse7)) (select (select (store .cse2 .cse1 v_ArrVal_834) .cse6) .cse7))))))) is different from false [2024-11-08 18:48:28,132 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:48:28,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691402130] [2024-11-08 18:48:28,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691402130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:48:28,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1097925986] [2024-11-08 18:48:28,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:48:28,133 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:48:28,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:48:28,135 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:48:28,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-08 18:48:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:28,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-08 18:48:28,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:48:28,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 18:48:28,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:48:29,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 18:48:29,343 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-08 18:48:29,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-08 18:48:29,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 18:48:29,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:48:29,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:48:29,601 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 15 treesize of output 1 [2024-11-08 18:48:30,306 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 47 treesize of output 23 [2024-11-08 18:48:30,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 18:48:30,323 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 18:48:30,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 18:48:30,705 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_113| (_ BitVec 32))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_113| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_113|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_113| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_113|)) |c_#memory_$Pointer$#1.offset|) (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_113| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_113|)) |c_#memory_$Pointer$#1.base|) (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_113|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_14|) (_ bv0 32))))) is different from true [2024-11-08 18:48:30,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:48:30,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2024-11-08 18:48:30,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:48:30,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 24 treesize of output 19 [2024-11-08 18:48:30,830 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-08 18:48:30,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-08 18:48:30,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:48:31,854 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-08 18:48:31,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 76 [2024-11-08 18:48:31,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-08 18:48:31,880 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 55 treesize of output 19 [2024-11-08 18:48:32,114 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 50 treesize of output 30 [2024-11-08 18:48:32,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 18:48:32,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 18:48:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-08 18:48:32,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:48:34,141 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_832 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_119| (_ BitVec 32)) (v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_930 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_834 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_119| v_ArrVal_930)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_119| v_ArrVal_931)) (.cse1 (select (select .cse5 .cse3) .cse4)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int#1| |v_node_create_~temp~0#1.base_119| v_ArrVal_929))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd (_ bv4 32) (select (select .cse2 .cse3) .cse4)) v_ArrVal_832))) (select (select (store .cse5 .cse1 v_ArrVal_835) .cse6) .cse7)) (select (select (store .cse2 .cse1 v_ArrVal_834) .cse6) .cse7))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_119|))))) is different from false [2024-11-08 18:48:34,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1097925986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:48:34,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:48:34,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 43 [2024-11-08 18:48:34,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748721011] [2024-11-08 18:48:34,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:48:34,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-08 18:48:34,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:48:34,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-08 18:48:34,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2075, Unknown=37, NotChecked=480, Total=2756 [2024-11-08 18:48:34,158 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 36 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:48:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:48:38,925 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-11-08 18:48:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 18:48:38,926 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 36 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2024-11-08 18:48:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:48:38,927 INFO L225 Difference]: With dead ends: 87 [2024-11-08 18:48:38,927 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 18:48:38,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=254, Invalid=3385, Unknown=41, NotChecked=610, Total=4290 [2024-11-08 18:48:38,928 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 30 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:48:38,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 574 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 991 Invalid, 0 Unknown, 126 Unchecked, 3.1s Time] [2024-11-08 18:48:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 18:48:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2024-11-08 18:48:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 66 states have internal predecessors, (75), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:48:38,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2024-11-08 18:48:38,954 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 44 [2024-11-08 18:48:38,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:48:38,954 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2024-11-08 18:48:38,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 36 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:48:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2024-11-08 18:48:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 18:48:38,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:48:38,956 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:48:38,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-08 18:48:39,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-08 18:48:39,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 18:48:39,357 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:48:39,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:48:39,357 INFO L85 PathProgramCache]: Analyzing trace with hash -662186508, now seen corresponding path program 2 times [2024-11-08 18:48:39,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:48:39,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649235286] [2024-11-08 18:48:39,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:48:39,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:48:39,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:48:39,359 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:48:39,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-08 18:48:39,580 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:48:39,581 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:48:39,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 18:48:39,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:48:40,155 INFO L349 Elim1Store]: treesize reduction 45, result has 35.7 percent of original size [2024-11-08 18:48:40,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 45 [2024-11-08 18:48:40,186 INFO L349 Elim1Store]: treesize reduction 59, result has 15.7 percent of original size [2024-11-08 18:48:40,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 32 [2024-11-08 18:48:40,210 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 33 treesize of output 21 [2024-11-08 18:48:40,292 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 25 treesize of output 17 [2024-11-08 18:48:40,296 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 21 treesize of output 13 [2024-11-08 18:48:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:48:40,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:48:46,019 INFO L349 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2024-11-08 18:48:46,020 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 38 treesize of output 33 [2024-11-08 18:48:46,044 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-08 18:48:46,044 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 32 treesize of output 12 [2024-11-08 18:48:46,140 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-08 18:48:46,140 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 11 treesize of output 11 [2024-11-08 18:48:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 18:48:46,271 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:48:46,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649235286] [2024-11-08 18:48:46,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649235286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:48:46,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:48:46,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 24 [2024-11-08 18:48:46,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719118256] [2024-11-08 18:48:46,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:48:46,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 18:48:46,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:48:46,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 18:48:46,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=481, Unknown=1, NotChecked=0, Total=552 [2024-11-08 18:48:46,274 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:48:50,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:48:54,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:48:56,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:48:56,203 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2024-11-08 18:48:56,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 18:48:56,204 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2024-11-08 18:48:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:48:56,205 INFO L225 Difference]: With dead ends: 86 [2024-11-08 18:48:56,205 INFO L226 Difference]: Without dead ends: 83 [2024-11-08 18:48:56,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=122, Invalid=869, Unknown=1, NotChecked=0, Total=992 [2024-11-08 18:48:56,206 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:48:56,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 243 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 365 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2024-11-08 18:48:56,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-08 18:48:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-08 18:48:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.1267605633802817) internal successors, (80), 71 states have internal predecessors, (80), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:48:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2024-11-08 18:48:56,244 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 45 [2024-11-08 18:48:56,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:48:56,244 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2024-11-08 18:48:56,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:48:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2024-11-08 18:48:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 18:48:56,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:48:56,246 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:48:56,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-08 18:48:56,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:48:56,447 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:48:56,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:48:56,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1473005601, now seen corresponding path program 3 times [2024-11-08 18:48:56,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:48:56,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83764047] [2024-11-08 18:48:56,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 18:48:56,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:48:56,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:48:56,451 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:48:56,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-08 18:48:57,966 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 18:48:57,967 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:48:57,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-08 18:48:57,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:48:58,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 18:48:58,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:48:58,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:48:58,447 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-08 18:48:58,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-08 18:48:58,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 18:48:58,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 18:48:58,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 18:48:58,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-08 18:48:59,147 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 18:48:59,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2024-11-08 18:48:59,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-08 18:48:59,172 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 18:49:03,380 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_131| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_131|)) (= (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_131| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_131|)) |c_#memory_$Pointer$#1.offset|) (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_131| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_131|)) |c_#memory_$Pointer$#1.base|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_17| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_17| (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_17|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_17|)))) is different from true [2024-11-08 18:49:03,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:49:03,491 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 18:49:03,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 53 [2024-11-08 18:49:03,558 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-08 18:49:03,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-08 18:49:03,575 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-08 18:49:03,865 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 18:49:03,866 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 15 treesize of output 7 [2024-11-08 18:49:04,180 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 18:49:04,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2024-11-08 18:49:04,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-08 18:49:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2024-11-08 18:49:04,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:49:05,096 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:49:05,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83764047] [2024-11-08 18:49:05,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83764047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:49:05,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [676494666] [2024-11-08 18:49:05,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 18:49:05,097 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:49:05,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:49:05,098 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:49:05,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-08 18:49:05,920 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 18:49:05,921 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:49:05,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-08 18:49:05,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:49:06,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 18:49:06,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:49:06,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:49:10,738 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 18:49:10,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-08 18:49:10,785 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-08 18:49:10,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-08 18:49:10,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 18:49:10,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-08 18:49:10,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-11-08 18:49:11,670 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-08 18:49:11,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 29 [2024-11-08 18:49:11,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-08 18:49:11,686 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 18:49:11,827 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_140| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_node_create_~temp~0#1.base_140|)) (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_140| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_140|)) |c_#memory_$Pointer$#1.base|) (= (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_140| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_140|)) |c_#memory_$Pointer$#1.offset|))) is different from true [2024-11-08 18:49:11,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:49:11,902 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 18:49:11,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 77 [2024-11-08 18:49:11,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:49:11,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:49:11,935 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-08 18:49:11,999 INFO L349 Elim1Store]: treesize reduction 12, result has 69.2 percent of original size [2024-11-08 18:49:11,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 40 [2024-11-08 18:49:12,735 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-08 18:49:12,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 22 [2024-11-08 18:49:12,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-08 18:49:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2024-11-08 18:49:12,863 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:49:17,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [676494666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:49:17,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:49:17,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 36 [2024-11-08 18:49:17,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381898440] [2024-11-08 18:49:17,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:49:17,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-08 18:49:17,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:49:17,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-08 18:49:17,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=8, NotChecked=146, Total=1560 [2024-11-08 18:49:17,495 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 36 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 30 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:49:21,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:25,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:49:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:49:33,088 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2024-11-08 18:49:33,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 18:49:33,089 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 30 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2024-11-08 18:49:33,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:49:33,090 INFO L225 Difference]: With dead ends: 96 [2024-11-08 18:49:33,090 INFO L226 Difference]: Without dead ends: 75 [2024-11-08 18:49:33,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=159, Invalid=2002, Unknown=9, NotChecked=182, Total=2352 [2024-11-08 18:49:33,092 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:49:33,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 398 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 593 Invalid, 2 Unknown, 116 Unchecked, 10.4s Time] [2024-11-08 18:49:33,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-08 18:49:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-08 18:49:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:49:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-11-08 18:49:33,118 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 45 [2024-11-08 18:49:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:49:33,118 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-11-08 18:49:33,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 30 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:49:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-11-08 18:49:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 18:49:33,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:49:33,120 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:49:33,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-08 18:49:33,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2024-11-08 18:49:33,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 18:49:33,524 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:49:33,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:49:33,525 INFO L85 PathProgramCache]: Analyzing trace with hash 806962131, now seen corresponding path program 3 times [2024-11-08 18:49:33,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:49:33,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1924965733] [2024-11-08 18:49:33,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 18:49:33,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:49:33,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:49:33,527 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:49:33,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b2312-2272-4e5d-b409-19932f81d739/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-08 18:49:34,248 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-08 18:49:34,248 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:49:34,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 18:49:34,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:49:35,660 INFO L349 Elim1Store]: treesize reduction 69, result has 32.4 percent of original size [2024-11-08 18:49:35,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 123 [2024-11-08 18:49:35,695 INFO L349 Elim1Store]: treesize reduction 67, result has 14.1 percent of original size [2024-11-08 18:49:35,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 85 [2024-11-08 18:49:35,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:49:35,878 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 79 treesize of output 59 [2024-11-08 18:49:35,912 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 18:49:35,912 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 15 treesize of output 7 [2024-11-08 18:49:36,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2024-11-08 18:49:36,791 INFO L349 Elim1Store]: treesize reduction 44, result has 58.1 percent of original size [2024-11-08 18:49:36,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 103 [2024-11-08 18:49:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:49:37,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:49:38,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:49:38,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 492 treesize of output 471 [2024-11-08 18:49:38,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:49:38,962 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 861 treesize of output 576