./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya --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 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:15:42,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:15:42,731 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:15:42,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:15:42,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:15:42,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:15:42,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:15:42,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:15:42,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:15:42,762 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:15:42,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:15:42,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:15:42,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:15:42,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:15:42,765 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:15:42,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:15:42,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:15:42,766 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:15:42,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:15:42,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:15:42,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:15:42,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:15:42,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:15:42,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:15:42,770 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:15:42,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:15:42,771 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:15:42,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:15:42,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:15:42,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:15:42,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:15:42,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:15:42,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:15:42,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:15:42,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:15:42,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:15:42,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:15:42,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:15:42,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:15:42,774 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:15:42,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:15:42,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:15:42,775 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_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/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_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2023-11-29 01:15:42,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:15:43,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:15:43,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:15:43,023 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:15:43,023 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:15:43,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2023-11-29 01:15:45,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:15:46,072 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:15:46,072 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2023-11-29 01:15:46,084 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/data/20b359b62/f7d14a5bbf5e4e9b8b8b5e60301a129d/FLAG41024ef73 [2023-11-29 01:15:46,094 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/data/20b359b62/f7d14a5bbf5e4e9b8b8b5e60301a129d [2023-11-29 01:15:46,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:15:46,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:15:46,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:15:46,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:15:46,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:15:46,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:15:46" (1/1) ... [2023-11-29 01:15:46,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a92f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46, skipping insertion in model container [2023-11-29 01:15:46,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:15:46" (1/1) ... [2023-11-29 01:15:46,155 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:15:46,438 WARN L240 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_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2023-11-29 01:15:46,442 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:15:46,453 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:15:46,492 WARN L240 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_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2023-11-29 01:15:46,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:15:46,524 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:15:46,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46 WrapperNode [2023-11-29 01:15:46,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:15:46,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:15:46,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:15:46,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:15:46,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46" (1/1) ... [2023-11-29 01:15:46,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46" (1/1) ... [2023-11-29 01:15:46,573 INFO L138 Inliner]: procedures = 127, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2023-11-29 01:15:46,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:15:46,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:15:46,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:15:46,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:15:46,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46" (1/1) ... [2023-11-29 01:15:46,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46" (1/1) ... [2023-11-29 01:15:46,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46" (1/1) ... [2023-11-29 01:15:46,612 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 12, 6]. 60 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]. [2023-11-29 01:15:46,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46" (1/1) ... [2023-11-29 01:15:46,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46" (1/1) ... [2023-11-29 01:15:46,621 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46" (1/1) ... [2023-11-29 01:15:46,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46" (1/1) ... [2023-11-29 01:15:46,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46" (1/1) ... [2023-11-29 01:15:46,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46" (1/1) ... [2023-11-29 01:15:46,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:15:46,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:15:46,634 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:15:46,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:15:46,635 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46" (1/1) ... [2023-11-29 01:15:46,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:15:46,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:15:46,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:15:46,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:15:46,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:15:46,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 01:15:46,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 01:15:46,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:15:46,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:15:46,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 01:15:46,706 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 01:15:46,706 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 01:15:46,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:15:46,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:15:46,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:15:46,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:15:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:15:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 01:15:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:15:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:15:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 01:15:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:15:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 01:15:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 01:15:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 01:15:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:15:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:15:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 01:15:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:15:46,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:15:46,838 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:15:46,840 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:15:47,029 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:15:47,061 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:15:47,062 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 01:15:47,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:15:47 BoogieIcfgContainer [2023-11-29 01:15:47,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:15:47,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:15:47,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:15:47,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:15:47,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:15:46" (1/3) ... [2023-11-29 01:15:47,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68444ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:15:47, skipping insertion in model container [2023-11-29 01:15:47,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:15:46" (2/3) ... [2023-11-29 01:15:47,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68444ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:15:47, skipping insertion in model container [2023-11-29 01:15:47,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:15:47" (3/3) ... [2023-11-29 01:15:47,071 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2023-11-29 01:15:47,086 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:15:47,086 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:15:47,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:15:47,132 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@40c4055c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:15:47,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:15:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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) [2023-11-29 01:15:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:15:47,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:15:47,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:15:47,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:15:47,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:15:47,147 INFO L85 PathProgramCache]: Analyzing trace with hash -427772013, now seen corresponding path program 1 times [2023-11-29 01:15:47,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:15:47,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920140471] [2023-11-29 01:15:47,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:15:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:15:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:47,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 01:15:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:15:47,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:15:47,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920140471] [2023-11-29 01:15:47,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920140471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:15:47,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:15:47,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:15:47,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536986776] [2023-11-29 01:15:47,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:15:47,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:15:47,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:15:47,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:15:47,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:15:47,411 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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) [2023-11-29 01:15:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:15:47,493 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2023-11-29 01:15:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:15:47,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2023-11-29 01:15:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:15:47,503 INFO L225 Difference]: With dead ends: 54 [2023-11-29 01:15:47,503 INFO L226 Difference]: Without dead ends: 24 [2023-11-29 01:15:47,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:15:47,509 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:15:47,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:15:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-29 01:15:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-29 01:15:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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) [2023-11-29 01:15:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-29 01:15:47,546 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2023-11-29 01:15:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:15:47,546 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-29 01:15:47,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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) [2023-11-29 01:15:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-29 01:15:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:15:47,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:15:47,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:15:47,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:15:47,549 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:15:47,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:15:47,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1460433765, now seen corresponding path program 1 times [2023-11-29 01:15:47,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:15:47,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577824394] [2023-11-29 01:15:47,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:15:47,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:15:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:47,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 01:15:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:15:47,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:15:47,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577824394] [2023-11-29 01:15:47,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577824394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:15:47,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:15:47,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:15:47,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173952915] [2023-11-29 01:15:47,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:15:47,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:15:47,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:15:47,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:15:47,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:15:47,713 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2023-11-29 01:15:47,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:15:47,759 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2023-11-29 01:15:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:15:47,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2023-11-29 01:15:47,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:15:47,760 INFO L225 Difference]: With dead ends: 47 [2023-11-29 01:15:47,760 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 01:15:47,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:15:47,762 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:15:47,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:15:47,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 01:15:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-11-29 01:15:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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) [2023-11-29 01:15:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-11-29 01:15:47,770 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 13 [2023-11-29 01:15:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:15:47,771 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-29 01:15:47,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2023-11-29 01:15:47,771 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-11-29 01:15:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 01:15:47,772 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:15:47,772 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:15:47,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:15:47,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:15:47,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:15:47,773 INFO L85 PathProgramCache]: Analyzing trace with hash 778109461, now seen corresponding path program 1 times [2023-11-29 01:15:47,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:15:47,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969877315] [2023-11-29 01:15:47,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:15:47,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:15:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:47,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:15:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:47,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:15:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:15:47,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:15:47,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969877315] [2023-11-29 01:15:47,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969877315] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:15:47,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327008249] [2023-11-29 01:15:47,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:15:47,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:15:47,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:15:47,950 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:15:47,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:15:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:48,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:15:48,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:15:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:15:48,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:15:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:15:48,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327008249] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:15:48,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:15:48,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-11-29 01:15:48,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768326986] [2023-11-29 01:15:48,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:15:48,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:15:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:15:48,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:15:48,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:15:48,183 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2023-11-29 01:15:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:15:48,239 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2023-11-29 01:15:48,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:15:48,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2023-11-29 01:15:48,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:15:48,240 INFO L225 Difference]: With dead ends: 48 [2023-11-29 01:15:48,240 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 01:15:48,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:15:48,242 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:15:48,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 87 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:15:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 01:15:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 01:15:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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) [2023-11-29 01:15:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-11-29 01:15:48,249 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 19 [2023-11-29 01:15:48,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:15:48,249 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-11-29 01:15:48,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2023-11-29 01:15:48,249 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2023-11-29 01:15:48,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 01:15:48,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:15:48,250 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:15:48,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:15:48,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:15:48,451 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:15:48,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:15:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1663372273, now seen corresponding path program 2 times [2023-11-29 01:15:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:15:48,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37445134] [2023-11-29 01:15:48,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:15:48,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:15:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:15:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:15:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:48,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:15:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:15:48,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:15:48,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37445134] [2023-11-29 01:15:48,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37445134] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:15:48,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224653432] [2023-11-29 01:15:48,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:15:48,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:15:48,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:15:48,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:15:48,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:15:49,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:15:49,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:15:49,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 01:15:49,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:15:49,244 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 [2023-11-29 01:15:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:15:49,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:15:49,299 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 8 treesize of output 4 [2023-11-29 01:15:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:15:49,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224653432] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:15:49,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:15:49,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2023-11-29 01:15:49,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332285378] [2023-11-29 01:15:49,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:15:49,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 01:15:49,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:15:49,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 01:15:49,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-11-29 01:15:49,338 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 01:15:53,353 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] [2023-11-29 01:15:57,362 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] [2023-11-29 01:16:01,373 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] [2023-11-29 01:16:05,393 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] [2023-11-29 01:16:09,436 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] [2023-11-29 01:16:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:16:09,605 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2023-11-29 01:16:09,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 01:16:09,605 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 25 [2023-11-29 01:16:09,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:16:09,606 INFO L225 Difference]: With dead ends: 41 [2023-11-29 01:16:09,607 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 01:16:09,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2023-11-29 01:16:09,608 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 54 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:16:09,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 183 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2023-11-29 01:16:09,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 01:16:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-29 01:16:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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) [2023-11-29 01:16:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-29 01:16:09,616 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 25 [2023-11-29 01:16:09,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:16:09,616 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-29 01:16:09,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 01:16:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-11-29 01:16:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 01:16:09,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:16:09,618 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:16:09,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:16:09,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-29 01:16:09,819 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:16:09,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:16:09,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1265695951, now seen corresponding path program 1 times [2023-11-29 01:16:09,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:16:09,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054055625] [2023-11-29 01:16:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:09,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:16:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:10,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:16:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:10,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:16:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:10,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:16:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:16:10,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:16:10,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054055625] [2023-11-29 01:16:10,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054055625] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:10,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982186918] [2023-11-29 01:16:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:10,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:16:10,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:16:10,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:16:10,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:16:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:11,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-29 01:16:11,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:16:11,063 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 [2023-11-29 01:16:11,143 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 [2023-11-29 01:16:11,219 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 [2023-11-29 01:16:11,223 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 [2023-11-29 01:16:11,263 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 01:16:11,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:11,274 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 [2023-11-29 01:16:11,292 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 01:16:11,293 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 [2023-11-29 01:16:11,446 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2023-11-29 01:16:11,447 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 [2023-11-29 01:16:11,458 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 28 [2023-11-29 01:16:11,461 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 20 [2023-11-29 01:16:11,463 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 [2023-11-29 01:16:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-29 01:16:11,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:16:11,701 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (|v_node_create_~temp~0#1.base_27| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_27| v_ArrVal_469) (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|) 4)) 0)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_27|) 0)))) is different from false [2023-11-29 01:16:11,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982186918] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:11,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:16:11,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 28 [2023-11-29 01:16:11,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691582977] [2023-11-29 01:16:11,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:16:11,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 01:16:11,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:16:11,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 01:16:11,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=736, Unknown=2, NotChecked=110, Total=930 [2023-11-29 01:16:11,706 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 28 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 23 states have internal predecessors, (37), 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) [2023-11-29 01:16:12,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:16:12,256 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2023-11-29 01:16:12,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:16:12,256 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 23 states have internal predecessors, (37), 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 28 [2023-11-29 01:16:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:16:12,258 INFO L225 Difference]: With dead ends: 45 [2023-11-29 01:16:12,258 INFO L226 Difference]: Without dead ends: 34 [2023-11-29 01:16:12,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=1271, Unknown=2, NotChecked=146, Total=1560 [2023-11-29 01:16:12,261 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:16:12,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 263 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 332 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2023-11-29 01:16:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-29 01:16:12,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-11-29 01:16:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2023-11-29 01:16:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-11-29 01:16:12,269 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 28 [2023-11-29 01:16:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:16:12,269 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-11-29 01:16:12,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 23 states have internal predecessors, (37), 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) [2023-11-29 01:16:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-11-29 01:16:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 01:16:12,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:16:12,271 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:16:12,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 01:16:12,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:16:12,472 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:16:12,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:16:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash -763742840, now seen corresponding path program 1 times [2023-11-29 01:16:12,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:16:12,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747529773] [2023-11-29 01:16:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:16:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:13,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:16:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:13,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:16:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:13,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:16:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:16:13,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:16:13,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747529773] [2023-11-29 01:16:13,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747529773] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802256017] [2023-11-29 01:16:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:13,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:16:13,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:16:13,998 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:16:14,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 01:16:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:14,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 102 conjunts are in the unsatisfiable core [2023-11-29 01:16:14,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:16:14,390 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 [2023-11-29 01:16:14,402 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 [2023-11-29 01:16:14,486 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 [2023-11-29 01:16:14,494 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 [2023-11-29 01:16:14,649 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 [2023-11-29 01:16:14,653 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 [2023-11-29 01:16:14,657 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 [2023-11-29 01:16:14,768 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |node_create_~temp~0#1.base| (select |c_#memory_int#1| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3|) 0) 0))) is different from true [2023-11-29 01:16:14,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:14,808 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 [2023-11-29 01:16:14,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:14,819 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 [2023-11-29 01:16:14,828 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 01:16:14,828 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 [2023-11-29 01:16:15,171 INFO L349 Elim1Store]: treesize reduction 31, result has 42.6 percent of original size [2023-11-29 01:16:15,171 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 31 treesize of output 27 [2023-11-29 01:16:15,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:15,179 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 31 treesize of output 15 [2023-11-29 01:16:15,262 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 [2023-11-29 01:16:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-29 01:16:15,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:16:15,553 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_628 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_21| Int)) (or (= (select (select (store |c_#memory_int#1| v_subst_2 v_ArrVal_628) (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|) (not (= v_ArrVal_628 (let ((.cse0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_21| 4))) (store (select |c_#memory_int#1| v_subst_2) .cse0 (select v_ArrVal_628 .cse0))))) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_21| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))))) is different from false [2023-11-29 01:16:15,569 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_628 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_21| Int)) (or (= (select (select (store |c_#memory_int#1| v_subst_2 v_ArrVal_628) (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|) (not (= v_ArrVal_628 (let ((.cse0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_21| 4))) (store (select |c_#memory_int#1| v_subst_2) .cse0 (select v_ArrVal_628 .cse0))))) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_21| (select (select |c_#memory_$Pointer$#1.offset| (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))))) is different from false [2023-11-29 01:16:15,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802256017] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:15,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:16:15,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2023-11-29 01:16:15,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045449409] [2023-11-29 01:16:15,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:16:15,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 01:16:15,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:16:15,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 01:16:15,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1338, Unknown=23, NotChecked=228, Total=1722 [2023-11-29 01:16:15,731 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 37 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 30 states have internal predecessors, (49), 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) [2023-11-29 01:16:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:16:16,516 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-11-29 01:16:16,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 01:16:16,517 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 30 states have internal predecessors, (49), 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 32 [2023-11-29 01:16:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:16:16,518 INFO L225 Difference]: With dead ends: 56 [2023-11-29 01:16:16,518 INFO L226 Difference]: Without dead ends: 54 [2023-11-29 01:16:16,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=237, Invalid=2302, Unknown=23, NotChecked=300, Total=2862 [2023-11-29 01:16:16,519 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 65 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:16:16,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 265 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 472 Invalid, 0 Unknown, 60 Unchecked, 0.3s Time] [2023-11-29 01:16:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-29 01:16:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2023-11-29 01:16:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 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) [2023-11-29 01:16:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2023-11-29 01:16:16,527 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2023-11-29 01:16:16,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:16:16,527 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2023-11-29 01:16:16,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 30 states have internal predecessors, (49), 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) [2023-11-29 01:16:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2023-11-29 01:16:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 01:16:16,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:16:16,529 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:16:16,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 01:16:16,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 01:16:16,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:16:16,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:16:16,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2093721238, now seen corresponding path program 1 times [2023-11-29 01:16:16,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:16:16,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9423855] [2023-11-29 01:16:16,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:16,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:16:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:16,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:16:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:16,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:16:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:16,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:16:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 01:16:16,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:16:16,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9423855] [2023-11-29 01:16:16,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9423855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:16:16,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:16:16,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:16:16,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323959637] [2023-11-29 01:16:16,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:16:16,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:16:16,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:16:16,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:16:16,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:16:16,863 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:16:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:16:16,930 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2023-11-29 01:16:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:16:16,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-11-29 01:16:16,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:16:16,932 INFO L225 Difference]: With dead ends: 51 [2023-11-29 01:16:16,932 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 01:16:16,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:16:16,933 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:16:16,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 85 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:16:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 01:16:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2023-11-29 01:16:16,941 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) [2023-11-29 01:16:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2023-11-29 01:16:16,942 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 33 [2023-11-29 01:16:16,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:16:16,942 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2023-11-29 01:16:16,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:16:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2023-11-29 01:16:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 01:16:16,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:16:16,944 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:16:16,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:16:16,945 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:16:16,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:16:16,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2033027363, now seen corresponding path program 2 times [2023-11-29 01:16:16,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:16:16,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577990586] [2023-11-29 01:16:16,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:16,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:16:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:18,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:16:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:18,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:16:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:18,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:16:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:16:18,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:16:18,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577990586] [2023-11-29 01:16:18,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577990586] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:18,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522555952] [2023-11-29 01:16:18,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:16:18,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:16:18,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:16:18,486 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:16:18,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 01:16:18,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:16:18,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:16:18,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 138 conjunts are in the unsatisfiable core [2023-11-29 01:16:18,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:16:18,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:16:18,814 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 [2023-11-29 01:16:18,978 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 [2023-11-29 01:16:19,063 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:16:19,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 01:16:19,078 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 [2023-11-29 01:16:19,154 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 [2023-11-29 01:16:19,162 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 [2023-11-29 01:16:19,173 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 [2023-11-29 01:16:19,383 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 01:16:19,384 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 29 treesize of output 20 [2023-11-29 01:16:19,391 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 15 treesize of output 7 [2023-11-29 01:16:19,397 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 [2023-11-29 01:16:19,402 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 [2023-11-29 01:16:39,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:39,879 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 01:16:39,880 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 37 treesize of output 32 [2023-11-29 01:16:39,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:39,926 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 01:16:39,926 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 [2023-11-29 01:16:39,935 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 [2023-11-29 01:16:39,947 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 [2023-11-29 01:16:40,429 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 [2023-11-29 01:16:40,689 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 01:16:40,690 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 [2023-11-29 01:16:40,922 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 [2023-11-29 01:16:41,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:16:41,085 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 [2023-11-29 01:16:41,103 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:16:41,103 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 [2023-11-29 01:16:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:16:41,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:16:41,813 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_894 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#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)) v_ArrVal_894) (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|)))) is different from false [2023-11-29 01:16:41,830 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_894 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0)) (+ 4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0)))) v_ArrVal_894) (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|)))) is different from false [2023-11-29 01:16:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522555952] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:42,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:16:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 39 [2023-11-29 01:16:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925685212] [2023-11-29 01:16:42,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:16:42,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 01:16:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:16:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 01:16:42,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1831, Unknown=25, NotChecked=174, Total=2162 [2023-11-29 01:16:42,341 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 39 states, 32 states have (on average 1.6875) internal successors, (54), 31 states have internal predecessors, (54), 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) [2023-11-29 01:16:45,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:16:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:16:52,752 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2023-11-29 01:16:52,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 01:16:52,753 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.6875) internal successors, (54), 31 states have internal predecessors, (54), 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 34 [2023-11-29 01:16:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:16:52,754 INFO L225 Difference]: With dead ends: 88 [2023-11-29 01:16:52,754 INFO L226 Difference]: Without dead ends: 73 [2023-11-29 01:16:52,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=280, Invalid=3483, Unknown=27, NotChecked=242, Total=4032 [2023-11-29 01:16:52,756 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 40 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:16:52,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 303 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 01:16:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-29 01:16:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2023-11-29 01:16:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:16:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2023-11-29 01:16:52,768 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 34 [2023-11-29 01:16:52,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:16:52,768 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2023-11-29 01:16:52,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.6875) internal successors, (54), 31 states have internal predecessors, (54), 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) [2023-11-29 01:16:52,769 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2023-11-29 01:16:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 01:16:52,770 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:16:52,770 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:16:52,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 01:16:52,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:16:52,970 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:16:52,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:16:52,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2074439326, now seen corresponding path program 1 times [2023-11-29 01:16:52,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:16:52,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224192888] [2023-11-29 01:16:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:52,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:16:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:55,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:16:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:55,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:16:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:56,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:16:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:16:56,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:16:56,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224192888] [2023-11-29 01:16:56,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224192888] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:56,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735967608] [2023-11-29 01:16:56,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:56,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:16:56,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:16:56,572 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:16:56,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 01:16:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:56,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 150 conjunts are in the unsatisfiable core [2023-11-29 01:16:56,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:16:56,842 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 [2023-11-29 01:16:56,935 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 [2023-11-29 01:16:57,190 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 [2023-11-29 01:16:57,198 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 [2023-11-29 01:16:57,206 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 [2023-11-29 01:16:57,789 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:16:57,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 01:16:57,809 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 [2023-11-29 01:16:57,825 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 [2023-11-29 01:16:57,835 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 [2023-11-29 01:16:57,991 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 26 [2023-11-29 01:16:58,004 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 22 treesize of output 17 [2023-11-29 01:16:58,022 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 33 treesize of output 17 [2023-11-29 01:16:58,426 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-11-29 01:16:58,427 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 123 treesize of output 38 [2023-11-29 01:16:58,435 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 25 treesize of output 7 [2023-11-29 01:16:58,442 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 15 treesize of output 7 [2023-11-29 01:16:58,447 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 7 treesize of output 3 [2023-11-29 01:16:58,599 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |node_create_~temp~0#1.base| (select |c_#memory_int#1| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 01:16:58,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:16:58,638 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 01:16:58,638 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 131 treesize of output 102 [2023-11-29 01:16:58,680 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-11-29 01:16:58,680 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 34 treesize of output 36 [2023-11-29 01:16:58,688 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 47 treesize of output 45 [2023-11-29 01:16:58,702 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 25 [2023-11-29 01:16:59,747 INFO L349 Elim1Store]: treesize reduction 182, result has 30.5 percent of original size [2023-11-29 01:16:59,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 147 treesize of output 151 [2023-11-29 01:16:59,843 INFO L349 Elim1Store]: treesize reduction 113, result has 30.7 percent of original size [2023-11-29 01:16:59,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 154 treesize of output 93 [2023-11-29 01:16:59,910 INFO L349 Elim1Store]: treesize reduction 53, result has 45.9 percent of original size [2023-11-29 01:16:59,910 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 1 case distinctions, treesize of input 41 treesize of output 49 [2023-11-29 01:17:00,121 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 130 treesize of output 98 [2023-11-29 01:17:00,127 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 102 treesize of output 74 [2023-11-29 01:17:01,071 INFO L349 Elim1Store]: treesize reduction 12, result has 82.6 percent of original size [2023-11-29 01:17:01,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 123 [2023-11-29 01:17:01,233 INFO L349 Elim1Store]: treesize reduction 12, result has 82.6 percent of original size [2023-11-29 01:17:01,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 104 [2023-11-29 01:17:02,042 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 24 [2023-11-29 01:17:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-29 01:17:02,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:17:03,084 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.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 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_1075 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1075 .cse1)) v_ArrVal_1075)) (forall ((v_ArrVal_1077 Int) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse8 .cse1 v_ArrVal_1077)))) (let ((.cse2 (select (select .cse4 .cse6) .cse7)) (.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse5 .cse1 |ULTIMATE.start_sll_append_~new_last~0#1.offset|)) .cse6) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1075) .cse2) .cse3)) (= (select (select .cse4 .cse2) (+ .cse3 4)) 0))))))) (forall ((v_ArrVal_1075 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1075 .cse1)) v_ArrVal_1075)) (forall ((v_ArrVal_1077 Int) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse5 .cse1 |ULTIMATE.start_sll_append_~new_last~0#1.offset|)))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse8 .cse1 v_ArrVal_1077)) .cse6) .cse7)) (.cse10 (select (select .cse11 .cse6) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1075) .cse9) .cse10)) (= (select (select .cse11 .cse9) (+ .cse10 4)) 0))))))))) is different from false [2023-11-29 01:17:05,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735967608] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:05,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:17:05,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 51 [2023-11-29 01:17:05,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136801443] [2023-11-29 01:17:05,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:17:05,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-29 01:17:05,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:05,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-29 01:17:05,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3347, Unknown=2, NotChecked=234, Total=3782 [2023-11-29 01:17:05,961 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 51 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:17:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:12,948 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2023-11-29 01:17:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 01:17:12,948 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 6 states have call successors, (6), 3 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 35 [2023-11-29 01:17:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:12,950 INFO L225 Difference]: With dead ends: 99 [2023-11-29 01:17:12,950 INFO L226 Difference]: Without dead ends: 97 [2023-11-29 01:17:12,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=572, Invalid=7990, Unknown=2, NotChecked=366, Total=8930 [2023-11-29 01:17:12,953 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 155 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:12,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 354 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1060 Invalid, 0 Unknown, 105 Unchecked, 1.9s Time] [2023-11-29 01:17:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-29 01:17:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 60. [2023-11-29 01:17:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:17:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2023-11-29 01:17:12,968 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 35 [2023-11-29 01:17:12,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:12,969 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2023-11-29 01:17:12,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:17:12,969 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2023-11-29 01:17:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 01:17:12,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:12,970 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 01:17:12,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 01:17:13,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:17:13,171 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:13,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:13,172 INFO L85 PathProgramCache]: Analyzing trace with hash -116944832, now seen corresponding path program 1 times [2023-11-29 01:17:13,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:13,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675791334] [2023-11-29 01:17:13,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:13,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:15,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:15,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:17:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:17:15,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:15,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675791334] [2023-11-29 01:17:15,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675791334] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:15,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523094398] [2023-11-29 01:17:15,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:15,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:17:15,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:17:15,512 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:17:15,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 01:17:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:15,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 130 conjunts are in the unsatisfiable core [2023-11-29 01:17:15,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:17:15,867 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 [2023-11-29 01:17:16,342 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:17:16,342 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 [2023-11-29 01:17:16,451 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 [2023-11-29 01:17:16,470 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 [2023-11-29 01:17:16,725 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 [2023-11-29 01:17:16,731 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 [2023-11-29 01:17:16,737 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 [2023-11-29 01:17:17,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:17:17,133 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 [2023-11-29 01:17:17,167 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 01:17:17,167 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 [2023-11-29 01:17:17,185 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 [2023-11-29 01:17:18,083 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-29 01:17:18,084 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 140 treesize of output 70 [2023-11-29 01:17:18,093 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 [2023-11-29 01:17:18,274 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 79 treesize of output 51 [2023-11-29 01:17:18,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:17:18,775 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:17:18,775 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 [2023-11-29 01:17:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:17:18,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:17:20,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523094398] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:20,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:17:20,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 48 [2023-11-29 01:17:20,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77761994] [2023-11-29 01:17:20,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:17:20,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-29 01:17:20,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:20,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-29 01:17:20,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3010, Unknown=7, NotChecked=0, Total=3192 [2023-11-29 01:17:20,370 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 48 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 39 states have internal predecessors, (56), 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) [2023-11-29 01:17:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:23,902 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2023-11-29 01:17:23,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 01:17:23,904 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 39 states have internal predecessors, (56), 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 36 [2023-11-29 01:17:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:23,905 INFO L225 Difference]: With dead ends: 73 [2023-11-29 01:17:23,905 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 01:17:23,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=365, Invalid=5178, Unknown=7, NotChecked=0, Total=5550 [2023-11-29 01:17:23,907 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 68 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:23,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 502 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 01:17:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 01:17:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2023-11-29 01:17:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:17:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2023-11-29 01:17:23,924 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 36 [2023-11-29 01:17:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:23,924 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2023-11-29 01:17:23,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 39 states have internal predecessors, (56), 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) [2023-11-29 01:17:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2023-11-29 01:17:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 01:17:23,925 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:23,926 INFO L195 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] [2023-11-29 01:17:23,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 01:17:24,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 01:17:24,126 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:24,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:24,127 INFO L85 PathProgramCache]: Analyzing trace with hash -661809720, now seen corresponding path program 2 times [2023-11-29 01:17:24,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:24,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486278172] [2023-11-29 01:17:24,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:24,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:27,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:27,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:17:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:17:28,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:28,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486278172] [2023-11-29 01:17:28,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486278172] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:28,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179520605] [2023-11-29 01:17:28,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:17:28,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:17:28,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:17:28,092 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:17:28,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 01:17:28,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:17:28,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:17:28,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 149 conjunts are in the unsatisfiable core [2023-11-29 01:17:28,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:17:28,290 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 [2023-11-29 01:17:28,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:17:28,624 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 [2023-11-29 01:17:29,030 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:17:29,031 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 [2023-11-29 01:17:29,080 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:17:29,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 01:17:29,097 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 [2023-11-29 01:17:29,242 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 26 [2023-11-29 01:17:29,257 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 33 treesize of output 17 [2023-11-29 01:17:29,598 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-11-29 01:17:29,599 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 102 treesize of output 31 [2023-11-29 01:17:29,605 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 25 treesize of output 7 [2023-11-29 01:17:29,611 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 15 treesize of output 7 [2023-11-29 01:17:29,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:17:29,824 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-29 01:17:29,825 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 120 treesize of output 62 [2023-11-29 01:17:29,871 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-11-29 01:17:29,871 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 34 treesize of output 36 [2023-11-29 01:17:29,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2023-11-29 01:17:31,119 INFO L349 Elim1Store]: treesize reduction 196, result has 23.4 percent of original size [2023-11-29 01:17:31,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 148 treesize of output 101 [2023-11-29 01:17:31,206 INFO L349 Elim1Store]: treesize reduction 158, result has 24.8 percent of original size [2023-11-29 01:17:31,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 70 [2023-11-29 01:17:31,650 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 292 treesize of output 236 [2023-11-29 01:17:31,656 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 240 treesize of output 200 [2023-11-29 01:17:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 01:17:34,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:17:47,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179520605] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:47,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:17:47,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 50 [2023-11-29 01:17:47,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83243555] [2023-11-29 01:17:47,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:17:47,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 01:17:47,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:47,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 01:17:47,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3578, Unknown=1, NotChecked=0, Total=3782 [2023-11-29 01:17:47,306 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 50 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 41 states have internal predecessors, (60), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 01:17:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:57,808 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2023-11-29 01:17:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 01:17:57,808 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 41 states have internal predecessors, (60), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2023-11-29 01:17:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:57,809 INFO L225 Difference]: With dead ends: 86 [2023-11-29 01:17:57,809 INFO L226 Difference]: Without dead ends: 78 [2023-11-29 01:17:57,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=420, Invalid=6059, Unknown=1, NotChecked=0, Total=6480 [2023-11-29 01:17:57,812 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 70 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:57,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 408 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 01:17:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-29 01:17:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2023-11-29 01:17:57,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:17:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2023-11-29 01:17:57,834 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 38 [2023-11-29 01:17:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:57,835 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2023-11-29 01:17:57,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 41 states have internal predecessors, (60), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 01:17:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2023-11-29 01:17:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 01:17:57,836 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:57,836 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-11-29 01:17:57,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 01:17:58,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 01:17:58,037 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:58,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:58,038 INFO L85 PathProgramCache]: Analyzing trace with hash 958680662, now seen corresponding path program 2 times [2023-11-29 01:17:58,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:58,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191254906] [2023-11-29 01:17:58,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:58,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:00,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:00,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:00,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:18:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:18:01,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:01,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191254906] [2023-11-29 01:18:01,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191254906] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:18:01,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185088049] [2023-11-29 01:18:01,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:18:01,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:18:01,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:18:01,008 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:18:01,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 01:18:01,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:18:01,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:18:01,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 159 conjunts are in the unsatisfiable core [2023-11-29 01:18:01,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:18:01,307 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 [2023-11-29 01:18:01,762 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2023-11-29 01:18:01,766 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from true [2023-11-29 01:18:01,797 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 [2023-11-29 01:18:01,809 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 [2023-11-29 01:18:01,818 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= (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) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2023-11-29 01:18:01,822 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= (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) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from true [2023-11-29 01:18:01,910 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from false [2023-11-29 01:18:01,914 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from true [2023-11-29 01:18:01,925 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 13 treesize of output 5 [2023-11-29 01:18:01,932 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 [2023-11-29 01:18:01,968 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-29 01:18:01,972 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-29 01:18:02,026 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |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_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-29 01:18:02,030 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |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_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-29 01:18:02,045 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 [2023-11-29 01:18:02,090 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (not (= |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_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |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 [2023-11-29 01:18:02,094 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (not (= |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_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |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 [2023-11-29 01:18:02,176 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 01:18:02,176 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 20 treesize of output 23 [2023-11-29 01:18:02,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:18:02,203 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 22 treesize of output 17 [2023-11-29 01:18:02,250 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 0)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0))) (= |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) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1)))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from false [2023-11-29 01:18:02,256 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 0)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0))) (= |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) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1)))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0))) is different from true [2023-11-29 01:18:02,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |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) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) is different from false [2023-11-29 01:18:02,396 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |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) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) is different from true [2023-11-29 01:18:02,530 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0))) is different from false [2023-11-29 01:18:02,536 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0))) is different from true [2023-11-29 01:18:02,772 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse3) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse3 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|)))) is different from false [2023-11-29 01:18:02,777 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse3) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse3 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|)))) is different from true [2023-11-29 01:18:03,029 INFO L349 Elim1Store]: treesize reduction 67, result has 14.1 percent of original size [2023-11-29 01:18:03,029 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 257 treesize of output 171 [2023-11-29 01:18:03,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:18:03,040 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 0 case distinctions, treesize of input 161 treesize of output 115 [2023-11-29 01:18:03,075 INFO L349 Elim1Store]: treesize reduction 73, result has 45.5 percent of original size [2023-11-29 01:18:03,075 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 54 treesize of output 67 [2023-11-29 01:18:03,081 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 5 treesize of output 3 [2023-11-29 01:18:03,183 WARN L854 $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.offset| .cse1) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse4 (+ .cse0 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= .cse0 0) (= .cse1 .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_26| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0))) (not (= .cse2 0)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= .cse3 .cse2))))))) is different from false [2023-11-29 01:18:03,189 WARN L876 $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.offset| .cse1) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (.cse4 (+ .cse0 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= .cse0 0) (= .cse1 .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse7 (select |v_old(#valid)_AFTER_CALL_26| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0))) (not (= .cse2 0)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= .cse3 .cse2))))))) is different from true [2023-11-29 01:18:03,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:18:03,234 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 239 treesize of output 163 [2023-11-29 01:18:03,251 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:18:03,251 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 [2023-11-29 01:18:03,304 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (+ .cse4 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 0)) (= .cse1 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (not (= 0 .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0))) (or (= .cse4 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)))))) is different from false [2023-11-29 01:18:03,308 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (+ .cse4 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 0)) (= .cse1 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (not (= 0 .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0))) (or (= .cse4 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)))))) is different from true [2023-11-29 01:18:03,543 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_22| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~ptr~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2023-11-29 01:18:03,548 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_22| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~ptr~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2023-11-29 01:18:03,616 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4) 0) (not (= .cse2 0))))))) is different from false [2023-11-29 01:18:03,620 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4) 0) (not (= .cse2 0))))))) is different from true [2023-11-29 01:18:03,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:18:03,688 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 [2023-11-29 01:18:03,730 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse2) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2023-11-29 01:18:03,733 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse2) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2023-11-29 01:18:03,783 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0))))))) is different from false [2023-11-29 01:18:03,787 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0))))))) is different from true [2023-11-29 01:18:03,812 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-29 01:18:03,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 31 [2023-11-29 01:18:03,848 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (v_arrayElimIndex_16 Int)) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1)))) is different from false [2023-11-29 01:18:03,852 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (v_arrayElimIndex_16 Int)) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1)))) is different from true [2023-11-29 01:18:03,899 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 [2023-11-29 01:18:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2023-11-29 01:18:03,906 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:18:05,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:18:05,724 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 505 treesize of output 506 [2023-11-29 01:18:05,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:18:05,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1239 treesize of output 1242 [2023-11-29 01:18:05,782 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 496 treesize of output 259 [2023-11-29 01:18:06,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185088049] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:18:06,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:18:06,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 49 [2023-11-29 01:18:06,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938178487] [2023-11-29 01:18:06,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:18:06,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-29 01:18:06,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:06,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-29 01:18:06,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1780, Unknown=34, NotChecked=1700, Total=3660 [2023-11-29 01:18:06,587 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 49 states, 43 states have (on average 1.441860465116279) internal successors, (62), 40 states have internal predecessors, (62), 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) [2023-11-29 01:18:07,163 WARN L854 $PredicateComparison]: unable to prove that (and (= |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_sll_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2023-11-29 01:18:07,167 WARN L876 $PredicateComparison]: unable to prove that (and (= |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_sll_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from true [2023-11-29 01:18:07,173 WARN L854 $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 (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= (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) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2023-11-29 01:18:07,177 WARN L876 $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 (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= (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) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2023-11-29 01:18:07,184 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= (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_~uneq~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= 1 (select |c_#valid| .cse3)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (not (= .cse4 .cse3))))) is different from false [2023-11-29 01:18:07,188 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= (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_~uneq~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= 1 (select |c_#valid| .cse3)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (not (= .cse4 .cse3))))) is different from true [2023-11-29 01:18:07,194 WARN L854 $PredicateComparison]: unable to prove that (and (= |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)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from false [2023-11-29 01:18:07,198 WARN L876 $PredicateComparison]: unable to prove that (and (= |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)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from true [2023-11-29 01:18:07,204 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |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_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-29 01:18:07,209 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |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_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-29 01:18:07,222 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |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)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (not (= |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|))) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0)))) (= |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|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (= (select |c_old(#valid)| .cse0) 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 [2023-11-29 01:18:07,228 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |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)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (not (= |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|))) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_137) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0)))) (= |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|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))) (or (= (select |c_old(#valid)| .cse0) 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 [2023-11-29 01:18:07,243 WARN L854 $PredicateComparison]: unable to prove that (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|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse0)) (= (select .cse1 0) 0) (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 0)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0))) (= |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) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |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) (not (= .cse6 .cse0))))) is different from false [2023-11-29 01:18:07,248 WARN L876 $PredicateComparison]: unable to prove that (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|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse0)) (= (select .cse1 0) 0) (not (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 0)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0))) (= |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) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |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) (not (= .cse6 .cse0))))) is different from true [2023-11-29 01:18:07,263 WARN L854 $PredicateComparison]: unable to prove that (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|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse2 0) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |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) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |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) (not (= .cse6 .cse5))))) is different from false [2023-11-29 01:18:07,268 WARN L876 $PredicateComparison]: unable to prove that (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|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse2 0) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |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) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |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) (not (= .cse6 .cse5))))) is different from true [2023-11-29 01:18:07,284 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select .cse4 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse2 0) 0) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)))) is different from false [2023-11-29 01:18:07,289 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select .cse4 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse2 0) 0) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)))) is different from true [2023-11-29 01:18:07,304 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select .cse4 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse2 0) 0) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)))) is different from false [2023-11-29 01:18:07,310 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select .cse4 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse2 0) 0) (not (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (not (= .cse3 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)))) is different from true [2023-11-29 01:18:07,325 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse8 0))) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse3 0) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse4) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse5)) (or (= .cse4 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from false [2023-11-29 01:18:07,330 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse8 0))) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= (select .cse3 0) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse4) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse5)) (or (= .cse4 0) (= .cse0 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from true [2023-11-29 01:18:07,346 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse11 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse6 (+ .cse2 4)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse10) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) 0)) (= (select .cse1 0) 0) (or (= .cse2 0) (= .cse3 .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6) 0) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse8 (select |v_#valid_BEFORE_CALL_23| .cse8))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse7) 1)))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse9 (select |v_old(#valid)_AFTER_CALL_26| .cse9)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 0))) (not (= .cse4 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse10) 4) 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse4) 0)) (= .cse5 .cse4)))))))) is different from false [2023-11-29 01:18:07,351 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse11 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse6 (+ .cse2 4)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse10) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) 0)) (= (select .cse1 0) 0) (or (= .cse2 0) (= .cse3 .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6) 0) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_137) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse8 (select |v_#valid_BEFORE_CALL_23| .cse8))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_23| .cse7) 1)))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse9 (select |v_old(#valid)_AFTER_CALL_26| .cse9)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 1) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 0))) (not (= .cse4 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse10) 4) 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse4) 0)) (= .cse5 .cse4)))))))) is different from true [2023-11-29 01:18:07,358 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (+ .cse7 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse3 (= .cse7 0)) (.cse0 (select .cse2 .cse5))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 0)) (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select .cse2 4)) 0)) .cse3 (= 0 (select .cse4 4)) (= (select .cse4 .cse5) 0) (not (= 0 .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse6 (select |v_old(#valid)_AFTER_CALL_26| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0))) (or .cse3 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)))))) is different from false [2023-11-29 01:18:07,362 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (+ .cse7 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse3 (= .cse7 0)) (.cse0 (select .cse2 .cse5))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 0)) (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select .cse2 4)) 0)) .cse3 (= 0 (select .cse4 4)) (= (select .cse4 .cse5) 0) (not (= 0 .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse6 (select |v_old(#valid)_AFTER_CALL_26| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0))) (or .cse3 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)))))) is different from true [2023-11-29 01:18:07,370 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (+ .cse7 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse3 (= .cse7 0)) (.cse0 (select .cse2 .cse5))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 0)) (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select .cse2 4)) 0)) .cse3 (= 0 (select .cse4 4)) (= (select .cse4 .cse5) 0) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (not (= 0 .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse6 (select |v_old(#valid)_AFTER_CALL_26| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0))) (or .cse3 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)))))) is different from false [2023-11-29 01:18:07,374 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (+ .cse7 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse3 (= .cse7 0)) (.cse0 (select .cse2 .cse5))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 0)) (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select .cse2 4)) 0)) .cse3 (= 0 (select .cse4 4)) (= (select .cse4 .cse5) 0) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (not (= 0 .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse6 (select |v_old(#valid)_AFTER_CALL_26| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0))) (or .cse3 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)))))) is different from true [2023-11-29 01:18:07,380 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4)) 0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_22| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~ptr~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2023-11-29 01:18:07,384 WARN L876 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4)) 0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_22| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~ptr~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2023-11-29 01:18:07,389 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4) 0) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) 0))) is different from false [2023-11-29 01:18:07,394 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4) 0) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) 0))) is different from true [2023-11-29 01:18:07,405 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4) 0) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)))) is different from false [2023-11-29 01:18:07,409 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4) 0) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)))) is different from true [2023-11-29 01:18:07,416 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse2) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|) |c_ULTIMATE.start_main_~temp~2#1.offset|)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2023-11-29 01:18:07,420 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse2) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0)))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|) |c_ULTIMATE.start_main_~temp~2#1.offset|)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2023-11-29 01:18:07,425 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0))))))) is different from false [2023-11-29 01:18:07,430 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (not (= .cse2 0))))))) is different from true [2023-11-29 01:18:07,437 WARN L854 $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_~uneq~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 0)) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (v_arrayElimIndex_16 Int)) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1))))) is different from false [2023-11-29 01:18:07,441 WARN L876 $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_~uneq~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 0)) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (v_arrayElimIndex_16 Int)) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_16) 1) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1))))) is different from true [2023-11-29 01:18:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:07,743 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2023-11-29 01:18:07,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-29 01:18:07,744 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 43 states have (on average 1.441860465116279) internal successors, (62), 40 states have internal predecessors, (62), 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 39 [2023-11-29 01:18:07,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:07,745 INFO L225 Difference]: With dead ends: 77 [2023-11-29 01:18:07,745 INFO L226 Difference]: Without dead ends: 75 [2023-11-29 01:18:07,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 37 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=198, Invalid=1946, Unknown=74, NotChecked=4588, Total=6806 [2023-11-29 01:18:07,749 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1745 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:07,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 358 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 327 Invalid, 0 Unknown, 1745 Unchecked, 0.6s Time] [2023-11-29 01:18:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-29 01:18:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-29 01:18:07,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.121212121212121) internal successors, (74), 66 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:18:07,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-11-29 01:18:07,774 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 39 [2023-11-29 01:18:07,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:07,775 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-11-29 01:18:07,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 43 states have (on average 1.441860465116279) internal successors, (62), 40 states have internal predecessors, (62), 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) [2023-11-29 01:18:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-11-29 01:18:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 01:18:07,776 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:07,776 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:07,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 01:18:07,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:18:07,980 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:07,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:07,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1008327703, now seen corresponding path program 3 times [2023-11-29 01:18:07,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:18:07,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961472074] [2023-11-29 01:18:07,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:07,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:18:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:08,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:08,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:08,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:18:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:08,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 01:18:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 01:18:08,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961472074] [2023-11-29 01:18:08,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961472074] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:18:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990307157] [2023-11-29 01:18:08,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:18:08,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:18:08,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:18:08,113 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:18:08,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 01:18:08,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 01:18:08,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:18:08,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:18:08,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:18:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 01:18:08,550 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:18:08,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990307157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:08,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:18:08,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-11-29 01:18:08,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631513020] [2023-11-29 01:18:08,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:08,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:18:08,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:08,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:18:08,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:18:08,552 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2023-11-29 01:18:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:08,599 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2023-11-29 01:18:08,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:18:08,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 40 [2023-11-29 01:18:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:08,600 INFO L225 Difference]: With dead ends: 83 [2023-11-29 01:18:08,600 INFO L226 Difference]: Without dead ends: 38 [2023-11-29 01:18:08,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:18:08,601 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:08,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:18:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-29 01:18:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-29 01:18:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.0) internal successors, (32), 32 states have internal predecessors, (32), 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) [2023-11-29 01:18:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2023-11-29 01:18:08,610 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 40 [2023-11-29 01:18:08,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:08,610 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2023-11-29 01:18:08,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2023-11-29 01:18:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2023-11-29 01:18:08,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 01:18:08,611 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:08,611 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-11-29 01:18:08,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 01:18:08,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:18:08,812 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:08,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:08,812 INFO L85 PathProgramCache]: Analyzing trace with hash -345669062, now seen corresponding path program 1 times [2023-11-29 01:18:08,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:18:08,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186987291] [2023-11-29 01:18:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:08,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:18:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:08,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:08,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:08,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:18:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 01:18:08,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:08,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186987291] [2023-11-29 01:18:08,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186987291] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:18:08,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583716789] [2023-11-29 01:18:08,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:08,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:18:08,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:18:08,992 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:18:08,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 01:18:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 01:18:09,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:18:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 01:18:09,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:18:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 01:18:09,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583716789] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:18:09,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:18:09,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-11-29 01:18:09,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036010482] [2023-11-29 01:18:09,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:18:09,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:18:09,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:09,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:18:09,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:18:09,415 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:18:09,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:09,556 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2023-11-29 01:18:09,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:18:09,556 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2023-11-29 01:18:09,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:09,557 INFO L225 Difference]: With dead ends: 38 [2023-11-29 01:18:09,557 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 01:18:09,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:18:09,558 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:09,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:18:09,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 01:18:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 01:18:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:18:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 01:18:09,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2023-11-29 01:18:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:09,559 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 01:18:09,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:18:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 01:18:09,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 01:18:09,561 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:18:09,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 01:18:09,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:18:09,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 01:18:14,985 INFO L899 garLoopResultBuilder]: For program point L605-1(lines 605 607) no Hoare annotation was computed. [2023-11-29 01:18:14,986 INFO L895 garLoopResultBuilder]: At program point L605-3(lines 605 607) the Hoare annotation is: (let ((.cse11 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse21 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_append_~head#1.base|) 0)) (.cse3 (select (select |#memory_$Pointer$#1.base| .cse11) 4))) (let ((.cse0 (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (not (= .cse11 0))) (.cse2 (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse22 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse22 (select |v_old(#valid)_AFTER_CALL_26| .cse22)))) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse11) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse11) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 1)))) (.cse17 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse4 (= |ULTIMATE.start_sll_append_~last~0#1.offset| 0)) (.cse5 (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0))) (.cse6 (= (select (select |#memory_int#1| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) |ULTIMATE.start_main_~uneq~0#1|)) (.cse7 (= |ULTIMATE.start_sll_append_~head#1.offset| 0)) (.cse8 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse9 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_append_~head#1.base|) 0) 0)) (.cse10 (= (select |#valid| .cse3) 1)) (.cse12 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse13 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse14 (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse15 (= (select (select |#memory_int#1| .cse11) 0) 1)) (.cse16 (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) (.cse18 (= (select |#valid| .cse21) 1)) (.cse19 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse20 (not (= .cse3 0)))) (or (and .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$#1.offset| .cse3) 4) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= .cse11 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse12 .cse13 .cse14 .cse15 .cse16 (= (select (select |#memory_$Pointer$#1.base| .cse17) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse11) 4) 0) .cse18 .cse19 .cse20 (= (select (select |#memory_int#1| .cse17) 0) 1)) (and .cse0 .cse1 .cse2 (= (select (select |#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base|) 0) 1) (= .cse17 0) (= (select (select |#memory_$Pointer$#1.offset| (select (select |#memory_$Pointer$#1.base| .cse21) 4)) 4) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 (= |ULTIMATE.start_sll_append_~last~0#1.base| .cse3) .cse18 .cse19 (= (select (select |#memory_$Pointer$#1.offset| .cse21) 4) 0) .cse20))))) [2023-11-29 01:18:14,986 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 609) no Hoare annotation was computed. [2023-11-29 01:18:14,986 INFO L899 garLoopResultBuilder]: For program point L605-4(lines 605 607) no Hoare annotation was computed. [2023-11-29 01:18:14,986 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-11-29 01:18:14,986 INFO L899 garLoopResultBuilder]: For program point L622(lines 622 624) no Hoare annotation was computed. [2023-11-29 01:18:14,986 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 611 640) no Hoare annotation was computed. [2023-11-29 01:18:14,987 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))) (let ((.cse7 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse8 (not .cse1)) (.cse0 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse10 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse11 (= (select (select |#memory_int#1| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1)) (.cse12 (= .cse6 0)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_sll_create_~data#1| 1))) (or (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= (select (select |#memory_$Pointer$#1.base| .cse6) 4) 0) .cse7 .cse8 (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse6) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_22| |#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse9 (select |#valid| .cse9))) |#valid|) (= (select |v_#valid_BEFORE_CALL_22| |ULTIMATE.start_sll_create_~head~0#1.base|) 0))) .cse0 (<= |ULTIMATE.start_sll_create_~len#1| 0) .cse10 (= (select (select |#memory_int#1| .cse6) 0) 1) .cse11 .cse2 .cse3 .cse4 .cse5 (not .cse12) (= (select (select |#memory_$Pointer$#1.offset| .cse6) 4) 0)) (and .cse7 .cse8 .cse0 .cse10 (= |ULTIMATE.start_sll_create_~len#1| 1) .cse11 .cse12 .cse2 .cse3 .cse4 .cse5)))) [2023-11-29 01:18:14,987 INFO L899 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2023-11-29 01:18:14,987 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 638) no Hoare annotation was computed. [2023-11-29 01:18:14,987 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 632) no Hoare annotation was computed. [2023-11-29 01:18:14,987 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (.cse0 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_sll_create_~data#1| 1))) (or (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not .cse1) .cse0 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |ULTIMATE.start_sll_create_~len#1| 1) (= (select (select |#memory_int#1| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) .cse2 .cse3 .cse4 .cse5))) [2023-11-29 01:18:14,987 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-11-29 01:18:14,987 INFO L899 garLoopResultBuilder]: For program point L619-2(lines 611 640) no Hoare annotation was computed. [2023-11-29 01:18:14,987 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 01:18:14,988 INFO L899 garLoopResultBuilder]: For program point L599(lines 599 610) no Hoare annotation was computed. [2023-11-29 01:18:14,988 INFO L899 garLoopResultBuilder]: For program point L628(lines 628 630) no Hoare annotation was computed. [2023-11-29 01:18:14,988 INFO L899 garLoopResultBuilder]: For program point L620-1(lines 620 627) no Hoare annotation was computed. [2023-11-29 01:18:14,988 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 01:18:14,989 INFO L895 garLoopResultBuilder]: At program point L620-3(lines 620 627) the Hoare annotation is: (let ((.cse17 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse35 (select .cse17 0))) (let ((.cse37 (select (select |#memory_$Pointer$#1.base| .cse35) 4))) (let ((.cse13 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse38 (select (select |#memory_$Pointer$#1.base| .cse37) 4))) (let ((.cse30 (select (select |#memory_int#1| |ULTIMATE.start_main_~ptr~0#1.base|) 0)) (.cse22 (= (select (select |#memory_$Pointer$#1.offset| .cse37) 4) 0)) (.cse23 (not (= .cse38 0))) (.cse8 (= |ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse27 (= (select .cse13 0) 0)) (.cse21 (select (select |#memory_int#1| .cse37) 0)) (.cse14 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse15 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse16 (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_1| Int)) (not (= (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_1|) 0) 0)))) (.cse28 (= (select (select |#memory_$Pointer$#1.offset| .cse38) 4) 0)) (.cse29 (= (select (select |#memory_$Pointer$#1.offset| .cse35) 4) 0)) (.cse31 (= 0 (select (select |#memory_$Pointer$#1.base| .cse38) 4))) (.cse32 (not (= .cse37 0)))) (or (let ((.cse9 (select .cse17 |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |#memory_$Pointer$#1.base| .cse9) 4))) (and (let ((.cse0 (select (select |#memory_$Pointer$#1.base| .cse1) 4))) (or (and (= (select (select |#memory_$Pointer$#1.base| .cse0) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse0) 4) 0)) (= .cse0 0))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse4 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse3 (select (select |#memory_$Pointer$#1.base| .cse4) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_old(#valid)_AFTER_CALL_26| .cse2)))) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse3) (not (= .cse3 0)) (= (select |v_#valid_BEFORE_CALL_22| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int#1| .cse3) 0)))))) (exists ((v_subst_19 Int) (v_subst_21 Int)) (let ((.cse7 (+ v_subst_21 4))) (let ((.cse5 (select (select |#memory_$Pointer$#1.base| v_subst_19) .cse7))) (let ((.cse6 (select (select |#memory_$Pointer$#1.base| .cse5) 4))) (and (not (= .cse5 v_subst_19)) (= (select (select |#memory_$Pointer$#1.base| .cse6) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| v_subst_19) .cse7) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse6) 4) 0) (not (= .cse6 v_subst_19)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse6) (= (select (select |#memory_$Pointer$#1.offset| .cse5) 4) 0) (not (= .cse6 0)) (not (= .cse5 0))))))) .cse8 (= (select (select |#memory_$Pointer$#1.offset| .cse9) 4) 0) (or (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_42| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_38| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_38| 4))) (let ((.cse11 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_42|) .cse10))) (and (= 0 (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_42|) .cse10)) (= (select (select |#memory_$Pointer$#1.offset| .cse11) 4) 0) (not (= .cse1 .cse11)) (= (select (select |#memory_$Pointer$#1.base| .cse11) 4) 0))))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_42| Int)) (let ((.cse12 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_42|) 4))) (and (= |v_ULTIMATE.start_sll_append_~last~0#1.base_42| .cse12) (= (select (select |#memory_$Pointer$#1.offset| .cse12) 4) 0))))) (= (select .cse13 |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 4) 0) .cse14 .cse15 .cse16 (= 2 |ULTIMATE.start_main_~count~0#1|) (not (= .cse1 0))))) (and (= |ULTIMATE.start_main_~count~0#1| 1) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_25| Int) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (let ((.cse19 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4))) (let ((.cse20 (select (select |#memory_$Pointer$#1.base| .cse19) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse18 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse18 (select |v_old(#valid)_AFTER_CALL_26| .cse18)))) (= (select (select |#memory_$Pointer$#1.offset| .cse19) 4) 0) (not (= .cse20 0)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse19) (= (select |v_#valid_BEFORE_CALL_22| .cse19) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse20) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 1) (= (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_25|) 4) 0) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int#1| .cse20) 0)))))) (= .cse21 |ULTIMATE.start_main_~data~0#1|) .cse22 .cse23 (exists ((v_subst_19 Int) (v_subst_21 Int)) (let ((.cse26 (+ v_subst_21 4))) (let ((.cse24 (select (select |#memory_$Pointer$#1.base| v_subst_19) .cse26))) (let ((.cse25 (select (select |#memory_$Pointer$#1.base| .cse24) 4))) (and (not (= .cse24 v_subst_19)) (= (select (select |#memory_$Pointer$#1.base| .cse25) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| v_subst_19) .cse26) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse25) 4) 0) (not (= .cse25 v_subst_19)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse24) (= (select (select |#memory_$Pointer$#1.offset| .cse24) 4) 0) (not (= .cse24 0))))))) .cse8 .cse27 .cse14 .cse15 .cse16 .cse28 .cse29 (= |ULTIMATE.start_main_~data~0#1| .cse30) .cse31 .cse32) (let ((.cse34 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse33 (select (select |#memory_$Pointer$#1.base| .cse34) 4))) (and (= (select (select |#memory_$Pointer$#1.base| .cse33) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse33) 4) 0) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int#1| .cse33) 0)) (= .cse30 1) .cse22 (= (select (select |#memory_int#1| .cse34) 0) 1) .cse23 .cse8 .cse27 (= |ULTIMATE.start_main_~count~0#1| 0) (= .cse21 1) (not (= .cse34 0)) (not (= .cse33 0)) (= |ULTIMATE.start_main_~data~0#1| 1) .cse14 .cse15 .cse16 .cse28 (= (select (select |#memory_int#1| .cse35) 0) 1) .cse29 .cse31 (= (select (select |#memory_$Pointer$#1.offset| .cse34) 4) 0) .cse32 (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse36 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse36 (select |v_old(#valid)_AFTER_CALL_26| .cse36)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse33) 0) (= (select |v_#valid_BEFORE_CALL_22| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse34) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~ptr~0#1.base|) 1)))))))))))) [2023-11-29 01:18:14,989 INFO L899 garLoopResultBuilder]: For program point L620-4(lines 620 627) no Hoare annotation was computed. [2023-11-29 01:18:14,989 INFO L895 garLoopResultBuilder]: At program point L600(line 600) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse4 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_append_~head#1.base|) 0))) (let ((.cse1 (select (select |#memory_$Pointer$#1.base| .cse4) 4)) (.cse2 (select (select |#memory_$Pointer$#1.base| .cse0) 4))) (and (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select (select |#memory_int#1| .cse2) 0) 1) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_sll_append_~data#1|) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |#valid| .cse3))) |#valid|) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1))) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_int#1| .cse0) 0) 1) (= (select |#valid| .cse4) 1) (= (select (select |#memory_$Pointer$#1.base| .cse1) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse4) 4) 0) (not (= .cse2 0))))) [2023-11-29 01:18:14,989 INFO L899 garLoopResultBuilder]: For program point L600-1(line 600) no Hoare annotation was computed. [2023-11-29 01:18:14,990 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 611 640) no Hoare annotation was computed. [2023-11-29 01:18:14,990 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2023-11-29 01:18:14,990 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-11-29 01:18:14,990 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-11-29 01:18:14,990 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) [2023-11-29 01:18:14,990 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-11-29 01:18:14,993 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-29 01:18:14,995 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:18:15,002 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:347) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:480) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:165) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:98) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:47) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-11-29 01:18:15,004 INFO L158 Benchmark]: Toolchain (without parser) took 148906.85ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 132.2MB in the beginning and 102.1MB in the end (delta: 30.1MB). Peak memory consumption was 153.4MB. Max. memory is 16.1GB. [2023-11-29 01:18:15,004 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:18:15,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.95ms. Allocated memory is still 172.0MB. Free memory was 131.6MB in the beginning and 113.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 01:18:15,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.52ms. Allocated memory is still 172.0MB. Free memory was 113.9MB in the beginning and 111.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:18:15,005 INFO L158 Benchmark]: Boogie Preprocessor took 59.18ms. Allocated memory is still 172.0MB. Free memory was 111.2MB in the beginning and 108.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:18:15,005 INFO L158 Benchmark]: RCFGBuilder took 428.47ms. Allocated memory is still 172.0MB. Free memory was 108.5MB in the beginning and 88.8MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 01:18:15,006 INFO L158 Benchmark]: TraceAbstraction took 147938.62ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 88.2MB in the beginning and 102.1MB in the end (delta: -14.0MB). Peak memory consumption was 109.4MB. Max. memory is 16.1GB. [2023-11-29 01:18:15,007 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.19ms. Allocated memory is still 102.8MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.95ms. Allocated memory is still 172.0MB. Free memory was 131.6MB in the beginning and 113.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.52ms. Allocated memory is still 172.0MB. Free memory was 113.9MB in the beginning and 111.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.18ms. Allocated memory is still 172.0MB. Free memory was 111.2MB in the beginning and 108.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 428.47ms. Allocated memory is still 172.0MB. Free memory was 108.5MB in the beginning and 88.8MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 147938.62ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 88.2MB in the beginning and 102.1MB in the end (delta: -14.0MB). Peak memory consumption was 109.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 638]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 147.9s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 54.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 30.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 487 mSDsluCounter, 3120 SdHoareTripleChecker+Invalid, 30.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1947 IncrementalHoareTripleChecker+Unchecked, 2837 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5111 IncrementalHoareTripleChecker+Invalid, 7124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 283 mSDtfsCounter, 5111 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 936 GetRequests, 404 SyntacticMatches, 5 SemanticMatches, 527 ConstructedPredicates, 46 IntricatePredicates, 0 DeprecatedPredicates, 6018 ImplicationChecksByTransitivity, 82.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=12, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 87 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 14 PreInvPairs, 26 NumberOfFragments, 1892 HoareAnnotationTreeSize, 14 FomulaSimplifications, 1989 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2912 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 82.6s InterpolantComputationTime, 791 NumberOfCodeBlocks, 791 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 847 ConstructedInterpolants, 81 QuantifiedInterpolants, 19856 SizeOfPredicates, 220 NumberOfNonLiveVariables, 3897 ConjunctsInSsa, 932 ConjunctsInUnsatCore, 28 InterpolantComputations, 4 PerfectInterpolantSequences, 277/481 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-29 01:18:15,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya --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 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:18:16,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:18:16,968 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 01:18:16,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:18:16,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:18:17,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:18:17,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:18:17,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:18:17,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:18:17,019 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:18:17,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:18:17,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:18:17,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:18:17,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:18:17,022 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:18:17,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:18:17,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:18:17,024 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:18:17,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:18:17,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:18:17,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:18:17,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:18:17,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:18:17,027 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:18:17,028 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:18:17,028 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:18:17,029 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:18:17,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:18:17,029 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:18:17,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:18:17,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:18:17,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:18:17,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:18:17,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:18:17,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:18:17,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:18:17,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:18:17,032 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:18:17,033 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:18:17,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:18:17,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:18:17,033 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:18:17,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:18:17,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:18:17,034 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:18:17,034 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_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/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_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2023-11-29 01:18:17,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:18:17,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:18:17,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:18:17,332 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:18:17,332 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:18:17,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2023-11-29 01:18:20,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:18:20,397 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:18:20,398 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2023-11-29 01:18:20,414 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/data/bbd9160b3/ad9cf433fa3e4382acbab5b111a1ff3d/FLAGf4f139244 [2023-11-29 01:18:20,430 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/data/bbd9160b3/ad9cf433fa3e4382acbab5b111a1ff3d [2023-11-29 01:18:20,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:18:20,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:18:20,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:18:20,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:18:20,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:18:20,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:18:20" (1/1) ... [2023-11-29 01:18:20,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d44c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20, skipping insertion in model container [2023-11-29 01:18:20,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:18:20" (1/1) ... [2023-11-29 01:18:20,483 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:18:20,743 WARN L240 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_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2023-11-29 01:18:20,747 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:18:20,760 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:18:20,801 WARN L240 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_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2023-11-29 01:18:20,802 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:18:20,832 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:18:20,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20 WrapperNode [2023-11-29 01:18:20,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:18:20,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:18:20,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:18:20,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:18:20,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20" (1/1) ... [2023-11-29 01:18:20,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20" (1/1) ... [2023-11-29 01:18:20,884 INFO L138 Inliner]: procedures = 130, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2023-11-29 01:18:20,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:18:20,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:18:20,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:18:20,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:18:20,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20" (1/1) ... [2023-11-29 01:18:20,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20" (1/1) ... [2023-11-29 01:18:20,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20" (1/1) ... [2023-11-29 01:18:20,919 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 6, 12]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2023-11-29 01:18:20,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20" (1/1) ... [2023-11-29 01:18:20,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20" (1/1) ... [2023-11-29 01:18:20,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20" (1/1) ... [2023-11-29 01:18:20,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20" (1/1) ... [2023-11-29 01:18:20,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20" (1/1) ... [2023-11-29 01:18:20,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20" (1/1) ... [2023-11-29 01:18:20,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:18:20,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:18:20,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:18:20,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:18:20,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20" (1/1) ... [2023-11-29 01:18:20,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:18:20,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:18:20,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:18:20,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:18:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 01:18:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 01:18:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 01:18:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 01:18:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 01:18:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:18:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:18:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:18:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:18:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:18:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 01:18:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:18:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:18:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 01:18:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:18:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 01:18:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 01:18:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 01:18:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 01:18:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 01:18:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 01:18:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:18:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 01:18:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 01:18:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:18:21,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:18:21,165 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:18:21,167 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:18:21,413 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:18:21,451 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:18:21,451 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 01:18:21,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:18:21 BoogieIcfgContainer [2023-11-29 01:18:21,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:18:21,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:18:21,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:18:21,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:18:21,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:18:20" (1/3) ... [2023-11-29 01:18:21,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8cfeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:18:21, skipping insertion in model container [2023-11-29 01:18:21,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:18:20" (2/3) ... [2023-11-29 01:18:21,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8cfeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:18:21, skipping insertion in model container [2023-11-29 01:18:21,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:18:21" (3/3) ... [2023-11-29 01:18:21,461 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2023-11-29 01:18:21,480 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:18:21,480 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:18:21,529 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:18:21,536 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@6900f3d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:18:21,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:18:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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) [2023-11-29 01:18:21,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:18:21,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:21,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:21,549 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:21,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:21,555 INFO L85 PathProgramCache]: Analyzing trace with hash -427772013, now seen corresponding path program 1 times [2023-11-29 01:18:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:18:21,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773170986] [2023-11-29 01:18:21,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:21,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:18:21,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:18:21,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:18:21,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 01:18:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:21,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 01:18:21,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:18:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:18:21,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:18:21,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:18:21,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773170986] [2023-11-29 01:18:21,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773170986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:21,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:18:21,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:18:21,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857481475] [2023-11-29 01:18:21,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:21,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:18:21,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:18:21,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:18:21,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:18:21,774 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2023-11-29 01:18:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:21,825 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2023-11-29 01:18:21,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:18:21,828 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2023-11-29 01:18:21,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:21,835 INFO L225 Difference]: With dead ends: 54 [2023-11-29 01:18:21,836 INFO L226 Difference]: Without dead ends: 24 [2023-11-29 01:18:21,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:18:21,842 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:21,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:18:21,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-29 01:18:21,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-29 01:18:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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) [2023-11-29 01:18:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-29 01:18:21,878 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2023-11-29 01:18:21,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:21,879 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-29 01:18:21,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2023-11-29 01:18:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-29 01:18:21,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:18:21,881 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:21,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:21,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:18:22,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:18:22,082 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:22,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:22,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1460433765, now seen corresponding path program 1 times [2023-11-29 01:18:22,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:18:22,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615099935] [2023-11-29 01:18:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:22,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:18:22,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:18:22,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:18:22,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 01:18:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:22,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:18:22,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:18:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:18:22,296 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:18:22,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:18:22,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615099935] [2023-11-29 01:18:22,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615099935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:22,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:18:22,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:18:22,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721248582] [2023-11-29 01:18:22,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:22,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:18:22,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:18:22,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:18:22,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:18:22,318 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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) [2023-11-29 01:18:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:22,378 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2023-11-29 01:18:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:18:22,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2023-11-29 01:18:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:22,380 INFO L225 Difference]: With dead ends: 47 [2023-11-29 01:18:22,380 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 01:18:22,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:18:22,382 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:22,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:18:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 01:18:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-11-29 01:18:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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) [2023-11-29 01:18:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-11-29 01:18:22,390 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 13 [2023-11-29 01:18:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:22,390 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-29 01:18:22,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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) [2023-11-29 01:18:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-11-29 01:18:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 01:18:22,392 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:22,392 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:22,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 01:18:22,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:18:22,595 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:22,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:22,596 INFO L85 PathProgramCache]: Analyzing trace with hash 778109461, now seen corresponding path program 1 times [2023-11-29 01:18:22,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:18:22,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144439311] [2023-11-29 01:18:22,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:22,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:18:22,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:18:22,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:18:22,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 01:18:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:22,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:18:22,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:18:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:18:22,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:18:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:18:22,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:18:22,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144439311] [2023-11-29 01:18:22,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144439311] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:18:22,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:18:22,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-11-29 01:18:22,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906142003] [2023-11-29 01:18:22,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:18:22,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:18:22,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:18:22,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:18:22,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:18:22,807 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2023-11-29 01:18:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:22,919 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2023-11-29 01:18:22,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:18:22,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2023-11-29 01:18:22,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:22,921 INFO L225 Difference]: With dead ends: 50 [2023-11-29 01:18:22,921 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 01:18:22,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:18:22,922 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:22,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:18:22,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 01:18:22,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-11-29 01:18:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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) [2023-11-29 01:18:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-11-29 01:18:22,929 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 19 [2023-11-29 01:18:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:22,930 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-11-29 01:18:22,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2023-11-29 01:18:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2023-11-29 01:18:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 01:18:22,931 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:22,932 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:22,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-29 01:18:23,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:18:23,133 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:23,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:23,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1663372273, now seen corresponding path program 2 times [2023-11-29 01:18:23,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:18:23,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023636637] [2023-11-29 01:18:23,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:18:23,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:18:23,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:18:23,135 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:18:23,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 01:18:23,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:18:23,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:18:23,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 01:18:23,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:18:23,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 [2023-11-29 01:18:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:18:23,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:18:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 01:18:23,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:18:23,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023636637] [2023-11-29 01:18:23,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023636637] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:18:23,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:18:23,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2023-11-29 01:18:23,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149799537] [2023-11-29 01:18:23,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:18:23,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:18:23,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:18:23,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:18:23,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:18:23,584 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 01:18:27,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:18:31,656 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] [2023-11-29 01:18:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:31,972 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2023-11-29 01:18:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:18:31,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-11-29 01:18:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:31,974 INFO L225 Difference]: With dead ends: 41 [2023-11-29 01:18:31,974 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 01:18:31,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:18:31,976 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:31,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 178 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2023-11-29 01:18:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 01:18:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-29 01:18:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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) [2023-11-29 01:18:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-29 01:18:31,984 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 25 [2023-11-29 01:18:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:31,984 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-29 01:18:31,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 01:18:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-11-29 01:18:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 01:18:31,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:31,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:31,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 01:18:32,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:18:32,188 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:32,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:32,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1265695951, now seen corresponding path program 1 times [2023-11-29 01:18:32,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:18:32,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072070065] [2023-11-29 01:18:32,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:32,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:18:32,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:18:32,191 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:18:32,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 01:18:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:32,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 01:18:32,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:18:32,868 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 27 treesize of output 1 [2023-11-29 01:18:32,936 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 16 [2023-11-29 01:18:32,940 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 [2023-11-29 01:18:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 01:18:32,969 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:18:33,033 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 56 treesize of output 42 [2023-11-29 01:18:33,166 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 01:18:33,167 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 [2023-11-29 01:18:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 01:18:33,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:18:33,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072070065] [2023-11-29 01:18:33,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072070065] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 01:18:33,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:18:33,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 22 [2023-11-29 01:18:33,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622282129] [2023-11-29 01:18:33,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:33,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:18:33,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:18:33,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:18:33,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2023-11-29 01:18:33,472 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 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) [2023-11-29 01:18:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:33,978 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2023-11-29 01:18:33,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:18:33,978 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 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 28 [2023-11-29 01:18:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:33,980 INFO L225 Difference]: With dead ends: 47 [2023-11-29 01:18:33,980 INFO L226 Difference]: Without dead ends: 44 [2023-11-29 01:18:33,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2023-11-29 01:18:33,982 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:33,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 153 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:18:33,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-29 01:18:33,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2023-11-29 01:18:33,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 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) [2023-11-29 01:18:33,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2023-11-29 01:18:33,991 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 28 [2023-11-29 01:18:33,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:33,991 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-11-29 01:18:33,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 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) [2023-11-29 01:18:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2023-11-29 01:18:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 01:18:33,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:33,993 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:33,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 01:18:34,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:18:34,196 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:34,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:34,197 INFO L85 PathProgramCache]: Analyzing trace with hash -882854099, now seen corresponding path program 1 times [2023-11-29 01:18:34,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:18:34,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534712572] [2023-11-29 01:18:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:34,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:18:34,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:18:34,199 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:18:34,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 01:18:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:34,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 01:18:34,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:18:34,440 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 [2023-11-29 01:18:34,540 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 [2023-11-29 01:18:34,681 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 [2023-11-29 01:18:34,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 12 treesize of output 4 [2023-11-29 01:18:34,813 WARN L876 $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))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_5|) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 01:18:34,845 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 01:18:34,845 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 [2023-11-29 01:18:34,853 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 [2023-11-29 01:18:34,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 20 treesize of output 12 [2023-11-29 01:18:34,998 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 [2023-11-29 01:18:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-29 01:18:35,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:18:35,214 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_37| (_ BitVec 32)) (v_ArrVal_255 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_37| v_ArrVal_255) (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (_ bv0 32))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_37|) (_ bv0 1))))) is different from false [2023-11-29 01:18:35,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:18:35,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534712572] [2023-11-29 01:18:35,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534712572] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:18:35,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1138083594] [2023-11-29 01:18:35,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:35,218 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:18:35,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:18:35,222 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:18:35,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-11-29 01:18:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:35,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 01:18:35,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:18:35,634 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 [2023-11-29 01:18:35,702 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 [2023-11-29 01:18:35,865 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 [2023-11-29 01:18:36,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 11 treesize of output 3 [2023-11-29 01:18:36,120 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 [2023-11-29 01:18:36,318 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) (_ bv0 32)) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 01:18:36,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:18:36,347 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 [2023-11-29 01:18:36,367 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 01:18:36,368 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 [2023-11-29 01:18:36,752 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 39 treesize of output 15 [2023-11-29 01:18:36,888 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 [2023-11-29 01:18:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-11-29 01:18:37,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:18:37,770 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_319 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_40| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_40|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_40| v_ArrVal_323)) (.cse1 (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) v_ArrVal_319))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-11-29 01:18:37,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1138083594] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:18:37,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:18:37,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2023-11-29 01:18:37,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691570241] [2023-11-29 01:18:37,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:18:37,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 01:18:37,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:18:37,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 01:18:37,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1173, Unknown=4, NotChecked=284, Total=1560 [2023-11-29 01:18:37,776 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 31 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 26 states have internal predecessors, (46), 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) [2023-11-29 01:18:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:40,230 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2023-11-29 01:18:40,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 01:18:40,231 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 26 states have internal predecessors, (46), 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 30 [2023-11-29 01:18:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:40,233 INFO L225 Difference]: With dead ends: 45 [2023-11-29 01:18:40,233 INFO L226 Difference]: Without dead ends: 34 [2023-11-29 01:18:40,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=207, Invalid=2157, Unknown=4, NotChecked=388, Total=2756 [2023-11-29 01:18:40,235 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:40,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 406 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 441 Invalid, 0 Unknown, 80 Unchecked, 1.4s Time] [2023-11-29 01:18:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-29 01:18:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-11-29 01:18:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2023-11-29 01:18:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-29 01:18:40,243 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 30 [2023-11-29 01:18:40,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:40,244 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-29 01:18:40,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 26 states have internal predecessors, (46), 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) [2023-11-29 01:18:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-11-29 01:18:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 01:18:40,245 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:40,245 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:40,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-11-29 01:18:40,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 01:18:40,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:18:40,646 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:40,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:40,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1323672500, now seen corresponding path program 1 times [2023-11-29 01:18:40,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:18:40,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860726494] [2023-11-29 01:18:40,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:40,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:18:40,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:18:40,648 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:18:40,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 01:18:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:40,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 01:18:40,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:18:40,840 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 [2023-11-29 01:18:40,984 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:18:40,985 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 [2023-11-29 01:18:41,050 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 [2023-11-29 01:18:41,229 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 [2023-11-29 01:18:41,235 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 [2023-11-29 01:18:41,343 WARN L876 $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$#1.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 ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 01:18:41,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:18:41,371 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 [2023-11-29 01:18:41,408 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 01:18:41,408 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 [2023-11-29 01:18:41,791 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 01:18:41,792 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 [2023-11-29 01:18:41,881 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 40 treesize of output 24 [2023-11-29 01:18:41,884 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 [2023-11-29 01:18:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:18:41,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:18:42,109 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_385 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)) v_ArrVal_385) (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2023-11-29 01:18:42,310 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_43| (_ BitVec 32)) (v_ArrVal_385 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_43| v_ArrVal_388))) (store .cse0 (select (select .cse0 (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) v_ArrVal_385)) (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_43|))))) is different from false [2023-11-29 01:18:42,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:18:42,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860726494] [2023-11-29 01:18:42,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860726494] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:18:42,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2039929227] [2023-11-29 01:18:42,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:42,314 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:18:42,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:18:42,315 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:18:42,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-11-29 01:18:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:42,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-29 01:18:42,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:18:42,877 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 [2023-11-29 01:18:43,054 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 [2023-11-29 01:18:43,245 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 [2023-11-29 01:18:43,248 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 [2023-11-29 01:18:43,555 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 01:18:43,555 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 20 treesize of output 23 [2023-11-29 01:18:43,582 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 01:18:43,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-11-29 01:18:44,212 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 [2023-11-29 01:18:44,452 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-11-29 01:18:44,452 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 88 treesize of output 58 [2023-11-29 01:18:44,663 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 83 treesize of output 51 [2023-11-29 01:18:44,674 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:18:44,674 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 51 treesize of output 34 [2023-11-29 01:18:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:18:44,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:18:45,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:18:45,070 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 100 treesize of output 87 [2023-11-29 01:19:12,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2039929227] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:19:12,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:19:12,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2023-11-29 01:19:12,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747537622] [2023-11-29 01:19:12,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:19:12,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 01:19:12,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:19:12,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 01:19:12,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2005, Unknown=19, NotChecked=276, Total=2450 [2023-11-29 01:19:12,876 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 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) [2023-11-29 01:19:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:19:16,899 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2023-11-29 01:19:16,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 01:19:16,901 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 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 30 [2023-11-29 01:19:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:19:16,901 INFO L225 Difference]: With dead ends: 50 [2023-11-29 01:19:16,901 INFO L226 Difference]: Without dead ends: 47 [2023-11-29 01:19:16,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=370, Invalid=3913, Unknown=19, NotChecked=390, Total=4692 [2023-11-29 01:19:16,904 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:19:16,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 389 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 594 Invalid, 0 Unknown, 55 Unchecked, 1.9s Time] [2023-11-29 01:19:16,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-29 01:19:16,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2023-11-29 01:19:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2023-11-29 01:19:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-11-29 01:19:16,912 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 30 [2023-11-29 01:19:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:19:16,913 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-11-29 01:19:16,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 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) [2023-11-29 01:19:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-11-29 01:19:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 01:19:16,914 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:19:16,914 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:19:16,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-11-29 01:19:17,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 01:19:17,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:19:17,315 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:19:17,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:19:17,315 INFO L85 PathProgramCache]: Analyzing trace with hash -763742840, now seen corresponding path program 1 times [2023-11-29 01:19:17,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:19:17,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993977704] [2023-11-29 01:19:17,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:19:17,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:19:17,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:19:17,317 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:19:17,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 01:19:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:17,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 01:19:17,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:19:17,550 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 [2023-11-29 01:19:17,668 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 [2023-11-29 01:19:17,723 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:19:17,723 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 [2023-11-29 01:19:17,800 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 [2023-11-29 01:19:17,807 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 [2023-11-29 01:19:17,981 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 [2023-11-29 01:19:17,987 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 [2023-11-29 01:19:17,992 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 [2023-11-29 01:19:18,101 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (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))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_9|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_9|) (_ bv0 32)))) is different from true [2023-11-29 01:19:18,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:19:18,127 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 [2023-11-29 01:19:18,161 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 01:19:18,162 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 [2023-11-29 01:19:18,172 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 [2023-11-29 01:19:18,448 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 [2023-11-29 01:19:18,583 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 [2023-11-29 01:19:18,654 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 [2023-11-29 01:19:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:19:18,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:19:19,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:19:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993977704] [2023-11-29 01:19:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993977704] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:19:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1721076375] [2023-11-29 01:19:19,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:19:19,643 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:19:19,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:19:19,644 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:19:19,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-11-29 01:19:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:19,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 01:19:19,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:19:20,287 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 [2023-11-29 01:19:20,378 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 [2023-11-29 01:19:20,586 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 [2023-11-29 01:19:20,600 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 [2023-11-29 01:19:20,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 01:19:20,904 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 [2023-11-29 01:19:20,908 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 [2023-11-29 01:19:21,191 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10| (_ BitVec 32))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10|) (_ bv0 32)) (_ bv0 32))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 01:19:21,247 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 01:19:21,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-11-29 01:19:21,254 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 [2023-11-29 01:19:21,261 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 [2023-11-29 01:19:21,776 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 [2023-11-29 01:19:22,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:19:22,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2023-11-29 01:19:22,396 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 [2023-11-29 01:19:22,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:19:22,582 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 [2023-11-29 01:19:22,591 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:19:22,592 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 [2023-11-29 01:19:22,719 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-29 01:19:22,719 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:19:22,746 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_590) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-11-29 01:19:23,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:19:23,212 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 44 [2023-11-29 01:19:23,237 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_ArrVal_590 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| v_arrayElimIndex_4 v_ArrVal_590) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_ArrVal_590 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_int#2| v_arrayElimIndex_4 v_ArrVal_590) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_4))) (forall ((v_ArrVal_590 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| (_ bv0 32) v_ArrVal_590) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-11-29 01:19:23,270 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_ArrVal_590 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| v_arrayElimIndex_4 v_ArrVal_590) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (= .cse2 (select (select |c_#memory_$Pointer$#2.offset| .cse3) (bvadd (_ bv4 32) .cse2))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_ArrVal_590 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_4 .cse3) (= (select (select (store |c_#memory_int#2| v_arrayElimIndex_4 v_ArrVal_590) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|))) (forall ((v_ArrVal_590 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| (_ bv0 32) v_ArrVal_590) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-11-29 01:19:36,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1721076375] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:19:36,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:19:36,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2023-11-29 01:19:36,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580004149] [2023-11-29 01:19:36,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:19:36,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-29 01:19:36,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:19:36,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-29 01:19:36,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2335, Unknown=54, NotChecked=510, Total=3080 [2023-11-29 01:19:36,549 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 42 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 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) [2023-11-29 01:19:39,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:19:39,868 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2023-11-29 01:19:39,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 01:19:39,869 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 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 32 [2023-11-29 01:19:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:19:39,871 INFO L225 Difference]: With dead ends: 57 [2023-11-29 01:19:39,871 INFO L226 Difference]: Without dead ends: 55 [2023-11-29 01:19:39,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=327, Invalid=3799, Unknown=54, NotChecked=650, Total=4830 [2023-11-29 01:19:39,873 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 86 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:19:39,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 346 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 674 Invalid, 0 Unknown, 128 Unchecked, 1.8s Time] [2023-11-29 01:19:39,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-29 01:19:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2023-11-29 01:19:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 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) [2023-11-29 01:19:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2023-11-29 01:19:39,887 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2023-11-29 01:19:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:19:39,888 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2023-11-29 01:19:39,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 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) [2023-11-29 01:19:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2023-11-29 01:19:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 01:19:39,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:19:39,889 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:19:39,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2023-11-29 01:19:40,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 01:19:40,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:19:40,290 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:19:40,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:19:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2093721238, now seen corresponding path program 1 times [2023-11-29 01:19:40,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:19:40,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592770834] [2023-11-29 01:19:40,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:19:40,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:19:40,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:19:40,292 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:19:40,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 01:19:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:40,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:19:40,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:19:40,503 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 31 treesize of output 19 [2023-11-29 01:19:40,505 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 13 [2023-11-29 01:19:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 01:19:40,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:19:40,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:19:40,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592770834] [2023-11-29 01:19:40,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592770834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:19:40,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:19:40,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:19:40,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553107975] [2023-11-29 01:19:40,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:19:40,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:19:40,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:19:40,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:19:40,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:19:40,523 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:19:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:19:40,685 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2023-11-29 01:19:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:19:40,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-11-29 01:19:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:19:40,686 INFO L225 Difference]: With dead ends: 51 [2023-11-29 01:19:40,686 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 01:19:40,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:19:40,687 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:19:40,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:19:40,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 01:19:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2023-11-29 01:19:40,700 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) [2023-11-29 01:19:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2023-11-29 01:19:40,700 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 33 [2023-11-29 01:19:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:19:40,701 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2023-11-29 01:19:40,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:19:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2023-11-29 01:19:40,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 01:19:40,701 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:19:40,702 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:19:40,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 01:19:40,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:19:40,902 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:19:40,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:19:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2033027363, now seen corresponding path program 2 times [2023-11-29 01:19:40,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:19:40,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386643892] [2023-11-29 01:19:40,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:19:40,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:19:40,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:19:40,904 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:19:40,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 01:19:41,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:19:41,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:19:41,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 01:19:41,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:19:41,167 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 [2023-11-29 01:19:41,224 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 [2023-11-29 01:19:41,232 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 [2023-11-29 01:19:41,389 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:19:41,389 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 [2023-11-29 01:19:41,417 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:19:41,417 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 [2023-11-29 01:19:41,445 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:19:41,445 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 [2023-11-29 01:19:41,517 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 [2023-11-29 01:19:41,533 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 [2023-11-29 01:19:41,716 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 01:19:41,716 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 [2023-11-29 01:19:41,723 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 [2023-11-29 01:19:41,728 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 [2023-11-29 01:19:45,836 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (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))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_11|) (_ bv0 32)))) is different from true [2023-11-29 01:19:45,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:19:45,892 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 01:19:45,893 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 [2023-11-29 01:19:45,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:19:45,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:19:45,911 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 [2023-11-29 01:19:45,940 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 01:19:45,941 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 [2023-11-29 01:19:46,111 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 65 treesize of output 41 [2023-11-29 01:19:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:19:46,464 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:19:47,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:19:47,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386643892] [2023-11-29 01:19:47,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386643892] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:19:47,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [810230037] [2023-11-29 01:19:47,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:19:47,623 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:19:47,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:19:47,624 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:19:47,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-11-29 01:19:48,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:19:48,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:19:48,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-29 01:19:48,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:19:48,111 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 [2023-11-29 01:19:48,368 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 [2023-11-29 01:19:48,694 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 [2023-11-29 01:19:48,849 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:19:48,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:19:48,876 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 16 treesize of output 11 [2023-11-29 01:19:49,053 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 27 treesize of output 15 [2023-11-29 01:19:49,066 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 [2023-11-29 01:19:49,075 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 [2023-11-29 01:19:49,488 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 01:19:49,489 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 43 treesize of output 26 [2023-11-29 01:19:49,496 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 [2023-11-29 01:19:49,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:19:49,509 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 [2023-11-29 01:19:49,813 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|) (_ bv0 32))))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_12| (_ BitVec 32))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_12|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_12|) (_ bv0 32)) (_ bv0 32)))))) is different from true [2023-11-29 01:19:49,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:19:49,876 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 01:19:49,876 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 51 treesize of output 40 [2023-11-29 01:19:49,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:19:49,926 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 01:19:49,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-11-29 01:19:49,942 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 [2023-11-29 01:19:49,955 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 [2023-11-29 01:19:51,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:19:51,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2023-11-29 01:19:51,958 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-11-29 01:19:51,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 22 [2023-11-29 01:19:51,963 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 [2023-11-29 01:19:52,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:19:52,130 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 [2023-11-29 01:19:52,140 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:19:52,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 15 treesize of output 7 [2023-11-29 01:19:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:19:52,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:19:52,710 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_799) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.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 [2023-11-29 01:19:54,067 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (v_ArrVal_812 (_ BitVec 32)) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_58| (store (store (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_58|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_812))) (.cse1 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_58| v_ArrVal_811)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse6 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (let ((.cse3 (select (select .cse1 .cse5) .cse6)) (.cse4 (bvadd (_ bv4 32) (select (select .cse2 .cse5) .cse6)))) (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_58| v_ArrVal_810) .cse0 v_ArrVal_799) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select .cse1 .cse0) (bvadd (select (select .cse2 .cse3) .cse4) (_ bv4 32))) (_ bv0 32))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_58|) (_ bv0 1)))))))) is different from false [2023-11-29 01:19:54,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [810230037] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:19:54,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:19:54,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 43 [2023-11-29 01:19:54,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635551683] [2023-11-29 01:19:54,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:19:54,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-29 01:19:54,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:19:54,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-29 01:19:54,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2701, Unknown=5, NotChecked=428, Total=3306 [2023-11-29 01:19:54,081 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 43 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 34 states have internal predecessors, (55), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:19:58,285 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] [2023-11-29 01:20:15,367 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] [2023-11-29 01:20:16,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:16,706 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2023-11-29 01:20:16,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 01:20:16,707 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 34 states have internal predecessors, (55), 6 states have call successors, (6), 5 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 34 [2023-11-29 01:20:16,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:20:16,708 INFO L225 Difference]: With dead ends: 88 [2023-11-29 01:20:16,708 INFO L226 Difference]: Without dead ends: 73 [2023-11-29 01:20:16,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=327, Invalid=4513, Unknown=6, NotChecked=556, Total=5402 [2023-11-29 01:20:16,711 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:20:16,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 372 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 876 Invalid, 2 Unknown, 136 Unchecked, 11.4s Time] [2023-11-29 01:20:16,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-29 01:20:16,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2023-11-29 01:20:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:20:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2023-11-29 01:20:16,725 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 34 [2023-11-29 01:20:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:20:16,726 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2023-11-29 01:20:16,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 34 states have internal predecessors, (55), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:20:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2023-11-29 01:20:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 01:20:16,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:20:16,727 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:20:16,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 01:20:16,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2023-11-29 01:20:17,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:20:17,128 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:20:17,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:17,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2074439326, now seen corresponding path program 1 times [2023-11-29 01:20:17,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:20:17,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129993514] [2023-11-29 01:20:17,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:17,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:17,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:20:17,130 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:20:17,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 01:20:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:17,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-29 01:20:17,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:17,416 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 [2023-11-29 01:20:17,446 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 [2023-11-29 01:20:17,537 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 [2023-11-29 01:20:17,750 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:20:17,751 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 [2023-11-29 01:20:17,797 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:20:17,797 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 [2023-11-29 01:20:17,907 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 [2023-11-29 01:20:17,921 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 [2023-11-29 01:20:17,931 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 [2023-11-29 01:20:18,229 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 [2023-11-29 01:20:18,237 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 [2023-11-29 01:20:18,245 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 [2023-11-29 01:20:18,252 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 [2023-11-29 01:20:18,448 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#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))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_13|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_13|) (_ bv0 32)))) is different from true [2023-11-29 01:20:18,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:18,492 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 [2023-11-29 01:20:18,547 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 01:20:18,547 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 [2023-11-29 01:20:18,559 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 24 treesize of output 19 [2023-11-29 01:20:18,571 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 [2023-11-29 01:20:19,211 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 01:20:19,211 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 [2023-11-29 01:20:19,222 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 [2023-11-29 01:20:19,232 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 [2023-11-29 01:20:19,370 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 [2023-11-29 01:20:19,525 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 [2023-11-29 01:20:19,531 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 [2023-11-29 01:20:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:20:19,780 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:20,295 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_885 (_ BitVec 32)) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) v_ArrVal_885)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_887) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_884) .cse0) .cse1))))) is different from false [2023-11-29 01:20:20,356 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_885 (_ BitVec 32)) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int#2| .cse0 (store (select |c_#memory_int#2| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1)) v_ArrVal_885)) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_887) .cse2) .cse3)) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_884) .cse2) .cse3)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-11-29 01:20:21,481 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_885 (_ BitVec 32)) (|v_node_create_~temp~0#1.base_61| (_ BitVec 32)) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_61| v_ArrVal_895)) (.cse3 (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_61| v_ArrVal_897)) (.cse1 (select (select .cse5 .cse3) .cse4)) (.cse6 (select (select |c_#memory_$Pointer$#1.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$#1.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#2| |v_node_create_~temp~0#1.base_61| v_ArrVal_896))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd (_ bv4 32) (select (select .cse2 .cse3) .cse4)) v_ArrVal_885))) (select (select (store .cse5 .cse1 v_ArrVal_887) .cse6) .cse7)) (select (select (store .cse2 .cse1 v_ArrVal_884) .cse6) .cse7))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_61|))))) is different from false [2023-11-29 01:20:21,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:20:21,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129993514] [2023-11-29 01:20:21,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129993514] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:20:21,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [582896486] [2023-11-29 01:20:21,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:21,495 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:20:21,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:20:21,496 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:20:21,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-11-29 01:20:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:21,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 83 conjunts are in the unsatisfiable core [2023-11-29 01:20:21,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:21,976 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 [2023-11-29 01:20:21,987 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 [2023-11-29 01:20:22,150 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 [2023-11-29 01:20:22,370 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:20:22,370 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 [2023-11-29 01:20:22,413 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:20:22,413 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 [2023-11-29 01:20:22,588 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 [2023-11-29 01:20:22,612 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 [2023-11-29 01:20:22,618 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 [2023-11-29 01:20:23,067 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 [2023-11-29 01:20:23,076 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 [2023-11-29 01:20:23,083 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 [2023-11-29 01:20:23,090 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 [2023-11-29 01:20:23,430 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |node_create_~temp~0#1.base| (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_14|) (_ bv0 32))))) is different from true [2023-11-29 01:20:23,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:23,461 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 [2023-11-29 01:20:23,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:23,480 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 [2023-11-29 01:20:23,528 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 01:20:23,529 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 [2023-11-29 01:20:23,539 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 [2023-11-29 01:20:24,424 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 01:20:24,424 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 [2023-11-29 01:20:24,436 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 [2023-11-29 01:20:24,446 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 [2023-11-29 01:20:24,648 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 [2023-11-29 01:20:24,728 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 [2023-11-29 01:20:24,734 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 [2023-11-29 01:20:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:20:24,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:25,746 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int#2| .cse0 (store (select |c_#memory_int#2| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1)) v_ArrVal_971)) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_968) .cse2) .cse3)) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_969) .cse2) .cse3)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-11-29 01:20:25,814 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int#2| .cse0 (store (select |c_#memory_int#2| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2)) v_ArrVal_971)) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_968) .cse3) .cse4)) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_969) .cse3) .cse4)))))) is different from false [2023-11-29 01:20:26,075 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_981 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_64| (_ BitVec 32)) (v_ArrVal_980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_971 (_ BitVec 32)) (v_ArrVal_969 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_64| v_ArrVal_981)) (.cse3 (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_64| v_ArrVal_979)) (.cse1 (select (select .cse5 .cse3) .cse4)) (.cse6 (select (select |c_#memory_$Pointer$#1.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$#1.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#2| |v_node_create_~temp~0#1.base_64| v_ArrVal_980))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd (_ bv4 32) (select (select .cse2 .cse3) .cse4)) v_ArrVal_971))) (select (select (store .cse5 .cse1 v_ArrVal_968) .cse6) .cse7)) (select (select (store .cse2 .cse1 v_ArrVal_969) .cse6) .cse7))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_64|))))) is different from false [2023-11-29 01:20:26,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [582896486] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:20:26,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:26,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 37 [2023-11-29 01:20:26,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841482668] [2023-11-29 01:20:26,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:26,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 01:20:26,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:20:26,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 01:20:26,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1559, Unknown=46, NotChecked=696, Total=2450 [2023-11-29 01:20:26,096 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 29 states have internal predecessors, (46), 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) [2023-11-29 01:20:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:32,679 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2023-11-29 01:20:32,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 01:20:32,679 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 29 states have internal predecessors, (46), 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 35 [2023-11-29 01:20:32,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:20:32,680 INFO L225 Difference]: With dead ends: 75 [2023-11-29 01:20:32,680 INFO L226 Difference]: Without dead ends: 73 [2023-11-29 01:20:32,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=263, Invalid=2800, Unknown=49, NotChecked=920, Total=4032 [2023-11-29 01:20:32,682 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:20:32,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 303 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 724 Invalid, 0 Unknown, 134 Unchecked, 2.4s Time] [2023-11-29 01:20:32,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-29 01:20:32,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2023-11-29 01:20:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:20:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2023-11-29 01:20:32,702 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 35 [2023-11-29 01:20:32,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:20:32,702 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2023-11-29 01:20:32,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 29 states have internal predecessors, (46), 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) [2023-11-29 01:20:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2023-11-29 01:20:32,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 01:20:32,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:20:32,703 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 01:20:32,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 01:20:32,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2023-11-29 01:20:33,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:20:33,104 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:20:33,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:33,105 INFO L85 PathProgramCache]: Analyzing trace with hash -116944832, now seen corresponding path program 1 times [2023-11-29 01:20:33,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:20:33,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876591253] [2023-11-29 01:20:33,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:33,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:33,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:20:33,106 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:20:33,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 01:20:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:33,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 01:20:33,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:33,314 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 [2023-11-29 01:20:33,531 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:20:33,531 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 [2023-11-29 01:20:33,606 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 [2023-11-29 01:20:33,619 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 [2023-11-29 01:20:33,805 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 [2023-11-29 01:20:33,812 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 [2023-11-29 01:20:33,818 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 [2023-11-29 01:20:34,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:34,066 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 40 treesize of output 29 [2023-11-29 01:20:34,110 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 01:20:34,111 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 [2023-11-29 01:20:34,145 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 [2023-11-29 01:20:35,008 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-29 01:20:35,009 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 140 treesize of output 70 [2023-11-29 01:20:35,021 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 [2023-11-29 01:20:35,182 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 79 treesize of output 51 [2023-11-29 01:20:35,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:20:35,686 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:20:35,687 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 [2023-11-29 01:20:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:20:35,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:37,914 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_append_#t~ret7#1.base_56| (_ BitVec 32))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_56| (_ bv0 32)) (not (= (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_56| v_ArrVal_1053)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse7 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_56| v_ArrVal_1052)) (.cse4 (select (select .cse3 .cse6) .cse7)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (let ((.cse0 (store .cse3 .cse4 (store (select .cse3 .cse4) (bvadd (_ bv4 32) (select (select .cse5 .cse6) .cse7)) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_56|)))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store .cse5 .cse4 v_ArrVal_1046) .cse1) .cse2))))) (_ bv0 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_56|) (_ bv0 1))))) is different from false [2023-11-29 01:20:37,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:20:37,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876591253] [2023-11-29 01:20:37,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876591253] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:20:37,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [938638151] [2023-11-29 01:20:37,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:37,920 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:20:37,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:20:37,921 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:20:37,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-11-29 01:20:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:38,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 01:20:38,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:38,828 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 [2023-11-29 01:20:38,998 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 [2023-11-29 01:20:39,348 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 [2023-11-29 01:20:39,352 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 [2023-11-29 01:20:43,905 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 01:20:43,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-11-29 01:20:43,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 01:20:46,058 INFO L349 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2023-11-29 01:20:46,059 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 61 [2023-11-29 01:20:46,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:46,081 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 36 treesize of output 15 [2023-11-29 01:20:46,358 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 67 treesize of output 43 [2023-11-29 01:20:46,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:20:47,119 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:20:47,119 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 44 treesize of output 23 [2023-11-29 01:20:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:20:47,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:48,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:20:48,888 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 435 treesize of output 445 [2023-11-29 01:20:52,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:20:56,052 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 34 treesize of output 18 [2023-11-29 01:21:03,334 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 34 treesize of output 18 [2023-11-29 01:21:03,624 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 18 treesize of output 10 [2023-11-29 01:21:45,870 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 17 treesize of output 9 [2023-11-29 01:21:46,959 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:21:49,237 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 3 [2023-11-29 01:21:50,518 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:22:20,827 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:22:52,927 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:22:53,276 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:23:15,244 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (bvadd (_ bv4 32) .cse9))) (let ((.cse40 (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (.cse45 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse185 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse185) (= .cse9 .cse185))))) (.cse67 (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse9 (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10)))) (.cse90 (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse8)) (.cse14 (= .cse9 .cse6)) (.cse151 (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse184 (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10))) (or (= .cse9 .cse184) (= .cse184 |c_ULTIMATE.start_sll_append_~last~0#1.offset|))))) (.cse0 (= .cse9 |c_ULTIMATE.start_sll_append_~last~0#1.offset|)) (.cse55 (= .cse8 (_ bv0 32))) (.cse89 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse183 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse183) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= .cse9 .cse183))))) (.cse4 (= .cse6 (_ bv0 32))) (.cse58 (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse182 (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10))) (or (= .cse182 .cse6) (= .cse9 .cse182)))))) (let ((.cse64 (or .cse4 .cse58)) (.cse21 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse181 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse181) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= .cse9 .cse181))))) (.cse37 (or .cse89 .cse4)) (.cse146 (not .cse55)) (.cse152 (or .cse151 .cse0)) (.cse50 (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse180 (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10))) (or (= .cse180 .cse6) (= .cse9 .cse180) (= .cse180 |c_ULTIMATE.start_sll_append_~last~0#1.offset|))))) (.cse139 (not .cse14)) (.cse53 (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10) .cse6))) (.cse104 (and .cse0 .cse90)) (.cse98 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse179 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse179) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse179)))) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (.cse32 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)))))) (.cse117 (and .cse58 .cse67)) (.cse88 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse178 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse178) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= v_arrayElimIndex_18 .cse8) (= .cse9 .cse178))))) (.cse15 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (= .cse9 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))))) (.cse79 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse177 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse177) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= .cse9 .cse177))))) (.cse54 (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (_ bv0 32))) (.cse12 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse176 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse176) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (= .cse9 .cse176))))) (.cse13 (or .cse14 .cse45)) (.cse114 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse175 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse175) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse175) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18))))) (.cse97 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse174 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse174) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse174) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18))))) (.cse155 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse173 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse173) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse173) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= .cse9 .cse173))))) (.cse102 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse172 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse172) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= .cse9 .cse172))))) (.cse103 (or (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse171 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse171) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= .cse9 .cse171)))) .cse4)) (.cse149 (or .cse0 .cse40)) (.cse29 (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse170 (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10))) (or (= .cse170 .cse6) (= .cse170 |c_ULTIMATE.start_sll_append_~last~0#1.offset|)))))) (let ((.cse63 (and .cse149 .cse29)) (.cse20 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse6 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (.cse93 (and .cse102 .cse103)) (.cse95 (or .cse4 .cse155)) (.cse110 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse169 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse169) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse169) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= .cse9 .cse169))))) (.cse65 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (= v_arrayElimIndex_18 .cse8) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse168 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse168) (= .cse9 .cse168))))))) (.cse85 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse167 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse167) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse167) (= v_arrayElimIndex_18 .cse8))))) (.cse123 (and .cse114 (or .cse4 .cse97))) (.cse99 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= v_arrayElimIndex_18 .cse8)))) (.cse5 (and (or .cse14 .cse54 .cse15) (or .cse4 .cse54 (and (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse165 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse165) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 .cse8) (= .cse9 .cse165)))) (or .cse14 .cse79))) (or .cse54 (and (or .cse12 .cse14) (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse166 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse166) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (= v_arrayElimIndex_18 .cse8) (= .cse9 .cse166)))))) .cse13)) (.cse60 (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse8)) (.cse91 (or .cse4 (and .cse89 .cse88))) (.cse44 (or (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= .cse9 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)))) .cse4)) (.cse43 (or .cse4 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse164 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse164) (= .cse9 .cse164)))))) (.cse42 (or .cse4 .cse117)) (.cse100 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse163 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse163) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse163)))) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (.cse113 (or .cse4 (and .cse98 .cse32))) (.cse106 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (.cse34 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)))))) (.cse115 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse162 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse162) (= .cse9 .cse162))))))) (.cse131 (or .cse54 .cse104)) (.cse16 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse6 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (.cse124 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse6 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (.cse122 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse6 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= v_arrayElimIndex_18 .cse8)))) (.cse134 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse9 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (.cse132 (or .cse4 (and .cse53 .cse29) .cse54)) (.cse126 (or .cse139 .cse90)) (.cse26 (or .cse4 .cse53)) (.cse108 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse6 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (.cse109 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse6 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (.cse84 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse6 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (.cse83 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse6 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (.cse30 (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse27 (and .cse152 .cse50)) (.cse51 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse161 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse161) (= v_arrayElimIndex_18 .cse8) (= .cse9 .cse161))))) (.cse101 (or .cse4 .cse54 .cse67)) (.cse150 (or .cse139 .cse146)) (.cse41 (or .cse55 .cse29)) (.cse56 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))))) (.cse128 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= v_arrayElimIndex_18 .cse8)))) (.cse121 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse160 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse160) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse160) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= v_arrayElimIndex_18 .cse8))))) (.cse145 (let ((.cse159 (and .cse21 .cse37))) (and (or .cse159 .cse90) .cse64 (or .cse0 .cse159)))) (.cse1 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse158 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse158) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse158)))) (= v_arrayElimIndex_18 (_ bv0 32)) (= v_arrayElimIndex_18 .cse8)))) (.cse57 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)) (= v_arrayElimIndex_18 .cse8)))) (.cse2 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (= v_arrayElimIndex_18 .cse8)))) (.cse3 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse157 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse157) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse157)))) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= v_arrayElimIndex_18 .cse8))))) (and (or .cse0 (and .cse1 .cse2 (or .cse3 .cse4))) (or .cse0 .cse5) (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse7) (= v_arrayElimIndex_18 (_ bv0 32)) (= v_arrayElimIndex_18 .cse8) (= .cse9 .cse7)))) (or (let ((.cse17 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse82) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse82))))) (.cse62 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse81) (= .cse9 .cse81))))) (.cse61 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse80) (= v_arrayElimIndex_18 (_ bv0 32)) (= .cse9 .cse80)))))) (let ((.cse11 (or .cse4 .cse79)) (.cse18 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse78) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse78) (= v_arrayElimIndex_18 .cse8))))) (.cse39 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse77) (= .cse9 .cse77))))))) (.cse31 (or .cse4 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse76) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse76) (= .cse9 .cse76)))))) (.cse47 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse75) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse75) (= .cse9 .cse75))))) (.cse35 (and (or .cse62 .cse4) .cse61)) (.cse33 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))))) (.cse22 (or .cse4 .cse17)) (.cse28 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse74) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse74))))) (.cse59 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse73) (= v_arrayElimIndex_18 .cse8) (= .cse9 .cse73))))) (.cse24 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse72) (= .cse9 .cse72))))) (.cse38 (or .cse4 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse71) (= .cse9 .cse71)))))))) (.cse36 (or .cse4 .cse67)) (.cse52 (or (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse70) (= v_arrayElimIndex_18 .cse8) (= .cse9 .cse70)))) .cse4)) (.cse66 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse69) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse69)))) (= v_arrayElimIndex_18 .cse8))))) (and (or .cse0 (and .cse11 .cse12 .cse13 (or .cse14 .cse15))) .cse16 (or .cse14 (let ((.cse23 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse49) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse49)))) (= v_arrayElimIndex_18 (_ bv0 32))))) (.cse25 (or .cse4 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse48) (= .cse9 .cse48))))))) (and (or .cse4 (and (or .cse0 .cse17) .cse18)) (or .cse4 (and (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse19) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse19)))) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 .cse8))) .cse20)) .cse21 (or .cse0 (and .cse22 .cse23 .cse2)) (or .cse0 (and .cse24 .cse25)) .cse26 (or .cse4 .cse27) (or .cse0 .cse28) (or .cse4 .cse29 .cse30) .cse31 (or .cse0 (and (or .cse4 (and .cse32 .cse17)) .cse33 .cse23 .cse34)) (or .cse0 .cse35) (or .cse0 (and .cse24 .cse36 .cse25)) .cse37 (or .cse0 (and .cse38 .cse39)) (or .cse4 (and (or .cse0 (and .cse29 .cse40)) .cse41)) (or (and .cse11 .cse12 .cse42 .cse43 .cse44 .cse45 .cse15) .cse0) (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse46) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse46)))) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (= v_arrayElimIndex_18 .cse8))) .cse47))) (or .cse4 .cse29) (or .cse4 .cse18) (or .cse4 .cse50) (or .cse0 (and .cse51 .cse52)) (or .cse0 .cse39) (or (and .cse31 .cse47) .cse0) (or .cse4 .cse53 .cse30) (or .cse0 .cse14 .cse35 .cse54) (or .cse55 (and .cse56 .cse57 (or .cse33 .cse14)) .cse0) (or .cse55 .cse4 .cse58) (or (and .cse58 .cse53 .cse41) .cse4) (or .cse0 (and .cse22 .cse28)) (or .cse59 .cse4) (or .cse0 (and .cse56 .cse57)) (or .cse60 .cse4 .cse53) (or (and (or .cse61 .cse14) (or (and .cse59 (or .cse62 .cse14)) .cse4)) .cse0 .cse54) (or .cse0 .cse24) (or .cse55 .cse4 .cse63) .cse64 (or .cse55 .cse4 .cse29) (or (and .cse65 .cse38) .cse0) (or .cse55 .cse4 .cse27) (or (and (or .cse66 .cse4) .cse1 .cse2) .cse0) (or (and .cse51 .cse36 .cse52) .cse0) (or .cse55 .cse4 .cse53) (or .cse0 (and .cse57 .cse1 (or (and .cse66 .cse32) .cse4) .cse34)) (or .cse0 .cse4 .cse67) (or (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse68) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse68) (= v_arrayElimIndex_18 .cse8) (= .cse9 .cse68)))) .cse4)))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse6)) (or (and .cse0 (or .cse4 .cse83) .cse84) .cse30) (or .cse4 .cse85) (or (let ((.cse86 (or .cse21 .cse14)) (.cse87 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse92 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse92) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= v_arrayElimIndex_18 .cse8) (= .cse9 .cse92)))))) (and (or .cse0 (and .cse86 .cse87 (or .cse4 (and .cse88 (or .cse89 .cse14))))) (or .cse90 (and .cse91 .cse86 .cse87)) .cse64)) .cse54) (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse6 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (= v_arrayElimIndex_18 .cse8))) (or .cse4 .cse50 .cse54) (or .cse4 .cse54 .cse63) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| (_ bv0 32))) (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse6 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18))) (or .cse0 .cse93) (or .cse14 (let ((.cse112 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= .cse9 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))))) (.cse111 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse118 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse118) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= .cse9 .cse118)))))) (and (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse94 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse94) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse94) (= v_arrayElimIndex_18 .cse8)))) .cse95 (or (and (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse96) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse96) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= v_arrayElimIndex_18 .cse8)))) (or .cse0 .cse97)) .cse4) (or (and .cse98 .cse99) .cse90) (or (and .cse100 (or .cse98 .cse4) .cse2) .cse0) .cse21 (or (and (or (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= .cse9 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)))) .cse30) .cse101 .cse102 .cse103) .cse104) (or .cse90 .cse97) (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse105) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse105)))) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18))) (or .cse104 (and (or .cse106 .cse54) .cse100 (or .cse4 (and .cse98 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18))))) .cse34)) (or .cse4 (and (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse107 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse107) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse107)))) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18))) .cse20)) (or .cse60 (and .cse0 .cse100 .cse108 .cse90 (or .cse4 (and .cse98 .cse109)))) .cse37 .cse110 (or .cse93 .cse104) (or .cse90 (and .cse111 .cse112)) (or .cse0 (and .cse100 (or .cse55 .cse106) .cse113 .cse34)) (or .cse114 .cse0) (or .cse104 (and .cse115 (or .cse4 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= v_arrayElimIndex_18 .cse8) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse116 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse116) (= .cse9 .cse116))))))))) (or .cse104 .cse30) (or .cse0 (and (or .cse4 .cse112) .cse45 (or .cse4 .cse111) (or .cse4 .cse117 .cse54) .cse15))))) (or .cse60 (let ((.cse119 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= v_arrayElimIndex_18 .cse8) (= .cse9 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))))) (.cse120 (and .cse99 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10) .cse6) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)))) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= v_arrayElimIndex_18 .cse8)))))) (and (or .cse0 .cse119) (or .cse90 .cse120) (or .cse90 .cse119) .cse121 (or .cse0 .cse99) (or (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= v_arrayElimIndex_18 .cse8))) .cse90) .cse122 (or .cse0 .cse120)))) (or .cse0 (and .cse95 .cse110)) (or .cse90 .cse123) (or .cse102 .cse104) (or .cse4 .cse124) (or (and .cse65 (or .cse4 (and (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 .cse8) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse125 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse125) (= .cse9 .cse125)))))) .cse102))) .cse104) (or .cse4 (and (or .cse0 .cse121) .cse85)) (or (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= .cse6 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 .cse8))) .cse4) (or .cse0 .cse123) (or (and .cse3 .cse99) .cse90) (or .cse55 (let ((.cse127 (and .cse56 (or .cse14 .cse106) .cse128))) (and .cse126 (or .cse127 .cse104) (or .cse127 .cse54 .cse104)))) (or .cse4 .cse58 .cse54) (or .cse90 .cse5) (or .cse60 (let ((.cse129 (and (or .cse4 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10) .cse6) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18))) (= (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10) .cse6))))) (.cse130 (and .cse54 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (= v_arrayElimIndex_18 .cse8)))))) (and (or .cse0 .cse129) (or .cse90 .cse129) (or .cse0 .cse130) (or .cse106 .cse104) (or .cse55 (and .cse131 .cse132)) (or (let ((.cse133 (and .cse91 .cse21 .cse134))) (and (or .cse0 .cse133) .cse64 (or .cse90 .cse133))) .cse54) (or .cse90 .cse130)))) (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse135 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse135) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse135) (= v_arrayElimIndex_18 .cse8) (= .cse9 .cse135)))) (or .cse0 (and (or .cse14 (and .cse44 .cse15)) (or (and .cse43 .cse45) .cse14) .cse42)) (or .cse0 (and .cse100 .cse113 .cse106 .cse34)) (or (and .cse115 (or (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= .cse9 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)))) .cse30)) .cse54 .cse104) (or (let ((.cse143 (and (or .cse4 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse147 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10) .cse6) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse147) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= .cse9 .cse147))))) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (let ((.cse148 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse148) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= .cse9 .cse148)))) (= (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10) .cse6))))) (.cse136 (or .cse53 .cse54)) (.cse137 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10) .cse6) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)))) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (.cse138 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10) .cse6) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)))) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (.cse140 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) (_ bv0 32)) .cse10)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) (.cse141 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 (_ bv0 32)) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18))))) (and .cse131 (or (and (or .cse90 (and .cse16 (or (and .cse122 .cse124) .cse4))) (or (and .cse16 (or (and (or .cse14 .cse124) .cse122) .cse4)) .cse0) .cse26) .cse54) (or .cse90 (and .cse136 .cse137 (or .cse4 .cse138) (or .cse139 .cse140) .cse141)) (or .cse54 (let ((.cse142 (and (or .cse4 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10) .cse6) (= .cse9 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))))))) (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| (_ bv0 32) v_ArrVal_1046) .cse8) .cse10) .cse6) (= .cse9 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)))))) .cse134))) (and .cse64 (or .cse90 .cse142) (or .cse0 .cse142)))) (or .cse143 .cse0) .cse132 (or .cse55 (and .cse126 (or (and (or .cse14 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18)))) .cse128) .cse104) (or (let ((.cse144 (and .cse14 .cse108 (or .cse4 .cse109)))) (and (or .cse0 .cse144) .cse26 (or .cse144 .cse90))) .cse54))) (or .cse143 .cse90) (or .cse54 .cse145) (or .cse0 (and (or .cse55 .cse84 .cse54) .cse136 .cse137 (or .cse4 (and (or .cse139 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) (_ bv0 32)) .cse10)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18))) .cse146) .cse138 (or .cse55 .cse83 .cse54))) (or .cse139 .cse146 .cse140) .cse141)))) .cse30) (or .cse4 (and .cse149 .cse58 .cse53 .cse150 (or .cse0 .cse67) (or (and (or .cse151 .cse14) .cse67) .cse0) .cse152 (or .cse0 (and .cse151 .cse67)) .cse50 .cse29)) (or .cse0 .cse4 .cse54 .cse67) (or .cse4 .cse53 .cse54) (or .cse4 .cse54 .cse27) (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse153 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse153) (= v_arrayElimIndex_18 (_ bv0 32)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse153) (= v_arrayElimIndex_18 .cse8)))) (or (and .cse51 .cse101 (or .cse4 (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse154 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse154) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= v_arrayElimIndex_18 .cse8) (= .cse9 .cse154)))))) .cse104) (or (and (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse6 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (= v_arrayElimIndex_18 .cse8))) .cse53 .cse67) .cse90) (or .cse4 (and .cse58 .cse53 .cse150 .cse41) .cse54) (or (and .cse56 .cse128) .cse104) (or .cse90 .cse121) (or .cse90 .cse155) (or (forall ((v_arrayElimIndex_18 (_ BitVec 32)) (v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse156 (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (or (= .cse6 .cse156) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse156) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_18) (= v_arrayElimIndex_18 .cse8) (= .cse9 .cse156)))) .cse4) (or .cse88 .cse4) (or .cse14 .cse54 .cse145) (or (and .cse1 (or .cse55 .cse57) .cse2 (or .cse4 (and .cse3 (forall ((v_arrayElimIndex_18 (_ BitVec 32))) (or (= v_arrayElimIndex_18 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) (forall ((v_ArrVal_1046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_18 v_ArrVal_1046) .cse8) .cse10))) (= v_arrayElimIndex_18 .cse8)))))) .cse104) (or .cse4 .cse54 .cse29))))))) is different from true [2023-11-29 01:24:33,402 WARN L293 SmtUtils]: Spent 29.03s on a formula simplification. DAG size of input: 356 DAG size of output: 342 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:25:08,968 WARN L293 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 342 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:27:33,300 WARN L293 SmtUtils]: Spent 47.18s on a formula simplification that was a NOOP. DAG size: 717 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:27:33,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [938638151] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:27:33,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:27:33,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 46 [2023-11-29 01:27:33,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230621616] [2023-11-29 01:27:33,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:27:33,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-29 01:27:33,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:27:33,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-29 01:27:33,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3303, Unknown=60, NotChecked=234, Total=3782 [2023-11-29 01:27:33,356 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 46 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 37 states have internal predecessors, (54), 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) [2023-11-29 01:29:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:29:10,481 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2023-11-29 01:29:10,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-29 01:29:10,483 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 37 states have internal predecessors, (54), 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 36 [2023-11-29 01:29:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:29:10,484 INFO L225 Difference]: With dead ends: 73 [2023-11-29 01:29:10,484 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 01:29:10,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 286.8s TimeCoverageRelationStatistics Valid=432, Invalid=5988, Unknown=68, NotChecked=318, Total=6806 [2023-11-29 01:29:10,487 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 97 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:29:10,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 528 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 22.9s Time] [2023-11-29 01:29:10,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 01:29:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2023-11-29 01:29:10,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:29:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2023-11-29 01:29:10,506 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 36 [2023-11-29 01:29:10,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:29:10,506 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2023-11-29 01:29:10,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 37 states have internal predecessors, (54), 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) [2023-11-29 01:29:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2023-11-29 01:29:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 01:29:10,507 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:29:10,507 INFO L195 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] [2023-11-29 01:29:10,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2023-11-29 01:29:10,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 01:29:10,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:10,908 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:29:10,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:10,909 INFO L85 PathProgramCache]: Analyzing trace with hash -661809720, now seen corresponding path program 2 times [2023-11-29 01:29:10,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:29:10,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035988623] [2023-11-29 01:29:10,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:29:10,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:10,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:29:10,910 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:29:10,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e27eb7-ef07-49fb-a1c1-a32a13b4f502/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 01:29:11,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:29:11,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:29:11,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-29 01:29:11,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:29:11,275 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 [2023-11-29 01:29:14,146 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:29:14,147 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 [2023-11-29 01:29:14,996 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 [2023-11-29 01:29:15,082 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 [2023-11-29 01:29:17,059 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 [2023-11-29 01:29:17,111 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 [2023-11-29 01:29:17,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 11 treesize of output 3 [2023-11-29 01:29:20,018 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-29 01:29:20,019 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 30 treesize of output 22 [2023-11-29 01:29:20,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:20,174 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 50 treesize of output 34 [2023-11-29 01:29:20,720 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 01:29:20,720 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 [2023-11-29 01:29:28,713 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2023-11-29 01:29:28,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 93 [2023-11-29 01:29:28,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:28,958 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 58 treesize of output 52 [2023-11-29 01:29:30,370 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 116 treesize of output 80 [2023-11-29 01:29:40,788 INFO L349 Elim1Store]: treesize reduction 41, result has 16.3 percent of original size [2023-11-29 01:29:40,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 52 [2023-11-29 01:29:40,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 01:29:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:29:42,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:29:47,500 INFO L349 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2023-11-29 01:29:47,500 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 23 treesize of output 23