./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:59:19,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:59:19,547 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:59:19,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:59:19,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:59:19,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:59:19,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:59:19,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:59:19,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:59:19,581 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:59:19,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:59:19,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:59:19,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:59:19,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:59:19,584 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:59:19,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:59:19,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:59:19,585 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:59:19,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:59:19,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:59:19,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:59:19,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:59:19,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:59:19,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:59:19,588 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:59:19,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:59:19,589 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:59:19,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:59:19,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:59:19,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:59:19,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:59:19,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:59:19,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:59:19,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:59:19,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:59:19,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:59:19,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:59:19,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:59:19,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:59:19,595 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:59:19,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:59:19,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:59:19,595 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_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2023-11-29 06:59:19,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:59:19,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:59:19,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:59:19,856 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:59:19,856 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:59:19,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-11-29 06:59:22,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:59:22,791 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:59:22,791 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-11-29 06:59:22,806 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/data/c17936595/ec0615413aac44b5955339f9ab06b4a9/FLAGc4bfdb6fd [2023-11-29 06:59:22,818 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/data/c17936595/ec0615413aac44b5955339f9ab06b4a9 [2023-11-29 06:59:22,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:59:22,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:59:22,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:59:22,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:59:22,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:59:22,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:59:22" (1/1) ... [2023-11-29 06:59:22,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@737fd547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:22, skipping insertion in model container [2023-11-29 06:59:22,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:59:22" (1/1) ... [2023-11-29 06:59:22,876 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:59:23,131 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_c49c8e6b-b211-42d3-8076-cd0bf368fda5/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2023-11-29 06:59:23,135 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:59:23,144 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:59:23,183 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_c49c8e6b-b211-42d3-8076-cd0bf368fda5/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2023-11-29 06:59:23,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:59:23,216 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:59:23,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:23 WrapperNode [2023-11-29 06:59:23,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:59:23,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:59:23,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:59:23,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:59:23,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:23" (1/1) ... [2023-11-29 06:59:23,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:23" (1/1) ... [2023-11-29 06:59:23,256 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2023-11-29 06:59:23,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:59:23,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:59:23,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:59:23,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:59:23,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:23" (1/1) ... [2023-11-29 06:59:23,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:23" (1/1) ... [2023-11-29 06:59:23,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:23" (1/1) ... [2023-11-29 06:59:23,291 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 9, 6]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2023-11-29 06:59:23,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:23" (1/1) ... [2023-11-29 06:59:23,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:23" (1/1) ... [2023-11-29 06:59:23,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:23" (1/1) ... [2023-11-29 06:59:23,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:23" (1/1) ... [2023-11-29 06:59:23,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:23" (1/1) ... [2023-11-29 06:59:23,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:23" (1/1) ... [2023-11-29 06:59:23,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:59:23,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:59:23,310 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:59:23,310 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:59:23,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:23" (1/1) ... [2023-11-29 06:59:23,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:59:23,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:59:23,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:59:23,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:59:23,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:59:23,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:59:23,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 06:59:23,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:59:23,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:59:23,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:59:23,368 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 06:59:23,368 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 06:59:23,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:59:23,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:59:23,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:59:23,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:59:23,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:59:23,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 06:59:23,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:59:23,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:59:23,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 06:59:23,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:59:23,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 06:59:23,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 06:59:23,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 06:59:23,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:59:23,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:59:23,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:59:23,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:59:23,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:59:23,489 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:59:23,491 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:59:23,651 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:59:23,684 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:59:23,684 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 06:59:23,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:59:23 BoogieIcfgContainer [2023-11-29 06:59:23,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:59:23,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:59:23,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:59:23,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:59:23,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:59:22" (1/3) ... [2023-11-29 06:59:23,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4f460d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:59:23, skipping insertion in model container [2023-11-29 06:59:23,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:59:23" (2/3) ... [2023-11-29 06:59:23,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4f460d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:59:23, skipping insertion in model container [2023-11-29 06:59:23,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:59:23" (3/3) ... [2023-11-29 06:59:23,692 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-11-29 06:59:23,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:59:23,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:59:23,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:59:23,750 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;@76b5da18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:59:23,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:59:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:59:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 06:59:23,760 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:23,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:23,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:23,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:23,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1424445379, now seen corresponding path program 1 times [2023-11-29 06:59:23,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:23,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092837581] [2023-11-29 06:59:23,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:23,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:23,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 06:59:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:23,990 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 06:59:23,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:23,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092837581] [2023-11-29 06:59:23,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092837581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:59:23,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:59:23,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:59:23,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642720385] [2023-11-29 06:59:23,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:59:23,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:59:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:24,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:59:24,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:59:24,026 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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 06:59:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:24,082 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2023-11-29 06:59:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:59:24,085 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 06:59:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:24,092 INFO L225 Difference]: With dead ends: 46 [2023-11-29 06:59:24,093 INFO L226 Difference]: Without dead ends: 20 [2023-11-29 06:59:24,095 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 06:59:24,099 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:24,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:59:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-29 06:59:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-29 06:59:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 06:59:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-11-29 06:59:24,157 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2023-11-29 06:59:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:24,157 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-11-29 06:59:24,157 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 06:59:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-11-29 06:59:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 06:59:24,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:24,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:24,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:59:24,159 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:24,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash 391783627, now seen corresponding path program 1 times [2023-11-29 06:59:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:24,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716088758] [2023-11-29 06:59:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 06:59:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:24,319 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 06:59:24,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:24,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716088758] [2023-11-29 06:59:24,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716088758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:59:24,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:59:24,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:59:24,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079099087] [2023-11-29 06:59:24,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:59:24,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:59:24,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:24,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:59:24,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:59:24,323 INFO L87 Difference]: Start difference. First operand 20 states and 25 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 06:59:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:24,362 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2023-11-29 06:59:24,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:59:24,363 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 06:59:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:24,364 INFO L225 Difference]: With dead ends: 39 [2023-11-29 06:59:24,364 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 06:59:24,365 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 06:59:24,366 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:24,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:59:24,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 06:59:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-11-29 06:59:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 06:59:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-11-29 06:59:24,374 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2023-11-29 06:59:24,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:24,374 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-11-29 06:59:24,374 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 06:59:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-11-29 06:59:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 06:59:24,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:24,375 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 06:59:24,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:59:24,376 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:24,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:24,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1783597384, now seen corresponding path program 1 times [2023-11-29 06:59:24,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:24,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544308879] [2023-11-29 06:59:24,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:24,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:24,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:59:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:24,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:59:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:24,544 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 06:59:24,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:24,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544308879] [2023-11-29 06:59:24,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544308879] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:59:24,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107039904] [2023-11-29 06:59:24,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:24,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:24,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:59:24,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:59:24,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:59:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:24,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:59:24,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:24,760 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 06:59:24,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:59:24,791 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 06:59:24,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107039904] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:59:24,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:59:24,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-11-29 06:59:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364408076] [2023-11-29 06:59:24,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:59:24,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:59:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:24,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:59:24,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:59:24,794 INFO L87 Difference]: Start difference. First operand 21 states and 26 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 06:59:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:24,841 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-11-29 06:59:24,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:59:24,842 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 06:59:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:24,842 INFO L225 Difference]: With dead ends: 40 [2023-11-29 06:59:24,843 INFO L226 Difference]: Without dead ends: 24 [2023-11-29 06:59:24,843 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 06:59:24,844 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:24,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 49 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:59:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-29 06:59:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-29 06:59:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 06:59:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-29 06:59:24,850 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2023-11-29 06:59:24,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:24,850 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-29 06:59:24,851 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 06:59:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-11-29 06:59:24,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 06:59:24,852 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:24,852 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 06:59:24,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 06:59:25,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:25,053 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:25,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1298850533, now seen corresponding path program 2 times [2023-11-29 06:59:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:25,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144853559] [2023-11-29 06:59:25,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:25,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:59:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:25,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:59:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:25,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 06:59:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 06:59:25,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:25,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144853559] [2023-11-29 06:59:25,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144853559] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:59:25,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671006975] [2023-11-29 06:59:25,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:59:25,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:25,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:59:25,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:59:25,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:59:25,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 06:59:25,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:59:25,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 06:59:25,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:26,135 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 06:59:26,185 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 06:59:26,188 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 06:59:26,189 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:59:26,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671006975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:59:26,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:59:26,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 21 [2023-11-29 06:59:26,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354320430] [2023-11-29 06:59:26,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:59:26,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:59:26,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:26,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:59:26,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2023-11-29 06:59:26,192 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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 06:59:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:26,328 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2023-11-29 06:59:26,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:59:26,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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 25 [2023-11-29 06:59:26,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:26,330 INFO L225 Difference]: With dead ends: 37 [2023-11-29 06:59:26,330 INFO L226 Difference]: Without dead ends: 34 [2023-11-29 06:59:26,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2023-11-29 06:59:26,332 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:26,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 81 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:59:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-29 06:59:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2023-11-29 06:59:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:59:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-11-29 06:59:26,340 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 25 [2023-11-29 06:59:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:26,340 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-29 06:59:26,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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 06:59:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-11-29 06:59:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 06:59:26,342 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:26,342 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 06:59:26,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 06:59:26,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:26,544 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:26,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1298852207, now seen corresponding path program 1 times [2023-11-29 06:59:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:26,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160365496] [2023-11-29 06:59:26,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:27,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:59:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:27,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:59:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:27,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 06:59:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:27,085 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 06:59:27,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:27,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160365496] [2023-11-29 06:59:27,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160365496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:59:27,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:59:27,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 06:59:27,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661711109] [2023-11-29 06:59:27,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:59:27,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:59:27,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:27,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:59:27,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:59:27,088 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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 06:59:27,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:27,294 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-11-29 06:59:27,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:59:27,295 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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 25 [2023-11-29 06:59:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:27,296 INFO L225 Difference]: With dead ends: 34 [2023-11-29 06:59:27,296 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 06:59:27,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:59:27,298 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:27,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 85 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:59:27,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 06:59:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2023-11-29 06:59:27,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:59:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-11-29 06:59:27,304 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 25 [2023-11-29 06:59:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:27,305 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-29 06:59:27,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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 06:59:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-11-29 06:59:27,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 06:59:27,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:27,306 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:59:27,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:59:27,306 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:27,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:27,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1638479424, now seen corresponding path program 1 times [2023-11-29 06:59:27,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:27,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872526817] [2023-11-29 06:59:27,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:27,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:27,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:59:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:27,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:59:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:27,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 06:59:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 06:59:27,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872526817] [2023-11-29 06:59:27,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872526817] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:59:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782650587] [2023-11-29 06:59:27,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:27,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:27,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:59:27,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:59:27,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 06:59:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:27,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 06:59:27,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:27,945 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 06:59:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 06:59:27,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:59:27,995 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 06:59:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 06:59:28,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782650587] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:59:28,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:59:28,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2023-11-29 06:59:28,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639267207] [2023-11-29 06:59:28,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:59:28,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 06:59:28,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:28,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 06:59:28,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-11-29 06:59:28,024 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 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 06:59:32,031 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 06:59:36,042 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 06:59:40,053 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 06:59:44,078 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 06:59:48,107 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 06:59:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:59:48,273 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2023-11-29 06:59:48,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:59:48,274 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 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 27 [2023-11-29 06:59:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:59:48,275 INFO L225 Difference]: With dead ends: 35 [2023-11-29 06:59:48,275 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 06:59:48,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 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 06:59:48,276 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:59:48,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 188 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2023-11-29 06:59:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 06:59:48,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-29 06:59:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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 06:59:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-29 06:59:48,283 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 27 [2023-11-29 06:59:48,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:59:48,283 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-29 06:59:48,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 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 06:59:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-29 06:59:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 06:59:48,285 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:59:48,285 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 06:59:48,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 06:59:48,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 06:59:48,488 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:59:48,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:59:48,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1736900497, now seen corresponding path program 1 times [2023-11-29 06:59:48,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:59:48,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518059155] [2023-11-29 06:59:48,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:48,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:59:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:48,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:59:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:48,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:59:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:48,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 06:59:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:48,848 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 06:59:48,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:59:48,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518059155] [2023-11-29 06:59:48,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518059155] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:59:48,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822365716] [2023-11-29 06:59:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:59:48,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:59:48,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:59:48,850 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:59:48,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 06:59:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:59:49,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 06:59:49,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:59:49,146 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 06:59:49,148 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 06:59:49,148 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:59:49,205 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 06:59:49,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822365716] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:59:49,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:59:49,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 16 [2023-11-29 06:59:49,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179260469] [2023-11-29 06:59:49,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:59:49,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 06:59:49,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:59:49,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 06:59:49,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2023-11-29 06:59:49,208 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 06:59:53,214 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 06:59:57,228 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 07:00:01,251 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 07:00:05,290 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 07:00:09,330 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 07:00:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:00:09,508 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-11-29 07:00:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 07:00:09,509 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2023-11-29 07:00:09,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:00:09,509 INFO L225 Difference]: With dead ends: 34 [2023-11-29 07:00:09,510 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 07:00:09,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2023-11-29 07:00:09,511 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:00:09,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 202 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2023-11-29 07:00:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 07:00:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-11-29 07:00:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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 07:00:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-11-29 07:00:09,517 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 28 [2023-11-29 07:00:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:00:09,518 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-11-29 07:00:09,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 07:00:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-11-29 07:00:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 07:00:09,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:00:09,519 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 07:00:09,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 07:00:09,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:00:09,724 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:00:09,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1736898823, now seen corresponding path program 1 times [2023-11-29 07:00:09,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:09,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006091051] [2023-11-29 07:00:09,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:09,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:10,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:00:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:10,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:00:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:10,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 07:00:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 07:00:10,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:10,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006091051] [2023-11-29 07:00:10,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006091051] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:10,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001919113] [2023-11-29 07:00:10,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:10,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:00:10,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:00:10,664 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:00:10,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 07:00:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:10,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-29 07:00:10,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:00:10,956 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 07:00:10,965 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 07:00:11,026 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 07:00:11,157 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 07:00:11,160 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 07:00:11,250 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= 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|)))))) is different from true [2023-11-29 07:00:11,279 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 07:00:11,279 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 07:00:11,286 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 07:00:11,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:00:11,475 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 07:00:11,540 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 07:00:11,600 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 07:00:11,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:00:11,618 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (v_ArrVal_857 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_857) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_857 (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_857 .cse0))))))) is different from false [2023-11-29 07:00:11,755 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (v_ArrVal_857 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_20| Int)) (or (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_20| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_857) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_857 (let ((.cse0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_20| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_857 .cse0))))))) is different from false [2023-11-29 07:00:11,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001919113] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:11,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:00:11,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2023-11-29 07:00:11,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951726492] [2023-11-29 07:00:11,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:00:11,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 07:00:11,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:11,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 07:00:11,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=718, Unknown=14, NotChecked=168, Total=992 [2023-11-29 07:00:11,876 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 07:00:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:00:12,445 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-11-29 07:00:12,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 07:00:12,445 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-11-29 07:00:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:00:12,446 INFO L225 Difference]: With dead ends: 41 [2023-11-29 07:00:12,446 INFO L226 Difference]: Without dead ends: 39 [2023-11-29 07:00:12,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=1324, Unknown=14, NotChecked=228, Total=1722 [2023-11-29 07:00:12,448 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:00:12,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 124 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 323 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2023-11-29 07:00:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-29 07:00:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2023-11-29 07:00:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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 07:00:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2023-11-29 07:00:12,456 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2023-11-29 07:00:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:00:12,456 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2023-11-29 07:00:12,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 07:00:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2023-11-29 07:00:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 07:00:12,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:00:12,457 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 07:00:12,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 07:00:12,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:00:12,658 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:00:12,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:12,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1582542026, now seen corresponding path program 1 times [2023-11-29 07:00:12,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:12,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086268873] [2023-11-29 07:00:12,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:12,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:13,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:00:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:13,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:00:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:13,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 07:00:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 07:00:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086268873] [2023-11-29 07:00:13,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086268873] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628484547] [2023-11-29 07:00:13,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:13,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:00:13,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:00:13,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:00:13,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 07:00:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:13,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-29 07:00:13,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:00:13,680 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 07:00:13,742 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 07:00:13,807 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 07:00:13,810 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 07:00:13,841 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 07:00:13,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:00:13,850 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 07:00:13,870 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 07:00:13,871 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 07:00:13,981 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2023-11-29 07:00:13,982 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 07:00:13,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2023-11-29 07:00:13,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2023-11-29 07:00:14,017 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 07:00:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-29 07:00:14,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:00:14,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628484547] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:14,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:00:14,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 30 [2023-11-29 07:00:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964735989] [2023-11-29 07:00:14,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:00:14,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 07:00:14,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:14,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 07:00:14,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=903, Unknown=5, NotChecked=60, Total=1056 [2023-11-29 07:00:14,299 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 30 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 25 states have internal predecessors, (41), 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 07:00:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:00:14,815 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2023-11-29 07:00:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 07:00:14,815 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 25 states have internal predecessors, (41), 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 30 [2023-11-29 07:00:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:00:14,817 INFO L225 Difference]: With dead ends: 47 [2023-11-29 07:00:14,817 INFO L226 Difference]: Without dead ends: 38 [2023-11-29 07:00:14,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=157, Invalid=1648, Unknown=5, NotChecked=82, Total=1892 [2023-11-29 07:00:14,818 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:00:14,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 279 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2023-11-29 07:00:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-29 07:00:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-11-29 07:00:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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 07:00:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-11-29 07:00:14,826 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 30 [2023-11-29 07:00:14,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:00:14,826 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-11-29 07:00:14,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 25 states have internal predecessors, (41), 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 07:00:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-11-29 07:00:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 07:00:14,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:00:14,828 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 07:00:14,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 07:00:15,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:00:15,028 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:00:15,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:15,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1135989524, now seen corresponding path program 1 times [2023-11-29 07:00:15,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:15,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817433563] [2023-11-29 07:00:15,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:15,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:15,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:00:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:15,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:00:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:16,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 07:00:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:16,246 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 07:00:16,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:16,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817433563] [2023-11-29 07:00:16,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817433563] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:16,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040021546] [2023-11-29 07:00:16,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:16,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:00:16,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:00:16,248 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:00:16,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 07:00:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:16,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 105 conjunts are in the unsatisfiable core [2023-11-29 07:00:16,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:00:16,581 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 07:00:16,727 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 07:00:16,797 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 07:00:16,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 17 treesize of output 21 [2023-11-29 07:00:16,874 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 07:00:16,881 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 07:00:17,056 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 07:00:17,061 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 07:00:17,069 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 07:00:17,180 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)) (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|))) (= |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 07:00:17,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:00:17,210 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 38 treesize of output 27 [2023-11-29 07:00:17,230 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 07:00:17,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 07:00:17,236 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 07:00:17,421 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 07:00:17,516 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 07:00:17,577 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 07:00:17,651 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 07:00:17,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:00:17,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040021546] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:17,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:00:17,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2023-11-29 07:00:17,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187345986] [2023-11-29 07:00:17,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:00:17,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 07:00:17,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:17,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 07:00:17,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1506, Unknown=1, NotChecked=78, Total=1722 [2023-11-29 07:00:17,932 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 39 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 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 07:00:18,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:00:18,903 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2023-11-29 07:00:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 07:00:18,904 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 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 30 [2023-11-29 07:00:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:00:18,905 INFO L225 Difference]: With dead ends: 48 [2023-11-29 07:00:18,905 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 07:00:18,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=250, Invalid=2509, Unknown=1, NotChecked=102, Total=2862 [2023-11-29 07:00:18,906 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:00:18,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 206 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 543 Invalid, 0 Unknown, 48 Unchecked, 0.4s Time] [2023-11-29 07:00:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 07:00:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2023-11-29 07:00:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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 07:00:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-11-29 07:00:18,913 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 30 [2023-11-29 07:00:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:00:18,913 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-11-29 07:00:18,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 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 07:00:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-11-29 07:00:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 07:00:18,914 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:00:18,914 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] [2023-11-29 07:00:18,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 07:00:19,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 07:00:19,115 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:00:19,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash 764273839, now seen corresponding path program 1 times [2023-11-29 07:00:19,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:19,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210166022] [2023-11-29 07:00:19,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:19,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:20,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:00:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:20,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:00:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:21,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 07:00:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:00:21,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:21,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210166022] [2023-11-29 07:00:21,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210166022] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:21,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105094816] [2023-11-29 07:00:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:21,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:00:21,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:00:21,511 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:00:21,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 07:00:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:21,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 142 conjunts are in the unsatisfiable core [2023-11-29 07:00:21,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:00:21,800 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 07:00:21,851 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 07:00:21,960 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 07:00:22,183 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 07:00:22,183 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 07:00:22,194 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 07:00:22,285 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 07:00:22,295 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 07:00:22,310 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 07:00:22,544 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 57 treesize of output 25 [2023-11-29 07:00:22,550 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 07:00:22,555 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 07:00:22,560 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 07:00:22,729 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_$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|))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0))) is different from true [2023-11-29 07:00:22,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:00:22,749 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 65 treesize of output 42 [2023-11-29 07:00:22,768 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 07:00:22,768 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 07:00:22,774 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 07:00:22,778 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 24 treesize of output 19 [2023-11-29 07:00:23,523 INFO L349 Elim1Store]: treesize reduction 45, result has 35.7 percent of original size [2023-11-29 07:00:23,524 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 72 treesize of output 47 [2023-11-29 07:00:23,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:00:23,534 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 35 treesize of output 19 [2023-11-29 07:00:23,550 INFO L349 Elim1Store]: treesize reduction 43, result has 20.4 percent of original size [2023-11-29 07:00:23,551 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 15 [2023-11-29 07:00:23,680 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 62 treesize of output 38 [2023-11-29 07:00:23,768 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 35 treesize of output 19 [2023-11-29 07:00:23,774 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 07:00:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 07:00:23,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:00:24,042 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 Int) (v_ArrVal_1347 (Array Int Int)) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1347) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_1350)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 |ULTIMATE.start_sll_append_~new_last~0#1.offset|)) .cse1) .cse2)))) (not (= v_ArrVal_1347 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1347 .cse0))))))) is different from false [2023-11-29 07:00:25,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105094816] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:25,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:00:25,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2023-11-29 07:00:25,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153329890] [2023-11-29 07:00:25,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:00:25,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-29 07:00:25,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:25,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-29 07:00:25,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3006, Unknown=2, NotChecked=222, Total=3422 [2023-11-29 07:00:25,156 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 51 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 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 07:00:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:00:27,786 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2023-11-29 07:00:27,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 07:00:27,786 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 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 07:00:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:00:27,787 INFO L225 Difference]: With dead ends: 49 [2023-11-29 07:00:27,787 INFO L226 Difference]: Without dead ends: 47 [2023-11-29 07:00:27,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=450, Invalid=5718, Unknown=2, NotChecked=310, Total=6480 [2023-11-29 07:00:27,789 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 59 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 07:00:27,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 318 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 963 Invalid, 0 Unknown, 50 Unchecked, 0.8s Time] [2023-11-29 07:00:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-29 07:00:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2023-11-29 07:00:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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 07:00:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2023-11-29 07:00:27,797 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2023-11-29 07:00:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:00:27,797 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2023-11-29 07:00:27,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 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 07:00:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2023-11-29 07:00:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 07:00:27,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:00:27,798 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] [2023-11-29 07:00:27,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 07:00:27,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 07:00:27,998 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:00:27,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:27,999 INFO L85 PathProgramCache]: Analyzing trace with hash 317719663, now seen corresponding path program 2 times [2023-11-29 07:00:27,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:27,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071943581] [2023-11-29 07:00:27,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:29,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:00:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:29,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:00:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:29,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 07:00:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:00:29,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:29,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071943581] [2023-11-29 07:00:29,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071943581] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:29,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794612185] [2023-11-29 07:00:29,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:00:29,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:00:29,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:00:29,850 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:00:29,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 07:00:30,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:00:30,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:00:30,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 136 conjunts are in the unsatisfiable core [2023-11-29 07:00:30,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:00:30,098 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 07:00:30,185 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 07:00:30,358 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 07:00:30,443 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 07:00:30,443 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 07:00:30,455 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 07:00:30,538 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 07:00:30,546 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 07:00:30,556 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 07:00:30,786 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 07:00:30,786 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 07:00:30,792 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 07:00:30,797 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 07:00:30,802 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 07:00:30,948 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (not (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))) (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 07:00:30,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:00:31,007 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 07:00:31,008 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 07:00:31,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:00:31,033 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 07:00:31,034 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 07:00:31,041 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 07:00:31,046 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 07:00:31,309 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 07:00:31,433 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 07:00:31,433 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 07:00:31,553 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 07:00:31,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:00:31,637 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 07:00:31,647 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 07:00:31,647 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 07:00:31,734 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 07:00:31,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:00:32,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794612185] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:32,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:00:32,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2023-11-29 07:00:32,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878315] [2023-11-29 07:00:32,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:00:32,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-29 07:00:32,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:32,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-29 07:00:32,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1917, Unknown=1, NotChecked=88, Total=2162 [2023-11-29 07:00:32,160 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 43 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 34 states have internal predecessors, (50), 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 07:00:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:00:34,418 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2023-11-29 07:00:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 07:00:34,418 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 34 states have internal predecessors, (50), 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 32 [2023-11-29 07:00:34,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:00:34,419 INFO L225 Difference]: With dead ends: 79 [2023-11-29 07:00:34,419 INFO L226 Difference]: Without dead ends: 77 [2023-11-29 07:00:34,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=283, Invalid=3142, Unknown=1, NotChecked=114, Total=3540 [2023-11-29 07:00:34,421 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 07:00:34,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 296 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 810 Invalid, 0 Unknown, 66 Unchecked, 0.8s Time] [2023-11-29 07:00:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-29 07:00:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2023-11-29 07:00:34,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 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 07:00:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2023-11-29 07:00:34,433 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 32 [2023-11-29 07:00:34,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:00:34,433 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2023-11-29 07:00:34,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 34 states have internal predecessors, (50), 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 07:00:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2023-11-29 07:00:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 07:00:34,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:00:34,434 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] [2023-11-29 07:00:34,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 07:00:34,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:00:34,635 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:00:34,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:34,635 INFO L85 PathProgramCache]: Analyzing trace with hash 27784448, now seen corresponding path program 1 times [2023-11-29 07:00:34,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:34,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555968768] [2023-11-29 07:00:34,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:34,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:36,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:00:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:36,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:00:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:36,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 07:00:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:00:36,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:36,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555968768] [2023-11-29 07:00:36,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555968768] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:36,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101206595] [2023-11-29 07:00:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:36,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:00:36,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:00:36,412 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:00:36,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 07:00:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:36,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 128 conjunts are in the unsatisfiable core [2023-11-29 07:00:36,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:00:36,683 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 07:00:36,880 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 07:00:36,880 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 07:00:36,939 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 07:00:36,949 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 07:00:37,091 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 07:00:37,095 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 07:00:37,098 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 07:00:37,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:00:37,339 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 07:00:37,355 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 07:00:37,355 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 07:00:37,375 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 07:00:37,870 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-29 07:00:37,870 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 07:00:37,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:00:37,880 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 07:00:37,975 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 07:00:38,045 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 07:00:38,202 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:00:38,202 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 07:00:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:00:38,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:00:39,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101206595] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:39,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:00:39,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 47 [2023-11-29 07:00:39,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62846019] [2023-11-29 07:00:39,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:00:39,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-29 07:00:39,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:39,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-29 07:00:39,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2802, Unknown=5, NotChecked=0, Total=2970 [2023-11-29 07:00:39,017 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 47 states, 40 states have (on average 1.275) internal successors, (51), 38 states have internal predecessors, (51), 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 07:00:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:00:41,443 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2023-11-29 07:00:41,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 07:00:41,444 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 40 states have (on average 1.275) internal successors, (51), 38 states have internal predecessors, (51), 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 07:00:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:00:41,444 INFO L225 Difference]: With dead ends: 72 [2023-11-29 07:00:41,444 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 07:00:41,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=382, Invalid=5163, Unknown=5, NotChecked=0, Total=5550 [2023-11-29 07:00:41,447 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 75 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 07:00:41,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 333 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 07:00:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 07:00:41,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2023-11-29 07:00:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 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 07:00:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2023-11-29 07:00:41,460 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 34 [2023-11-29 07:00:41,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:00:41,461 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2023-11-29 07:00:41,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 40 states have (on average 1.275) internal successors, (51), 38 states have internal predecessors, (51), 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 07:00:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2023-11-29 07:00:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 07:00:41,461 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:00:41,462 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:00:41,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 07:00:41,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 07:00:41,662 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:00:41,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash 27786122, now seen corresponding path program 2 times [2023-11-29 07:00:41,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:41,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054004501] [2023-11-29 07:00:41,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:41,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:00:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:43,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:00:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 07:00:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:00:43,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:43,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054004501] [2023-11-29 07:00:43,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054004501] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:43,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388699778] [2023-11-29 07:00:43,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:00:43,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:00:43,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:00:43,300 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:00:43,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 07:00:43,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:00:43,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:00:43,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 147 conjunts are in the unsatisfiable core [2023-11-29 07:00:43,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:00:43,522 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 07:00:43,670 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 07:00:43,674 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 07:00:43,895 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 07:00:43,896 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 07:00:43,914 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 07:00:43,915 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 07:00:43,937 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 07:00:43,937 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 07:00:44,025 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 07:00:44,033 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 07:00:44,244 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-11-29 07:00:44,245 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 07:00:44,250 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 07:00:44,254 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 07:00:44,331 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 07:00:44,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:00:44,416 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 07:00:44,417 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 110 treesize of output 87 [2023-11-29 07:00:44,434 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-11-29 07:00:44,435 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 34 treesize of output 36 [2023-11-29 07:00:44,449 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 47 treesize of output 45 [2023-11-29 07:00:45,058 INFO L349 Elim1Store]: treesize reduction 130, result has 20.2 percent of original size [2023-11-29 07:00:45,059 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 135 treesize of output 71 [2023-11-29 07:00:45,089 INFO L349 Elim1Store]: treesize reduction 116, result has 25.2 percent of original size [2023-11-29 07:00:45,090 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 2 case distinctions, treesize of input 52 treesize of output 54 [2023-11-29 07:00:45,110 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2023-11-29 07:00:45,110 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 1 case distinctions, treesize of input 22 treesize of output 27 [2023-11-29 07:00:45,386 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 358 treesize of output 290 [2023-11-29 07:00:45,399 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 294 treesize of output 242 [2023-11-29 07:00:46,911 INFO L349 Elim1Store]: treesize reduction 60, result has 85.3 percent of original size [2023-11-29 07:00:46,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 368 treesize of output 523 [2023-11-29 07:00:47,397 INFO L349 Elim1Store]: treesize reduction 60, result has 85.3 percent of original size [2023-11-29 07:00:47,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 170 treesize of output 472 [2023-11-29 07:05:25,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 07:05:25,360 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 07:05:25,361 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 07:05:25,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 07:05:25,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:05:25,562 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-11-29 07:05:25,565 INFO L158 Benchmark]: Toolchain (without parser) took 362743.59ms. Allocated memory was 146.8MB in the beginning and 446.7MB in the end (delta: 299.9MB). Free memory was 106.2MB in the beginning and 354.0MB in the end (delta: -247.7MB). Peak memory consumption was 277.8MB. Max. memory is 16.1GB. [2023-11-29 07:05:25,565 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:05:25,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.86ms. Allocated memory is still 146.8MB. Free memory was 106.2MB in the beginning and 88.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 07:05:25,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.55ms. Allocated memory is still 146.8MB. Free memory was 88.7MB in the beginning and 86.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:05:25,566 INFO L158 Benchmark]: Boogie Preprocessor took 52.52ms. Allocated memory is still 146.8MB. Free memory was 86.6MB in the beginning and 83.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 07:05:25,566 INFO L158 Benchmark]: RCFGBuilder took 374.40ms. Allocated memory is still 146.8MB. Free memory was 83.2MB in the beginning and 65.6MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 07:05:25,567 INFO L158 Benchmark]: TraceAbstraction took 361877.66ms. Allocated memory was 146.8MB in the beginning and 446.7MB in the end (delta: 299.9MB). Free memory was 64.9MB in the beginning and 354.0MB in the end (delta: -289.0MB). Peak memory consumption was 235.9MB. Max. memory is 16.1GB. [2023-11-29 07:05:25,568 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.16ms. Allocated memory is still 109.1MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.86ms. Allocated memory is still 146.8MB. Free memory was 106.2MB in the beginning and 88.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.55ms. Allocated memory is still 146.8MB. Free memory was 88.7MB in the beginning and 86.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.52ms. Allocated memory is still 146.8MB. Free memory was 86.6MB in the beginning and 83.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 374.40ms. Allocated memory is still 146.8MB. Free memory was 83.2MB in the beginning and 65.6MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 361877.66ms. Allocated memory was 146.8MB in the beginning and 446.7MB in the end (delta: 299.9MB). Free memory was 64.9MB in the beginning and 354.0MB in the end (delta: -289.0MB). Peak memory consumption was 235.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:05:27,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:05:27,356 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 07:05:27,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:05:27,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:05:27,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:05:27,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:05:27,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:05:27,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:05:27,386 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:05:27,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:05:27,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:05:27,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:05:27,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:05:27,389 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:05:27,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:05:27,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:05:27,391 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:05:27,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:05:27,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:05:27,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:05:27,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:05:27,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:05:27,394 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 07:05:27,394 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 07:05:27,394 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 07:05:27,395 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:05:27,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:05:27,395 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:05:27,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:05:27,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:05:27,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:05:27,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:05:27,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:05:27,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:05:27,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:05:27,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:05:27,398 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 07:05:27,398 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 07:05:27,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:05:27,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:05:27,399 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:05:27,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:05:27,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:05:27,399 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 07:05:27,400 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_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2023-11-29 07:05:27,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:05:27,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:05:27,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:05:27,727 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:05:27,728 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:05:27,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-11-29 07:05:30,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:05:30,701 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:05:30,701 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-11-29 07:05:30,716 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/data/a0259feb2/811eb29927674f31a15d0a9211a5709d/FLAG6d576aad5 [2023-11-29 07:05:30,727 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/data/a0259feb2/811eb29927674f31a15d0a9211a5709d [2023-11-29 07:05:30,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:05:30,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:05:30,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:05:30,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:05:30,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:05:30,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:05:30" (1/1) ... [2023-11-29 07:05:30,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dab10a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:30, skipping insertion in model container [2023-11-29 07:05:30,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:05:30" (1/1) ... [2023-11-29 07:05:30,778 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:05:31,028 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_c49c8e6b-b211-42d3-8076-cd0bf368fda5/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2023-11-29 07:05:31,032 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:05:31,043 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:05:31,109 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_c49c8e6b-b211-42d3-8076-cd0bf368fda5/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2023-11-29 07:05:31,112 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:05:31,151 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:05:31,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:31 WrapperNode [2023-11-29 07:05:31,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:05:31,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:05:31,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:05:31,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:05:31,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:31" (1/1) ... [2023-11-29 07:05:31,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:31" (1/1) ... [2023-11-29 07:05:31,203 INFO L138 Inliner]: procedures = 130, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2023-11-29 07:05:31,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:05:31,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:05:31,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:05:31,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:05:31,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:31" (1/1) ... [2023-11-29 07:05:31,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:31" (1/1) ... [2023-11-29 07:05:31,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:31" (1/1) ... [2023-11-29 07:05:31,236 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 6, 9]. 53 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 07:05:31,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:31" (1/1) ... [2023-11-29 07:05:31,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:31" (1/1) ... [2023-11-29 07:05:31,250 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:31" (1/1) ... [2023-11-29 07:05:31,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:31" (1/1) ... [2023-11-29 07:05:31,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:31" (1/1) ... [2023-11-29 07:05:31,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:31" (1/1) ... [2023-11-29 07:05:31,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:05:31,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:05:31,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:05:31,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:05:31,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:31" (1/1) ... [2023-11-29 07:05:31,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:05:31,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:05:31,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:05:31,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:05:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 07:05:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 07:05:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 07:05:31,337 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 07:05:31,337 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 07:05:31,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 07:05:31,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:05:31,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 07:05:31,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 07:05:31,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 07:05:31,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 07:05:31,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 07:05:31,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 07:05:31,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 07:05:31,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 07:05:31,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 07:05:31,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 07:05:31,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 07:05:31,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 07:05:31,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 07:05:31,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 07:05:31,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 07:05:31,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 07:05:31,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 07:05:31,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:05:31,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:05:31,478 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:05:31,480 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:05:31,697 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:05:31,734 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:05:31,734 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 07:05:31,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:05:31 BoogieIcfgContainer [2023-11-29 07:05:31,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:05:31,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:05:31,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:05:31,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:05:31,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:05:30" (1/3) ... [2023-11-29 07:05:31,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f14efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:05:31, skipping insertion in model container [2023-11-29 07:05:31,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:31" (2/3) ... [2023-11-29 07:05:31,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f14efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:05:31, skipping insertion in model container [2023-11-29 07:05:31,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:05:31" (3/3) ... [2023-11-29 07:05:31,765 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-11-29 07:05:31,779 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:05:31,779 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 07:05:31,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:05:31,822 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;@735444b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:05:31,822 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 07:05:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 07:05:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 07:05:31,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:31,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:31,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:31,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1424445379, now seen corresponding path program 1 times [2023-11-29 07:05:31,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:05:31,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811613918] [2023-11-29 07:05:31,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:31,849 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 07:05:31,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:05:31,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:31,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 07:05:31,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:05:32,009 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 07:05:32,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:05:32,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:05:32,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811613918] [2023-11-29 07:05:32,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811613918] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:32,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:32,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:05:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829147058] [2023-11-29 07:05:32,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:32,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 07:05:32,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:05:32,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 07:05:32,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:05:32,041 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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 07:05:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:32,091 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2023-11-29 07:05:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 07:05:32,093 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 07:05:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:32,099 INFO L225 Difference]: With dead ends: 46 [2023-11-29 07:05:32,100 INFO L226 Difference]: Without dead ends: 20 [2023-11-29 07:05:32,103 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 07:05:32,106 INFO L413 NwaCegarLoop]: 27 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, 27 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 07:05:32,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:05:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-29 07:05:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-29 07:05:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 07:05:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-11-29 07:05:32,133 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2023-11-29 07:05:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:32,134 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-11-29 07:05:32,134 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 07:05:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-11-29 07:05:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 07:05:32,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:32,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:32,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:32,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:32,337 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:32,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash 391783627, now seen corresponding path program 1 times [2023-11-29 07:05:32,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:05:32,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239623735] [2023-11-29 07:05:32,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:32,339 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 07:05:32,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:05:32,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:32,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:32,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 07:05:32,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:05:32,531 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 07:05:32,531 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:05:32,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:05:32,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239623735] [2023-11-29 07:05:32,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239623735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:32,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:32,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:05:32,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484162608] [2023-11-29 07:05:32,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:32,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:05:32,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:05:32,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:05:32,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:05:32,535 INFO L87 Difference]: Start difference. First operand 20 states and 25 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 07:05:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:32,594 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2023-11-29 07:05:32,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:05:32,595 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 07:05:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:32,596 INFO L225 Difference]: With dead ends: 39 [2023-11-29 07:05:32,596 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 07:05:32,597 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 07:05:32,599 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 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 07:05:32,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:05:32,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 07:05:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-11-29 07:05:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 07:05:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-11-29 07:05:32,607 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2023-11-29 07:05:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:32,607 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-11-29 07:05:32,607 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 07:05:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-11-29 07:05:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 07:05:32,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:32,609 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 07:05:32,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:32,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:32,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:32,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:32,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1783597384, now seen corresponding path program 1 times [2023-11-29 07:05:32,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:05:32,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072243024] [2023-11-29 07:05:32,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:32,813 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 07:05:32,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:05:32,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:32,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:32,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 07:05:32,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:05:32,997 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 07:05:32,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:05:33,045 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 07:05:33,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:05:33,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072243024] [2023-11-29 07:05:33,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072243024] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:05:33,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:05:33,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-11-29 07:05:33,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226569192] [2023-11-29 07:05:33,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:05:33,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:05:33,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:05:33,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:05:33,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:05:33,050 INFO L87 Difference]: Start difference. First operand 21 states and 26 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 07:05:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:33,168 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-11-29 07:05:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:05:33,169 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 07:05:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:33,170 INFO L225 Difference]: With dead ends: 42 [2023-11-29 07:05:33,170 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 07:05:33,171 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 07:05:33,172 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:33,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:05:33,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 07:05:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-29 07:05:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 07:05:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-29 07:05:33,180 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2023-11-29 07:05:33,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:33,180 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-29 07:05:33,180 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 07:05:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-11-29 07:05:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 07:05:33,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:33,182 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 07:05:33,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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)] Ended with exit code 0 [2023-11-29 07:05:33,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:33,382 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:33,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1298850533, now seen corresponding path program 2 times [2023-11-29 07:05:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:05:33,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381281955] [2023-11-29 07:05:33,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:05:33,384 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 07:05:33,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:05:33,385 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:33,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:33,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 07:05:33,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:05:33,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 07:05:33,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:05:33,657 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 07:05:33,677 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 07:05:33,691 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 07:05:33,691 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:05:33,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:05:33,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381281955] [2023-11-29 07:05:33,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381281955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:33,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:33,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 07:05:33,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438890968] [2023-11-29 07:05:33,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:33,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 07:05:33,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:05:33,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 07:05:33,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:05:33,695 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 07:05:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:33,972 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2023-11-29 07:05:33,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 07:05:33,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 25 [2023-11-29 07:05:33,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:33,973 INFO L225 Difference]: With dead ends: 37 [2023-11-29 07:05:33,973 INFO L226 Difference]: Without dead ends: 34 [2023-11-29 07:05:33,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:05:33,975 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:33,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 108 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:05:33,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-29 07:05:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2023-11-29 07:05:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:05:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-11-29 07:05:33,980 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 25 [2023-11-29 07:05:33,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:33,981 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-29 07:05:33,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 07:05:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-11-29 07:05:33,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 07:05:33,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:33,982 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 07:05:33,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:34,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:34,183 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:34,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1298852207, now seen corresponding path program 1 times [2023-11-29 07:05:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:05:34,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923588301] [2023-11-29 07:05:34,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:34,185 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 07:05:34,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:05:34,186 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:34,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:34,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 07:05:34,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:05:34,491 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 07:05:34,505 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 07:05:34,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:05:34,568 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 07:05:34,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:05:34,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923588301] [2023-11-29 07:05:34,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923588301] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:05:34,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:05:34,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2023-11-29 07:05:34,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060837613] [2023-11-29 07:05:34,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:05:34,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 07:05:34,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:05:34,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 07:05:34,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:05:34,572 INFO L87 Difference]: Start difference. First operand 26 states and 32 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 07:05:38,582 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 07:05:42,635 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 07:05:46,686 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 07:05:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:46,879 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2023-11-29 07:05:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 07:05:46,880 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 07:05:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:46,881 INFO L225 Difference]: With dead ends: 34 [2023-11-29 07:05:46,881 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 07:05:46,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-11-29 07:05:46,883 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:46,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 136 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2023-11-29 07:05:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 07:05:46,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-29 07:05:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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 07:05:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-29 07:05:46,889 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 25 [2023-11-29 07:05:46,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:46,890 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-29 07:05:46,890 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 07:05:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-29 07:05:46,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 07:05:46,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:46,891 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 07:05:46,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:47,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:47,095 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:47,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1736900497, now seen corresponding path program 1 times [2023-11-29 07:05:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:05:47,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315864660] [2023-11-29 07:05:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:47,097 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 07:05:47,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:05:47,098 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:47,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:47,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 07:05:47,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:05:47,402 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 07:05:47,417 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 07:05:47,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:05:47,484 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 07:05:47,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:05:47,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315864660] [2023-11-29 07:05:47,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315864660] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:05:47,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:05:47,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2023-11-29 07:05:47,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712525993] [2023-11-29 07:05:47,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:05:47,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 07:05:47,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:05:47,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 07:05:47,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:05:47,487 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 07:05:51,566 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 07:05:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:51,867 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-11-29 07:05:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 07:05:51,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 28 [2023-11-29 07:05:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:51,869 INFO L225 Difference]: With dead ends: 34 [2023-11-29 07:05:51,869 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 07:05:51,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 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 07:05:51,871 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 17 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:51,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 122 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2023-11-29 07:05:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 07:05:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-11-29 07:05:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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 07:05:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-11-29 07:05:51,878 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 28 [2023-11-29 07:05:51,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:51,878 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-11-29 07:05:51,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 07:05:51,879 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-11-29 07:05:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 07:05:51,879 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:51,880 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 07:05:51,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:52,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:52,084 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:52,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:52,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1736898823, now seen corresponding path program 1 times [2023-11-29 07:05:52,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:05:52,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452816779] [2023-11-29 07:05:52,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:52,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 07:05:52,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:05:52,086 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:05:52,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 (8)] Waiting until timeout for monitored process [2023-11-29 07:05:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:52,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 07:05:52,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:05:52,333 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 07:05:52,444 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 07:05:52,560 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 07:05:52,566 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 07:05:52,691 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|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_4|) (_ bv0 32)))) is different from true [2023-11-29 07:05:52,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:05:52,721 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 07:05:52,748 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 07:05:52,749 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 07:05:52,843 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 07:05:52,907 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 07:05:52,937 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 07:05:52,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:05:57,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:05:57,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452816779] [2023-11-29 07:05:57,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452816779] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:05:57,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1916643545] [2023-11-29 07:05:57,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:57,245 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:05:57,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:05:57,246 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:05:57,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-11-29 07:05:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:57,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 07:05:57,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:05:57,589 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 07:05:57,654 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 07:05:57,811 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 07:05:58,054 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 07:05:58,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 11 treesize of output 3 [2023-11-29 07:05:58,214 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) (_ 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 07:05:58,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:05:58,244 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 07:05:58,259 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 07:05:58,259 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 07:05:58,654 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 07:05:58,779 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 07:05:58,940 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 07:05:58,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:05:59,586 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_40| (_ BitVec 32)) (v_ArrVal_375 (_ BitVec 32))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_40|) (_ bv0 1))) (= (select (select (let ((.cse0 (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_40| v_ArrVal_379)) (.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_375))) (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 07:05:59,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1916643545] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:05:59,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:05:59,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2023-11-29 07:05:59,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686410540] [2023-11-29 07:05:59,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:05:59,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 07:05:59,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:05:59,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 07:05:59,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1229, Unknown=15, NotChecked=216, Total=1560 [2023-11-29 07:05:59,592 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 31 states, 24 states have (on average 1.75) internal successors, (42), 26 states have internal predecessors, (42), 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 07:06:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:02,039 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2023-11-29 07:06:02,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 07:06:02,039 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 24 states have (on average 1.75) internal successors, (42), 26 states have internal predecessors, (42), 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 28 [2023-11-29 07:06:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:02,041 INFO L225 Difference]: With dead ends: 39 [2023-11-29 07:06:02,041 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 07:06:02,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=209, Invalid=2238, Unknown=15, NotChecked=294, Total=2756 [2023-11-29 07:06:02,043 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:02,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 291 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 446 Invalid, 0 Unknown, 68 Unchecked, 1.3s Time] [2023-11-29 07:06:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 07:06:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2023-11-29 07:06:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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 07:06:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-29 07:06:02,052 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 28 [2023-11-29 07:06:02,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:02,052 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-29 07:06:02,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 24 states have (on average 1.75) internal successors, (42), 26 states have internal predecessors, (42), 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 07:06:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-29 07:06:02,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 07:06:02,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:02,053 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 07:06:02,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 (8)] Ended with exit code 0 [2023-11-29 07:06:02,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-11-29 07:06:02,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 07:06:02,454 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:06:02,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:02,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1135989524, now seen corresponding path program 1 times [2023-11-29 07:06:02,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:06:02,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744140218] [2023-11-29 07:06:02,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:02,455 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 07:06:02,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:06:02,456 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:06:02,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 (10)] Waiting until timeout for monitored process [2023-11-29 07:06:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:02,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 07:06:02,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:02,731 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 07:06:02,772 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 07:06:02,851 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 07:06:02,858 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 07:06:02,999 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 07:06:03,006 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 07:06:03,011 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 07:06:05,416 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 07:06:05,416 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 07:06:05,424 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 07:06:05,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 20 treesize of output 15 [2023-11-29 07:06:05,830 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 07:06:06,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:06:06,001 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 07:06:12,731 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 07:06:12,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:06:12,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2023-11-29 07:06:12,968 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 07:06:12,969 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 07:06:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 07:06:13,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:14,420 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_445 (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_445) (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 07:06:14,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:06:14,714 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 07:06:14,756 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 (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| (_ bv0 32) v_ArrVal_445) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|)) (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_1 (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_1) (= (select (select (store |c_#memory_int#2| v_arrayElimIndex_1 v_ArrVal_445) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|))) (or (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_1 (_ BitVec 32))) (= (select (select (store |c_#memory_int#2| v_arrayElimIndex_1 v_ArrVal_445) .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|)))))) is different from false [2023-11-29 07:06:14,833 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (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 (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| (_ bv0 32) v_ArrVal_445) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|)) (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_1 (_ BitVec 32))) (or (= (select (select (store |c_#memory_int#2| v_arrayElimIndex_1 v_ArrVal_445) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|) (= v_arrayElimIndex_1 .cse2))) (or (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (= .cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse2) (bvadd (_ bv4 32) .cse3)))) (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_1 (_ BitVec 32))) (= (select (select (store |c_#memory_int#2| v_arrayElimIndex_1 v_ArrVal_445) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2023-11-29 07:06:15,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:06:15,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744140218] [2023-11-29 07:06:15,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744140218] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:15,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1431541046] [2023-11-29 07:06:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:15,761 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:06:15,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:06:15,762 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:06:15,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-11-29 07:06:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:16,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 07:06:16,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:16,478 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 07:06:16,499 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 07:06:16,717 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 07:06:16,738 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 07:06:17,176 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 07:06:17,183 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 07:06:17,189 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 07:06:23,664 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 07:06:23,664 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 07:06:23,674 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 07:06:23,683 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 07:06:24,411 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 07:06:25,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:06:25,148 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 07:06:25,725 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 07:06:26,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:06:26,450 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 07:06:26,465 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 07:06:26,466 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 07:06:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 07:06:26,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:26,511 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (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_517) (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 07:06:26,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:06:26,868 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 07:06:26,909 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 (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_2 (_ BitVec 32))) (or (= (select (select (store |c_#memory_int#2| v_arrayElimIndex_2 v_ArrVal_445) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| v_arrayElimIndex_2))) (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| (_ bv0 32) v_ArrVal_445) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|)) (or (= |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_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_2 (_ BitVec 32))) (= (select (select (store |c_#memory_int#2| v_arrayElimIndex_2 v_ArrVal_445) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2023-11-29 07:06:26,959 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 (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#2| (_ bv0 32) v_ArrVal_445) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|)) (or (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_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_2 (_ BitVec 32))) (= (select (select (store |c_#memory_int#2| v_arrayElimIndex_2 v_ArrVal_445) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|))) (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_2 (_ BitVec 32))) (or (= v_arrayElimIndex_2 .cse3) (= (select (select (store |c_#memory_int#2| v_arrayElimIndex_2 v_ArrVal_445) .cse0) .cse1) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2023-11-29 07:06:35,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1431541046] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:35,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:06:35,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 38 [2023-11-29 07:06:35,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465370458] [2023-11-29 07:06:35,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:35,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 07:06:35,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:06:35,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 07:06:35,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1877, Unknown=36, NotChecked=558, Total=2652 [2023-11-29 07:06:35,372 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 38 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 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 07:06:44,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 07:06:50,354 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 07:06:52,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 07:07:03,898 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 07:07:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:07:04,745 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2023-11-29 07:07:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 07:07:04,747 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 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 30 [2023-11-29 07:07:04,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:07:04,748 INFO L225 Difference]: With dead ends: 43 [2023-11-29 07:07:04,748 INFO L226 Difference]: Without dead ends: 41 [2023-11-29 07:07:04,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 41.7s TimeCoverageRelationStatistics Valid=290, Invalid=2889, Unknown=37, NotChecked=690, Total=3906 [2023-11-29 07:07:04,750 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2023-11-29 07:07:04,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 189 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 499 Invalid, 6 Unknown, 0 Unchecked, 17.5s Time] [2023-11-29 07:07:04,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-29 07:07:04,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2023-11-29 07:07:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:07:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-11-29 07:07:04,761 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 30 [2023-11-29 07:07:04,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:07:04,761 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-11-29 07:07:04,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 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 07:07:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-11-29 07:07:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 07:07:04,762 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:07:04,762 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 07:07:04,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2023-11-29 07:07:04,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 (10)] Ended with exit code 0 [2023-11-29 07:07:05,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:07:05,163 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:07:05,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:05,163 INFO L85 PathProgramCache]: Analyzing trace with hash 764272165, now seen corresponding path program 1 times [2023-11-29 07:07:05,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:07:05,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835861877] [2023-11-29 07:07:05,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:05,164 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 07:07:05,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:07:05,165 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:07:05,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 (12)] Waiting until timeout for monitored process [2023-11-29 07:07:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:05,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 07:07:05,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:07:05,375 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 07:07:05,651 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:07:05,651 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 07:07:05,770 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 07:07:06,039 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 07:07:06,047 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 07:07:06,237 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_8|) (_ 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 07:07:06,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:07:06,273 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 07:07:06,341 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 07:07:06,341 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 07:07:06,929 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 07:07:06,929 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 07:07:07,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2023-11-29 07:07:07,170 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 07:07:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 07:07:07,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:07:07,592 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_585) (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|)))))) is different from false [2023-11-29 07:07:07,623 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (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_585) (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 07:07:07,993 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_588 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_49|) (_ bv0 1))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_49| v_ArrVal_588))) (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_585)) (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 07:07:07,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:07:07,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835861877] [2023-11-29 07:07:07,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835861877] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:07:07,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [299862623] [2023-11-29 07:07:07,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:07,998 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:07:07,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:07:07,999 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:07:08,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-11-29 07:07:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:08,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-29 07:07:08,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:07:08,709 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 07:07:09,017 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 07:07:09,353 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 07:07:09,359 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 07:07:09,844 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 07:07:09,845 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 07:07:09,856 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 07:07:10,921 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 07:07:11,336 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-11-29 07:07:11,336 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 07:07:11,652 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 47 [2023-11-29 07:07:11,907 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:07:11,908 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 07:07:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 07:07:11,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:07:12,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:07:12,627 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 07:07:42,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [299862623] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:07:42,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:07:42,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 42 [2023-11-29 07:07:42,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137282956] [2023-11-29 07:07:42,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:07:42,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-29 07:07:42,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:07:42,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-29 07:07:42,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2293, Unknown=13, NotChecked=396, Total=2862 [2023-11-29 07:07:42,851 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 42 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 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 07:07:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:07:50,430 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2023-11-29 07:07:50,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 07:07:50,431 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 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 07:07:50,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:07:50,432 INFO L225 Difference]: With dead ends: 56 [2023-11-29 07:07:50,433 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 07:07:50,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=428, Invalid=4831, Unknown=13, NotChecked=580, Total=5852 [2023-11-29 07:07:50,436 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 128 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:07:50,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 371 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 671 Invalid, 0 Unknown, 59 Unchecked, 3.3s Time] [2023-11-29 07:07:50,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 07:07:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2023-11-29 07:07:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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 07:07:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-11-29 07:07:50,453 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 32 [2023-11-29 07:07:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:07:50,454 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-11-29 07:07:50,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 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 07:07:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-11-29 07:07:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 07:07:50,455 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:07:50,455 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] [2023-11-29 07:07:50,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 (12)] Ended with exit code 0 [2023-11-29 07:07:50,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2023-11-29 07:07:50,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 07:07:50,856 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:07:50,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash 764273839, now seen corresponding path program 1 times [2023-11-29 07:07:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:07:50,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695573823] [2023-11-29 07:07:50,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:50,858 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 07:07:50,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:07:50,859 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:07:50,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:07:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:51,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-29 07:07:51,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:07:51,213 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 07:07:51,255 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 07:07:51,369 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 07:07:51,670 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:07:51,670 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 07:07:51,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 07:07:51,829 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 07:07:51,840 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 07:07:51,857 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 07:07:52,202 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 07:07:52,213 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 07:07:52,223 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 07:07:52,233 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 07:07:52,539 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_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_10|) (_ bv0 32)))) is different from true [2023-11-29 07:07:52,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:07:52,584 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 07:07:52,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:07:52,604 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 07:07:52,679 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 07:07:52,679 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 07:07:52,699 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 07:07:53,603 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 07:07:53,604 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 07:07:53,612 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 07:07:53,629 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 07:07:53,786 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 07:07:53,948 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 07:07:53,957 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 07:07:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 07:07:54,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:07:54,933 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (_ BitVec 32)) (v_ArrVal_725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_724)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_725) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_726) .cse0) .cse1))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-11-29 07:07:55,924 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (_ BitVec 32)) (v_ArrVal_725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_726 (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_724)) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_725) .cse3) .cse4)) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_726) .cse3) .cse4)))))) is different from false [2023-11-29 07:07:56,191 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_55| (_ BitVec 32)) (v_ArrVal_724 (_ BitVec 32)) (v_ArrVal_736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_735 (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_55| v_ArrVal_737)) (.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_55| v_ArrVal_735)) (.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_55| v_ArrVal_736))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd (_ bv4 32) (select (select .cse2 .cse3) .cse4)) v_ArrVal_724))) (select (select (store .cse5 .cse1 v_ArrVal_725) .cse6) .cse7)) (select (select (store .cse2 .cse1 v_ArrVal_726) .cse6) .cse7))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_55|) (_ bv0 1))))) is different from false [2023-11-29 07:07:56,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:07:56,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695573823] [2023-11-29 07:07:56,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695573823] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:07:56,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [595964152] [2023-11-29 07:07:56,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:56,208 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:07:56,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:07:56,209 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:07:56,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-11-29 07:07:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 93 conjunts are in the unsatisfiable core [2023-11-29 07:07:56,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:07:56,777 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 07:07:56,804 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 07:07:57,022 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 07:07:57,630 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:07:57,630 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 07:07:57,655 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 07:07:57,898 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 07:07:57,913 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 07:07:57,926 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 07:07:58,548 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 47 treesize of output 23 [2023-11-29 07:07:58,558 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 07:07:58,568 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 07:07:58,576 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 07:07:59,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-29 07:07:59,137 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_11| (_ BitVec 32))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv0 32))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#2| |node_create_~temp~0#1.base|))) (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|))) (= (select .cse0 (_ bv0 32)) |c_node_create_#in~data#1|) (= |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| .cse0)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))))) is different from true [2023-11-29 07:07:59,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:07:59,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 55 treesize of output 38 [2023-11-29 07:07:59,270 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 07:07:59,271 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 07:07:59,292 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 07:07:59,306 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 07:08:02,044 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2023-11-29 07:08:02,044 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 130 treesize of output 85 [2023-11-29 07:08:02,058 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 07:08:02,075 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 62 treesize of output 29 [2023-11-29 07:08:02,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:08:02,506 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 86 treesize of output 58 [2023-11-29 07:08:02,564 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 07:08:02,565 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 07:08:02,917 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 35 treesize of output 19 [2023-11-29 07:08:02,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 07:08:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 07:08:03,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:08:06,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:08:06,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 155 [2023-11-29 07:08:07,432 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (v_ArrVal_811 (_ BitVec 32)) (v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_58| v_ArrVal_822)) (.cse3 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_58| v_ArrVal_823)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse8 (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 ((.cse1 (select (select .cse3 .cse7) .cse8)) (.cse2 (bvadd (_ bv4 32) (select (select .cse6 .cse7) .cse8)))) (or (= (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (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_58| v_arrayElimArr_2))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_811))) (select (select (store .cse3 .cse1 v_ArrVal_812) .cse4) .cse5)) (select (select (store .cse6 .cse1 v_ArrVal_813) .cse4) .cse5))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 32) (select (select .cse3 .cse1) .cse2))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_58|) (_ bv0 1))) (not (= |c_ULTIMATE.start_sll_append_~data#1| (select v_arrayElimArr_2 (_ bv0 32)))))))) is different from false [2023-11-29 07:08:07,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [595964152] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:08:07,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:08:07,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 44 [2023-11-29 07:08:07,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172528553] [2023-11-29 07:08:07,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:08:07,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-29 07:08:07,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:08:07,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-29 07:08:07,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2537, Unknown=43, NotChecked=642, Total=3422 [2023-11-29 07:08:07,448 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 44 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 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 07:08:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:17,489 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2023-11-29 07:08:17,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 07:08:17,490 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 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 32 [2023-11-29 07:08:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:17,491 INFO L225 Difference]: With dead ends: 48 [2023-11-29 07:08:17,491 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 07:08:17,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=375, Invalid=4435, Unknown=44, NotChecked=846, Total=5700 [2023-11-29 07:08:17,495 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:17,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 264 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 799 Invalid, 0 Unknown, 98 Unchecked, 4.6s Time] [2023-11-29 07:08:17,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 07:08:17,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2023-11-29 07:08:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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 07:08:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2023-11-29 07:08:17,511 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2023-11-29 07:08:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:17,511 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2023-11-29 07:08:17,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 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 07:08:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2023-11-29 07:08:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 07:08:17,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:17,513 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] [2023-11-29 07:08:17,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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)] Forceful destruction successful, exit code 0 [2023-11-29 07:08:17,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2023-11-29 07:08:17,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 07:08:17,914 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:08:17,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:17,915 INFO L85 PathProgramCache]: Analyzing trace with hash 317719663, now seen corresponding path program 2 times [2023-11-29 07:08:17,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:08:17,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279177859] [2023-11-29 07:08:17,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:08:17,915 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 07:08:17,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:08:17,917 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:08:17,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:08:18,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:08:18,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:08:18,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 07:08:18,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:08:18,278 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 07:08:18,413 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 07:08:18,424 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 07:08:18,787 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 07:08:18,788 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 07:08:18,853 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 07:08:18,853 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 07:08:18,923 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:08:18,924 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 07:08:19,066 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 07:08:19,090 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 07:08:19,478 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 07:08:19,478 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 07:08:19,491 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 07:08:19,500 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 07:08:23,750 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_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv0 32)))) is different from true [2023-11-29 07:08:23,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:08:23,824 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 07:08:23,824 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 07:08:23,910 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 07:08:23,910 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 07:08:23,925 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 07:08:24,195 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 07:08:24,796 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 07:08:24,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:08:26,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:08:26,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279177859] [2023-11-29 07:08:26,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279177859] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:08:26,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1501088421] [2023-11-29 07:08:26,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:08:26,194 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:08:26,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:08:26,195 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:08:26,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-11-29 07:08:26,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:08:26,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:08:26,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-29 07:08:26,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:08:26,727 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 07:08:26,948 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 07:08:27,433 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 07:08:27,695 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:08:27,695 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 07:08:27,722 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 07:08:28,005 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 07:08:28,025 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 07:08:28,042 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 07:08:28,685 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 07:08:28,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2023-11-29 07:08:28,697 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 07:08:28,707 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 07:08:28,715 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 07:08:29,211 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_13|) (_ bv0 32)) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_13|) (_ bv0 32)) (_ 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| (store (store (select |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|) (_ bv0 32))))) (= |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 07:08:29,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:08:29,303 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 07:08:29,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 39 [2023-11-29 07:08:29,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:08:29,381 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 07:08:29,381 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 07:08:29,404 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 07:08:29,429 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 07:08:30,703 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 07:08:31,341 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-29 07:08:31,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2023-11-29 07:08:31,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 07:08:32,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:08:32,069 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 07:08:32,087 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 07:08:32,087 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 07:08:32,487 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 07:08:32,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:08:33,874 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0)))) v_ArrVal_966) (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 07:08:34,880 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_973 (Array (_ BitVec 32) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_64| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_966 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |v_node_create_~temp~0#1.base_64| v_ArrVal_974) (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|)))) (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_64| (store (store (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_64|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_1)))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_64| v_ArrVal_973) .cse1) .cse2)))) v_ArrVal_966) (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 (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_64|))))) is different from false [2023-11-29 07:08:34,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1501088421] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:08:34,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:08:34,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 39 [2023-11-29 07:08:34,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716758807] [2023-11-29 07:08:34,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:08:34,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 07:08:34,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:08:34,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 07:08:34,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2093, Unknown=38, NotChecked=380, Total=2652 [2023-11-29 07:08:34,893 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 39 states, 32 states have (on average 1.53125) internal successors, (49), 30 states have internal predecessors, (49), 6 states have call successors, (6), 5 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 07:08:39,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 07:08:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:52,973 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2023-11-29 07:08:52,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 07:08:52,973 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.53125) internal successors, (49), 30 states have internal predecessors, (49), 6 states have call successors, (6), 5 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 32 [2023-11-29 07:08:52,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:52,974 INFO L225 Difference]: With dead ends: 79 [2023-11-29 07:08:52,974 INFO L226 Difference]: Without dead ends: 67 [2023-11-29 07:08:52,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=286, Invalid=3723, Unknown=39, NotChecked=508, Total=4556 [2023-11-29 07:08:52,976 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:52,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 224 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 675 Invalid, 1 Unknown, 114 Unchecked, 8.0s Time] [2023-11-29 07:08:52,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-29 07:08:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2023-11-29 07:08:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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 07:08:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2023-11-29 07:08:52,998 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 32 [2023-11-29 07:08:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:52,998 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-11-29 07:08:52,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.53125) internal successors, (49), 30 states have internal predecessors, (49), 6 states have call successors, (6), 5 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 07:08:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2023-11-29 07:08:52,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 07:08:52,999 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:52,999 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] [2023-11-29 07:08:53,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2023-11-29 07:08:53,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:08:53,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:08:53,400 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:08:53,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash 27784448, now seen corresponding path program 2 times [2023-11-29 07:08:53,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:08:53,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203776477] [2023-11-29 07:08:53,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:08:53,401 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 07:08:53,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:08:53,402 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:08:53,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:08:53,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:08:53,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:08:53,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 07:08:53,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:08:53,613 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 07:08:53,874 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:08:53,875 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 07:08:53,966 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 07:08:53,983 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 07:08:54,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-11-29 07:08:54,208 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 07:08:54,215 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 07:08:54,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:08:54,504 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 07:08:54,565 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 07:08:54,566 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 07:08:54,592 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 07:08:55,616 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-29 07:08:55,616 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 07:08:55,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:08:55,650 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 07:08:55,835 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 07:08:56,043 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 07:08:56,428 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:08:56,429 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 07:08:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:08:56,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:08:59,780 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1045 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1044 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1038 (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_1044)) (.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_1045)) (.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_1038) .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 07:08:59,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:08:59,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203776477] [2023-11-29 07:08:59,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203776477] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:08:59,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [505428492] [2023-11-29 07:08:59,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:08:59,787 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:08:59,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:08:59,789 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:08:59,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-11-29 07:09:00,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:09:00,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:09:00,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 07:09:00,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:09:00,441 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 07:09:00,918 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:09:00,918 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 07:09:01,179 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 07:09:01,195 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 07:09:01,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 07:09:01,814 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 07:09:01,822 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 07:09:06,674 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 07:09:06,674 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 07:09:06,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:09:06,709 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 07:09:06,773 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 07:09:06,773 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 07:09:08,662 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-29 07:09:08,662 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 07:09:08,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:09:08,700 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 07:09:09,037 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 07:09:09,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 07:09:09,295 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:09:09,295 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 07:09:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:09:09,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:09:11,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [505428492] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:09:11,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:09:11,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 39 [2023-11-29 07:09:11,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579539774] [2023-11-29 07:09:11,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:09:11,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 07:09:11,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:09:11,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 07:09:11,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2079, Unknown=35, NotChecked=92, Total=2352 [2023-11-29 07:09:11,963 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 39 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 30 states have internal predecessors, (45), 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 07:09:18,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:09:18,778 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2023-11-29 07:09:18,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 07:09:18,779 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 30 states have internal predecessors, (45), 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 34 [2023-11-29 07:09:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:09:18,780 INFO L225 Difference]: With dead ends: 66 [2023-11-29 07:09:18,780 INFO L226 Difference]: Without dead ends: 63 [2023-11-29 07:09:18,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=272, Invalid=3357, Unknown=35, NotChecked=118, Total=3782 [2023-11-29 07:09:18,782 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 70 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:09:18,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 253 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 07:09:18,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-29 07:09:18,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2023-11-29 07:09:18,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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 07:09:18,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2023-11-29 07:09:18,810 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 34 [2023-11-29 07:09:18,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:09:18,811 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-11-29 07:09:18,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 30 states have internal predecessors, (45), 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 07:09:18,811 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2023-11-29 07:09:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 07:09:18,812 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:09:18,812 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:09:18,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2023-11-29 07:09:19,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:09:19,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:09:19,213 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:09:19,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:09:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash 27786122, now seen corresponding path program 2 times [2023-11-29 07:09:19,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:09:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96922061] [2023-11-29 07:09:19,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:09:19,214 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 07:09:19,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:09:19,215 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:09:19,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/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 07:09:19,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:09:19,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:09:19,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 83 conjunts are in the unsatisfiable core [2023-11-29 07:09:19,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:09:19,487 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 07:09:19,790 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:09:19,791 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 07:09:19,890 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 07:09:19,896 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 07:09:20,141 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 07:09:20,149 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 07:09:20,155 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 07:09:20,375 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 07:09:20,556 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 07:09:20,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-29 07:09:20,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:09:20,600 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 07:09:20,671 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 07:09:20,671 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 07:09:21,849 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-29 07:09:21,850 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 170 treesize of output 84 [2023-11-29 07:09:21,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:09:21,880 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 30 [2023-11-29 07:09:21,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 23 [2023-11-29 07:09:22,088 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 97 treesize of output 65 [2023-11-29 07:09:22,743 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:09:22,743 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 77 treesize of output 40 [2023-11-29 07:09:22,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-11-29 07:09:23,083 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 22 treesize of output 10 [2023-11-29 07:09:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:09:23,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:09:27,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:09:27,282 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 704 treesize of output 696 [2023-11-29 07:09:28,021 INFO L349 Elim1Store]: treesize reduction 4, result has 99.7 percent of original size [2023-11-29 07:09:28,022 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1702 treesize of output 2351 [2023-11-29 07:09:28,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:09:28,206 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 794 treesize of output 798 [2023-11-29 07:10:28,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse40 (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (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|))) (.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse11 (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|)))) (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse7 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse1 (select (select .cse7 .cse10) .cse11)) (.cse8 (bvadd (_ bv4 32) (select (select .cse9 .cse10) .cse11)))) (let ((.cse4 (store .cse9 .cse1 (store (select .cse9 .cse1) .cse8 (_ bv0 32))))) (let ((.cse0 (select (select (store .cse7 .cse1 (store (select .cse7 .cse1) .cse8 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)) .cse5) .cse6)) (.cse2 (select (select .cse4 .cse5) .cse6))) (let ((.cse3 (select (select .cse4 .cse0) (bvadd .cse2 (_ bv4 32))))) (or (= .cse0 .cse1) (= .cse2 .cse3) (= .cse3 (_ bv0 32)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse0)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse19 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse13 (select (select .cse19 .cse10) .cse11)) (.cse17 (bvadd (_ bv4 32) (select (select .cse16 .cse10) .cse11)))) (let ((.cse18 (store .cse19 .cse13 (store (select .cse19 .cse13) .cse17 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse12 (select (select .cse18 .cse5) .cse6))) (let ((.cse14 (select .cse18 .cse12))) (let ((.cse15 (select .cse14 (bvadd (select (select (store .cse16 .cse13 (store (select .cse16 .cse13) .cse17 (_ bv0 32))) .cse5) .cse6) (_ bv4 32))))) (or (not (= .cse12 .cse13)) (= (select .cse14 (_ bv4 32)) .cse13) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse15) (= .cse15 .cse12))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse26 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse22 (select (select .cse26 .cse10) .cse11)) (.cse25 (bvadd (_ bv4 32) (select (select .cse24 .cse10) .cse11)))) (let ((.cse23 (store .cse26 .cse22 (store (select .cse26 .cse22) .cse25 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse21 (select (select .cse23 .cse5) .cse6))) (let ((.cse20 (select (select .cse23 .cse21) (bvadd (select (select (store .cse24 .cse22 (store (select .cse24 .cse22) .cse25 (_ bv0 32))) .cse5) .cse6) (_ bv4 32))))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse20) (= .cse20 .cse21) (= .cse21 .cse22) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse21)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse32 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse30 (select (select .cse32 .cse10) .cse11)) (.cse31 (bvadd (_ bv4 32) (select (select .cse29 .cse10) .cse11)))) (let ((.cse27 (store .cse32 .cse30 (store (select .cse32 .cse30) .cse31 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse28 (select (select .cse27 .cse5) .cse6))) (or (not (= (select (select .cse27 .cse28) (bvadd (select (select (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 (_ bv0 32))) .cse5) .cse6) (_ bv4 32))) .cse30)) (= .cse28 .cse30) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse28))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (or (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32)) (v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse36 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse37 (select (select .cse36 .cse10) .cse11)) (.cse38 (bvadd (_ bv4 32) (select (select .cse39 .cse10) .cse11)))) (let ((.cse35 (select (select (store .cse39 .cse37 (store (select .cse39 .cse37) .cse38 (_ bv0 32))) .cse5) .cse6))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (let ((.cse33 (store .cse36 .cse37 (store (select .cse36 .cse37) .cse38 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse34 (select (select .cse33 .cse5) .cse6))) (= (select (select .cse33 .cse34) (bvadd .cse35 (_ bv4 32))) .cse34))) (= .cse35 (_ bv0 32))))))) .cse40) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse46 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse47 (select (select .cse46 .cse10) .cse11)) (.cse48 (bvadd (_ bv4 32) (select (select .cse49 .cse10) .cse11)))) (let ((.cse45 (store .cse49 .cse47 (store (select .cse49 .cse47) .cse48 (_ bv0 32))))) (let ((.cse44 (select (select .cse45 .cse5) .cse6)) (.cse41 (store .cse46 .cse47 (store (select .cse46 .cse47) .cse48 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse42 (select (select .cse41 .cse5) .cse6)) (.cse43 (bvadd .cse44 (_ bv4 32)))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (select (select .cse41 .cse42) .cse43)) (= .cse44 (select (select .cse45 .cse42) .cse43)) (= .cse44 (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse56 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse51 (select (select .cse56 .cse10) .cse11)) (.cse57 (bvadd (_ bv4 32) (select (select .cse58 .cse10) .cse11)))) (let ((.cse55 (store .cse58 .cse51 (store (select .cse58 .cse51) .cse57 (_ bv0 32)))) (.cse50 (select (select (store .cse56 .cse51 (store (select .cse56 .cse51) .cse57 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)) .cse5) .cse6))) (let ((.cse52 (select .cse55 .cse50)) (.cse53 (select (select .cse55 .cse5) .cse6))) (let ((.cse54 (select .cse52 (bvadd .cse53 (_ bv4 32))))) (or (not (= .cse50 .cse51)) (= (select .cse52 (_ bv4 32)) (_ bv0 32)) (= .cse53 .cse54) (= .cse54 (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse66 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse60 (select (select .cse66 .cse10) .cse11)) (.cse65 (bvadd (_ bv4 32) (select (select .cse64 .cse10) .cse11)))) (let ((.cse63 (store .cse66 .cse60 (store (select .cse66 .cse60) .cse65 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse59 (select (select .cse63 .cse5) .cse6)) (.cse61 (store .cse64 .cse60 (store (select .cse64 .cse60) .cse65 (_ bv0 32))))) (let ((.cse62 (select (select .cse63 .cse59) (bvadd (select (select .cse61 .cse5) .cse6) (_ bv4 32))))) (or (not (= .cse59 .cse60)) (= (select (select .cse61 .cse59) (_ bv4 32)) (_ bv0 32)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse62) (= .cse62 .cse59)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse73 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse70 (select (select .cse73 .cse10) .cse11)) (.cse74 (bvadd (_ bv4 32) (select (select .cse75 .cse10) .cse11)))) (let ((.cse72 (store .cse75 .cse70 (store (select .cse75 .cse70) .cse74 (_ bv0 32))))) (let ((.cse67 (store .cse73 .cse70 (store (select .cse73 .cse70) .cse74 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (.cse71 (select (select .cse72 .cse5) .cse6))) (let ((.cse69 (bvadd .cse71 (_ bv4 32))) (.cse68 (select (select .cse67 .cse5) .cse6))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (select (select .cse67 .cse68) .cse69)) (= .cse68 .cse70) (= .cse71 (select (select .cse72 .cse68) .cse69)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse68)))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse85 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse77 (select (select .cse85 .cse10) .cse11)) (.cse84 (bvadd (_ bv4 32) (select (select .cse83 .cse10) .cse11)))) (let ((.cse82 (store .cse85 .cse77 (store (select .cse85 .cse77) .cse84 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (.cse81 (store .cse83 .cse77 (store (select .cse83 .cse77) .cse84 (_ bv0 32))))) (let ((.cse80 (select (select .cse81 .cse5) .cse6)) (.cse76 (select (select .cse82 .cse5) .cse6))) (let ((.cse78 (select .cse82 .cse76)) (.cse79 (bvadd .cse80 (_ bv4 32)))) (or (not (= .cse76 .cse77)) (= (select .cse78 (_ bv4 32)) .cse77) (not (= (select .cse78 .cse79) .cse77)) (= .cse80 (select (select .cse81 .cse76) .cse79))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse94 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse92 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse87 (select (select .cse92 .cse10) .cse11)) (.cse93 (bvadd (_ bv4 32) (select (select .cse94 .cse10) .cse11)))) (let ((.cse91 (store .cse94 .cse87 (store (select .cse94 .cse87) .cse93 (_ bv0 32)))) (.cse88 (store .cse92 .cse87 (store (select .cse92 .cse87) .cse93 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse86 (select (select .cse88 .cse5) .cse6)) (.cse89 (select (select .cse91 .cse5) .cse6))) (let ((.cse90 (select (select .cse91 .cse86) (bvadd .cse89 (_ bv4 32))))) (or (not (= .cse86 .cse87)) (= (select (select .cse88 .cse86) (_ bv4 32)) .cse87) (= .cse89 .cse90) (= .cse90 (_ bv0 32))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse103 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse101 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse98 (select (select .cse101 .cse10) .cse11)) (.cse102 (bvadd (_ bv4 32) (select (select .cse103 .cse10) .cse11)))) (let ((.cse100 (store .cse103 .cse98 (store (select .cse103 .cse98) .cse102 (_ bv0 32))))) (let ((.cse99 (select (select .cse100 .cse5) .cse6)) (.cse95 (store .cse101 .cse98 (store (select .cse101 .cse98) .cse102 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse96 (select (select .cse95 .cse5) .cse6)) (.cse97 (bvadd .cse99 (_ bv4 32)))) (or (not (= (select (select .cse95 .cse96) .cse97) .cse98)) (= .cse99 (select (select .cse100 .cse96) .cse97)) (= .cse99 (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse111 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse113 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse105 (select (select .cse113 .cse10) .cse11)) (.cse112 (bvadd (_ bv4 32) (select (select .cse111 .cse10) .cse11)))) (let ((.cse107 (store .cse113 .cse105 (store (select .cse113 .cse105) .cse112 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (.cse110 (store .cse111 .cse105 (store (select .cse111 .cse105) .cse112 (_ bv0 32))))) (let ((.cse109 (select (select .cse110 .cse5) .cse6)) (.cse104 (select (select .cse107 .cse5) .cse6))) (let ((.cse106 (select .cse110 .cse104)) (.cse108 (bvadd .cse109 (_ bv4 32)))) (or (not (= .cse104 .cse105)) (= (select .cse106 (_ bv4 32)) (_ bv0 32)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (select (select .cse107 .cse104) .cse108)) (= .cse109 (select .cse106 .cse108))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (or (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse117 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse120 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse115 (select (select .cse120 .cse10) .cse11)) (.cse118 (bvadd (_ bv4 32) (select (select .cse117 .cse10) .cse11)))) (let ((.cse119 (store .cse120 .cse115 (store (select .cse120 .cse115) .cse118 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse114 (select (select .cse119 .cse5) .cse6))) (let ((.cse116 (select .cse119 .cse114))) (or (not (= .cse114 .cse115)) (= (select .cse116 (_ bv4 32)) .cse115) (= (select .cse116 (bvadd (select (select (store .cse117 .cse115 (store (select .cse117 .cse115) .cse118 (_ bv0 32))) .cse5) .cse6) (_ bv4 32))) .cse114)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse125 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse127 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse122 (select (select .cse127 .cse10) .cse11)) (.cse126 (bvadd (_ bv4 32) (select (select .cse125 .cse10) .cse11)))) (let ((.cse124 (store .cse127 .cse122 (store (select .cse127 .cse122) .cse126 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse123 (store .cse125 .cse122 (store (select .cse125 .cse122) .cse126 (_ bv0 32)))) (.cse121 (select (select .cse124 .cse5) .cse6))) (or (not (= .cse121 .cse122)) (= (select (select .cse123 .cse121) (_ bv4 32)) (_ bv0 32)) (= (select (select .cse124 .cse121) (bvadd (select (select .cse123 .cse5) .cse6) (_ bv4 32))) .cse121)))))))))) .cse40) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse135 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse133 (select (select .cse135 .cse10) .cse11)) (.cse134 (bvadd (_ bv4 32) (select (select .cse132 .cse10) .cse11)))) (let ((.cse131 (store .cse135 .cse133 (store (select .cse135 .cse133) .cse134 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse129 (select (select .cse131 .cse5) .cse6)) (.cse130 (select (select (store .cse132 .cse133 (store (select .cse132 .cse133) .cse134 (_ bv0 32))) .cse5) .cse6))) (let ((.cse128 (select (select .cse131 .cse129) (bvadd .cse130 (_ bv4 32))))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse128) (= .cse128 .cse129) (= .cse130 (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse143 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse145 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse137 (select (select .cse145 .cse10) .cse11)) (.cse144 (bvadd (_ bv4 32) (select (select .cse143 .cse10) .cse11)))) (let ((.cse142 (store .cse145 .cse137 (store (select .cse145 .cse137) .cse144 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (.cse141 (store .cse143 .cse137 (store (select .cse143 .cse137) .cse144 (_ bv0 32))))) (let ((.cse140 (select (select .cse141 .cse5) .cse6)) (.cse136 (select (select .cse142 .cse5) .cse6))) (let ((.cse138 (select .cse142 .cse136)) (.cse139 (bvadd .cse140 (_ bv4 32)))) (or (not (= .cse136 .cse137)) (= (select .cse138 (_ bv4 32)) .cse137) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (select .cse138 .cse139)) (= .cse140 (select (select .cse141 .cse136) .cse139))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse154 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse152 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse149 (select (select .cse152 .cse10) .cse11)) (.cse153 (bvadd (_ bv4 32) (select (select .cse154 .cse10) .cse11)))) (let ((.cse151 (store .cse154 .cse149 (store (select .cse154 .cse149) .cse153 (_ bv0 32))))) (let ((.cse146 (store .cse152 .cse149 (store (select .cse152 .cse149) .cse153 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (.cse150 (select (select .cse151 .cse5) .cse6))) (let ((.cse148 (bvadd .cse150 (_ bv4 32))) (.cse147 (select (select .cse146 .cse5) .cse6))) (or (not (= (select (select .cse146 .cse147) .cse148) .cse149)) (= .cse147 .cse149) (= .cse150 (select (select .cse151 .cse147) .cse148)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse147)))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse161 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse158 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse159 (select (select .cse158 .cse10) .cse11)) (.cse160 (bvadd (_ bv4 32) (select (select .cse161 .cse10) .cse11)))) (let ((.cse157 (store .cse161 .cse159 (store (select .cse161 .cse159) .cse160 (_ bv0 32))))) (let ((.cse155 (select (select .cse157 .cse5) .cse6))) (let ((.cse156 (select (select .cse157 (select (select (store .cse158 .cse159 (store (select .cse158 .cse159) .cse160 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)) .cse5) .cse6)) (bvadd .cse155 (_ bv4 32))))) (or (= .cse155 .cse156) (= .cse156 (_ bv0 32)) (= .cse155 (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (or (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32)) (v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse164 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse167 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse165 (select (select .cse167 .cse10) .cse11)) (.cse166 (bvadd (_ bv4 32) (select (select .cse164 .cse10) .cse11)))) (let ((.cse162 (store .cse167 .cse165 (store (select .cse167 .cse165) .cse166 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse163 (select (select .cse162 .cse5) .cse6))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (= (select (select .cse162 .cse163) (bvadd (select (select (store .cse164 .cse165 (store (select .cse164 .cse165) .cse166 (_ bv0 32))) .cse5) .cse6) (_ bv4 32))) .cse163) (= .cse163 .cse165) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse163))))))) .cse40) (or (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse173 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse175 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse169 (select (select .cse175 .cse10) .cse11)) (.cse174 (bvadd (_ bv4 32) (select (select .cse173 .cse10) .cse11)))) (let ((.cse170 (store .cse175 .cse169 (store (select .cse175 .cse169) .cse174 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse168 (select (select .cse170 .cse5) .cse6))) (or (not (= .cse168 .cse169)) (= (select (select .cse170 .cse168) (_ bv4 32)) .cse169) (let ((.cse172 (store .cse173 .cse169 (store (select .cse173 .cse169) .cse174 (_ bv0 32))))) (let ((.cse171 (select (select .cse172 .cse5) .cse6))) (= .cse171 (select (select .cse172 .cse168) (bvadd .cse171 (_ bv4 32)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse183 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse181 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse177 (select (select .cse181 .cse10) .cse11)) (.cse182 (bvadd (_ bv4 32) (select (select .cse183 .cse10) .cse11)))) (let ((.cse180 (store .cse183 .cse177 (store (select .cse183 .cse177) .cse182 (_ bv0 32)))) (.cse176 (select (select (store .cse181 .cse177 (store (select .cse181 .cse177) .cse182 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)) .cse5) .cse6))) (let ((.cse178 (select .cse180 .cse176))) (or (not (= .cse176 .cse177)) (= (select .cse178 (_ bv4 32)) (_ bv0 32)) (let ((.cse179 (select (select .cse180 .cse5) .cse6))) (= .cse179 (select .cse178 (bvadd .cse179 (_ bv4 32))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))))) .cse40) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse190 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse192 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse185 (select (select .cse192 .cse10) .cse11)) (.cse191 (bvadd (_ bv4 32) (select (select .cse190 .cse10) .cse11)))) (let ((.cse189 (store .cse192 .cse185 (store (select .cse192 .cse185) .cse191 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse188 (store .cse190 .cse185 (store (select .cse190 .cse185) .cse191 (_ bv0 32)))) (.cse184 (select (select .cse189 .cse5) .cse6))) (let ((.cse186 (select .cse189 .cse184)) (.cse187 (bvadd (select (select .cse188 .cse5) .cse6) (_ bv4 32)))) (or (not (= .cse184 .cse185)) (= (select .cse186 (_ bv4 32)) .cse185) (= (select .cse186 .cse187) .cse184) (= (select (select .cse188 .cse184) .cse187) (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse198 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse200 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse194 (select (select .cse200 .cse10) .cse11)) (.cse199 (bvadd (_ bv4 32) (select (select .cse198 .cse10) .cse11)))) (let ((.cse197 (store .cse200 .cse194 (store (select .cse200 .cse194) .cse199 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse195 (select (select .cse197 .cse5) .cse6)) (.cse196 (select (select (store .cse198 .cse194 (store (select .cse198 .cse194) .cse199 (_ bv0 32))) .cse5) .cse6))) (let ((.cse193 (select (select .cse197 .cse195) (bvadd .cse196 (_ bv4 32))))) (or (not (= .cse193 .cse194)) (= .cse193 .cse195) (= .cse196 (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse208 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse210 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse202 (select (select .cse210 .cse10) .cse11)) (.cse209 (bvadd (_ bv4 32) (select (select .cse208 .cse10) .cse11)))) (let ((.cse204 (store .cse210 .cse202 (store (select .cse210 .cse202) .cse209 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (.cse207 (store .cse208 .cse202 (store (select .cse208 .cse202) .cse209 (_ bv0 32))))) (let ((.cse206 (select (select .cse207 .cse5) .cse6)) (.cse201 (select (select .cse204 .cse5) .cse6))) (let ((.cse203 (select .cse207 .cse201)) (.cse205 (bvadd .cse206 (_ bv4 32)))) (or (not (= .cse201 .cse202)) (= (select .cse203 (_ bv4 32)) (_ bv0 32)) (not (= (select (select .cse204 .cse201) .cse205) .cse202)) (= .cse206 (select .cse203 .cse205))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse216 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse218 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse214 (select (select .cse218 .cse10) .cse11)) (.cse217 (bvadd (_ bv4 32) (select (select .cse216 .cse10) .cse11)))) (let ((.cse211 (store .cse218 .cse214 (store (select .cse218 .cse214) .cse217 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (.cse215 (store .cse216 .cse214 (store (select .cse216 .cse214) .cse217 (_ bv0 32))))) (let ((.cse213 (bvadd (select (select .cse215 .cse5) .cse6) (_ bv4 32))) (.cse212 (select (select .cse211 .cse5) .cse6))) (or (= (select (select .cse211 .cse212) .cse213) .cse212) (= .cse212 .cse214) (= (select (select .cse215 .cse212) .cse213) (_ bv0 32)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse212))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse227 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse224 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse225 (select (select .cse224 .cse10) .cse11)) (.cse226 (bvadd (_ bv4 32) (select (select .cse227 .cse10) .cse11)))) (let ((.cse222 (store .cse227 .cse225 (store (select .cse227 .cse225) .cse226 (_ bv0 32))))) (let ((.cse223 (select (select .cse222 .cse5) .cse6)) (.cse219 (store .cse224 .cse225 (store (select .cse224 .cse225) .cse226 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse220 (select (select .cse219 .cse5) .cse6)) (.cse221 (bvadd .cse223 (_ bv4 32)))) (or (= (select (select .cse219 .cse220) .cse221) .cse220) (= (select (select .cse222 .cse220) .cse221) (_ bv0 32)) (= .cse223 (_ bv0 32))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse234 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse236 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse229 (select (select .cse236 .cse10) .cse11)) (.cse235 (bvadd (_ bv4 32) (select (select .cse234 .cse10) .cse11)))) (let ((.cse231 (store .cse236 .cse229 (store (select .cse236 .cse229) .cse235 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse233 (store .cse234 .cse229 (store (select .cse234 .cse229) .cse235 (_ bv0 32)))) (.cse228 (select (select .cse231 .cse5) .cse6))) (let ((.cse230 (select .cse233 .cse228)) (.cse232 (bvadd (select (select .cse233 .cse5) .cse6) (_ bv4 32)))) (or (not (= .cse228 .cse229)) (= (select .cse230 (_ bv4 32)) (_ bv0 32)) (= (select (select .cse231 .cse228) .cse232) .cse228) (= (select .cse230 .cse232) (_ bv0 32))))))))))) (or (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32)) (v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse242 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse239 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse240 (select (select .cse239 .cse10) .cse11)) (.cse241 (bvadd (_ bv4 32) (select (select .cse242 .cse10) .cse11)))) (let ((.cse238 (store .cse242 .cse240 (store (select .cse242 .cse240) .cse241 (_ bv0 32))))) (let ((.cse237 (select (select .cse238 .cse5) .cse6))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (= .cse237 (select (select .cse238 (select (select (store .cse239 .cse240 (store (select .cse239 .cse240) .cse241 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)) .cse5) .cse6)) (bvadd .cse237 (_ bv4 32)))) (= .cse237 (_ bv0 32)))))))) .cse40) (or (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32)) (v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse247 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse249 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse244 (select (select .cse249 .cse10) .cse11)) (.cse248 (bvadd (_ bv4 32) (select (select .cse247 .cse10) .cse11)))) (let ((.cse243 (select (select (store .cse249 .cse244 (store (select .cse249 .cse244) .cse248 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)) .cse5) .cse6))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (= .cse243 .cse244) (let ((.cse246 (store .cse247 .cse244 (store (select .cse247 .cse244) .cse248 (_ bv0 32))))) (let ((.cse245 (select (select .cse246 .cse5) .cse6))) (= .cse245 (select (select .cse246 .cse243) (bvadd .cse245 (_ bv4 32)))))) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse243)))))) .cse40) (or (not .cse40) (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse254 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse256 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse252 (select (select .cse256 .cse10) .cse11)) (.cse255 (bvadd (_ bv4 32) (select (select .cse254 .cse10) .cse11)))) (let ((.cse253 (store .cse256 .cse252 (store (select .cse256 .cse252) .cse255 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse251 (select (select .cse253 .cse5) .cse6))) (let ((.cse250 (select (select .cse253 .cse251) (bvadd (select (select (store .cse254 .cse252 (store (select .cse254 .cse252) .cse255 (_ bv0 32))) .cse5) .cse6) (_ bv4 32))))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse250) (= .cse250 .cse251) (= .cse251 .cse252)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse265 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse263 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse260 (select (select .cse263 .cse10) .cse11)) (.cse264 (bvadd (_ bv4 32) (select (select .cse265 .cse10) .cse11)))) (let ((.cse262 (store .cse265 .cse260 (store (select .cse265 .cse260) .cse264 (_ bv0 32))))) (let ((.cse261 (select (select .cse262 .cse5) .cse6)) (.cse257 (store .cse263 .cse260 (store (select .cse263 .cse260) .cse264 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse258 (select (select .cse257 .cse5) .cse6)) (.cse259 (bvadd .cse261 (_ bv4 32)))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (select (select .cse257 .cse258) .cse259)) (= .cse258 .cse260) (= .cse261 (select (select .cse262 .cse258) .cse259))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse274 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse272 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse269 (select (select .cse272 .cse10) .cse11)) (.cse273 (bvadd (_ bv4 32) (select (select .cse274 .cse10) .cse11)))) (let ((.cse271 (store .cse274 .cse269 (store (select .cse274 .cse269) .cse273 (_ bv0 32))))) (let ((.cse270 (select (select .cse271 .cse5) .cse6)) (.cse266 (store .cse272 .cse269 (store (select .cse272 .cse269) .cse273 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse267 (select (select .cse266 .cse5) .cse6)) (.cse268 (bvadd .cse270 (_ bv4 32)))) (or (not (= (select (select .cse266 .cse267) .cse268) .cse269)) (= .cse267 .cse269) (= .cse270 (select (select .cse271 .cse267) .cse268))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse279 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse281 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse276 (select (select .cse281 .cse10) .cse11)) (.cse280 (bvadd (_ bv4 32) (select (select .cse279 .cse10) .cse11)))) (let ((.cse278 (store .cse281 .cse276 (store (select .cse281 .cse276) .cse280 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse277 (select (select .cse278 .cse5) .cse6))) (let ((.cse275 (select (select .cse278 .cse277) (bvadd (select (select (store .cse279 .cse276 (store (select .cse279 .cse276) .cse280 (_ bv0 32))) .cse5) .cse6) (_ bv4 32))))) (or (not (= .cse275 .cse276)) (= .cse275 .cse277)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse289 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse287 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse285 (select (select .cse287 .cse10) .cse11)) (.cse288 (bvadd (_ bv4 32) (select (select .cse289 .cse10) .cse11)))) (let ((.cse286 (store .cse289 .cse285 (store (select .cse289 .cse285) .cse288 (_ bv0 32)))) (.cse282 (store .cse287 .cse285 (store (select .cse287 .cse285) .cse288 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse283 (select (select .cse282 .cse5) .cse6)) (.cse284 (bvadd (select (select .cse286 .cse5) .cse6) (_ bv4 32)))) (or (= (select (select .cse282 .cse283) .cse284) .cse283) (= .cse283 .cse285) (= (select (select .cse286 .cse283) .cse284) (_ bv0 32)))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse297 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse295 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse291 (select (select .cse295 .cse10) .cse11)) (.cse296 (bvadd (_ bv4 32) (select (select .cse297 .cse10) .cse11)))) (let ((.cse294 (store .cse297 .cse291 (store (select .cse297 .cse291) .cse296 (_ bv0 32))))) (let ((.cse290 (select (select (store .cse295 .cse291 (store (select .cse295 .cse291) .cse296 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)) .cse5) .cse6)) (.cse292 (select (select .cse294 .cse5) .cse6))) (let ((.cse293 (select (select .cse294 .cse290) (bvadd .cse292 (_ bv4 32))))) (or (= .cse290 .cse291) (= .cse292 .cse293) (= .cse293 (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))))))) is different from false [2023-11-29 07:10:33,037 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse40 (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (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|))) (.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse11 (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|)))) (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse7 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse1 (select (select .cse7 .cse10) .cse11)) (.cse8 (bvadd (_ bv4 32) (select (select .cse9 .cse10) .cse11)))) (let ((.cse4 (store .cse9 .cse1 (store (select .cse9 .cse1) .cse8 (_ bv0 32))))) (let ((.cse0 (select (select (store .cse7 .cse1 (store (select .cse7 .cse1) .cse8 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)) .cse5) .cse6)) (.cse2 (select (select .cse4 .cse5) .cse6))) (let ((.cse3 (select (select .cse4 .cse0) (bvadd .cse2 (_ bv4 32))))) (or (= .cse0 .cse1) (= .cse2 .cse3) (= .cse3 (_ bv0 32)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse0)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse19 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse13 (select (select .cse19 .cse10) .cse11)) (.cse17 (bvadd (_ bv4 32) (select (select .cse16 .cse10) .cse11)))) (let ((.cse18 (store .cse19 .cse13 (store (select .cse19 .cse13) .cse17 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse12 (select (select .cse18 .cse5) .cse6))) (let ((.cse14 (select .cse18 .cse12))) (let ((.cse15 (select .cse14 (bvadd (select (select (store .cse16 .cse13 (store (select .cse16 .cse13) .cse17 (_ bv0 32))) .cse5) .cse6) (_ bv4 32))))) (or (not (= .cse12 .cse13)) (= (select .cse14 (_ bv4 32)) .cse13) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse15) (= .cse15 .cse12))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse26 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse22 (select (select .cse26 .cse10) .cse11)) (.cse25 (bvadd (_ bv4 32) (select (select .cse24 .cse10) .cse11)))) (let ((.cse23 (store .cse26 .cse22 (store (select .cse26 .cse22) .cse25 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse21 (select (select .cse23 .cse5) .cse6))) (let ((.cse20 (select (select .cse23 .cse21) (bvadd (select (select (store .cse24 .cse22 (store (select .cse24 .cse22) .cse25 (_ bv0 32))) .cse5) .cse6) (_ bv4 32))))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse20) (= .cse20 .cse21) (= .cse21 .cse22) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse21)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse32 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse30 (select (select .cse32 .cse10) .cse11)) (.cse31 (bvadd (_ bv4 32) (select (select .cse29 .cse10) .cse11)))) (let ((.cse27 (store .cse32 .cse30 (store (select .cse32 .cse30) .cse31 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse28 (select (select .cse27 .cse5) .cse6))) (or (not (= (select (select .cse27 .cse28) (bvadd (select (select (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 (_ bv0 32))) .cse5) .cse6) (_ bv4 32))) .cse30)) (= .cse28 .cse30) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse28))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (or (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32)) (v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse36 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse37 (select (select .cse36 .cse10) .cse11)) (.cse38 (bvadd (_ bv4 32) (select (select .cse39 .cse10) .cse11)))) (let ((.cse35 (select (select (store .cse39 .cse37 (store (select .cse39 .cse37) .cse38 (_ bv0 32))) .cse5) .cse6))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (let ((.cse33 (store .cse36 .cse37 (store (select .cse36 .cse37) .cse38 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse34 (select (select .cse33 .cse5) .cse6))) (= (select (select .cse33 .cse34) (bvadd .cse35 (_ bv4 32))) .cse34))) (= .cse35 (_ bv0 32))))))) .cse40) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse46 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse47 (select (select .cse46 .cse10) .cse11)) (.cse48 (bvadd (_ bv4 32) (select (select .cse49 .cse10) .cse11)))) (let ((.cse45 (store .cse49 .cse47 (store (select .cse49 .cse47) .cse48 (_ bv0 32))))) (let ((.cse44 (select (select .cse45 .cse5) .cse6)) (.cse41 (store .cse46 .cse47 (store (select .cse46 .cse47) .cse48 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse42 (select (select .cse41 .cse5) .cse6)) (.cse43 (bvadd .cse44 (_ bv4 32)))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (select (select .cse41 .cse42) .cse43)) (= .cse44 (select (select .cse45 .cse42) .cse43)) (= .cse44 (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse56 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse51 (select (select .cse56 .cse10) .cse11)) (.cse57 (bvadd (_ bv4 32) (select (select .cse58 .cse10) .cse11)))) (let ((.cse55 (store .cse58 .cse51 (store (select .cse58 .cse51) .cse57 (_ bv0 32)))) (.cse50 (select (select (store .cse56 .cse51 (store (select .cse56 .cse51) .cse57 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)) .cse5) .cse6))) (let ((.cse52 (select .cse55 .cse50)) (.cse53 (select (select .cse55 .cse5) .cse6))) (let ((.cse54 (select .cse52 (bvadd .cse53 (_ bv4 32))))) (or (not (= .cse50 .cse51)) (= (select .cse52 (_ bv4 32)) (_ bv0 32)) (= .cse53 .cse54) (= .cse54 (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse66 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse60 (select (select .cse66 .cse10) .cse11)) (.cse65 (bvadd (_ bv4 32) (select (select .cse64 .cse10) .cse11)))) (let ((.cse63 (store .cse66 .cse60 (store (select .cse66 .cse60) .cse65 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse59 (select (select .cse63 .cse5) .cse6)) (.cse61 (store .cse64 .cse60 (store (select .cse64 .cse60) .cse65 (_ bv0 32))))) (let ((.cse62 (select (select .cse63 .cse59) (bvadd (select (select .cse61 .cse5) .cse6) (_ bv4 32))))) (or (not (= .cse59 .cse60)) (= (select (select .cse61 .cse59) (_ bv4 32)) (_ bv0 32)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse62) (= .cse62 .cse59)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse73 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse70 (select (select .cse73 .cse10) .cse11)) (.cse74 (bvadd (_ bv4 32) (select (select .cse75 .cse10) .cse11)))) (let ((.cse72 (store .cse75 .cse70 (store (select .cse75 .cse70) .cse74 (_ bv0 32))))) (let ((.cse67 (store .cse73 .cse70 (store (select .cse73 .cse70) .cse74 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (.cse71 (select (select .cse72 .cse5) .cse6))) (let ((.cse69 (bvadd .cse71 (_ bv4 32))) (.cse68 (select (select .cse67 .cse5) .cse6))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (select (select .cse67 .cse68) .cse69)) (= .cse68 .cse70) (= .cse71 (select (select .cse72 .cse68) .cse69)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse68)))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse85 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse77 (select (select .cse85 .cse10) .cse11)) (.cse84 (bvadd (_ bv4 32) (select (select .cse83 .cse10) .cse11)))) (let ((.cse82 (store .cse85 .cse77 (store (select .cse85 .cse77) .cse84 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (.cse81 (store .cse83 .cse77 (store (select .cse83 .cse77) .cse84 (_ bv0 32))))) (let ((.cse80 (select (select .cse81 .cse5) .cse6)) (.cse76 (select (select .cse82 .cse5) .cse6))) (let ((.cse78 (select .cse82 .cse76)) (.cse79 (bvadd .cse80 (_ bv4 32)))) (or (not (= .cse76 .cse77)) (= (select .cse78 (_ bv4 32)) .cse77) (not (= (select .cse78 .cse79) .cse77)) (= .cse80 (select (select .cse81 .cse76) .cse79))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse94 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse92 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse87 (select (select .cse92 .cse10) .cse11)) (.cse93 (bvadd (_ bv4 32) (select (select .cse94 .cse10) .cse11)))) (let ((.cse91 (store .cse94 .cse87 (store (select .cse94 .cse87) .cse93 (_ bv0 32)))) (.cse88 (store .cse92 .cse87 (store (select .cse92 .cse87) .cse93 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse86 (select (select .cse88 .cse5) .cse6)) (.cse89 (select (select .cse91 .cse5) .cse6))) (let ((.cse90 (select (select .cse91 .cse86) (bvadd .cse89 (_ bv4 32))))) (or (not (= .cse86 .cse87)) (= (select (select .cse88 .cse86) (_ bv4 32)) .cse87) (= .cse89 .cse90) (= .cse90 (_ bv0 32))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse103 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse101 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse98 (select (select .cse101 .cse10) .cse11)) (.cse102 (bvadd (_ bv4 32) (select (select .cse103 .cse10) .cse11)))) (let ((.cse100 (store .cse103 .cse98 (store (select .cse103 .cse98) .cse102 (_ bv0 32))))) (let ((.cse99 (select (select .cse100 .cse5) .cse6)) (.cse95 (store .cse101 .cse98 (store (select .cse101 .cse98) .cse102 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse96 (select (select .cse95 .cse5) .cse6)) (.cse97 (bvadd .cse99 (_ bv4 32)))) (or (not (= (select (select .cse95 .cse96) .cse97) .cse98)) (= .cse99 (select (select .cse100 .cse96) .cse97)) (= .cse99 (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse111 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse113 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse105 (select (select .cse113 .cse10) .cse11)) (.cse112 (bvadd (_ bv4 32) (select (select .cse111 .cse10) .cse11)))) (let ((.cse107 (store .cse113 .cse105 (store (select .cse113 .cse105) .cse112 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (.cse110 (store .cse111 .cse105 (store (select .cse111 .cse105) .cse112 (_ bv0 32))))) (let ((.cse109 (select (select .cse110 .cse5) .cse6)) (.cse104 (select (select .cse107 .cse5) .cse6))) (let ((.cse106 (select .cse110 .cse104)) (.cse108 (bvadd .cse109 (_ bv4 32)))) (or (not (= .cse104 .cse105)) (= (select .cse106 (_ bv4 32)) (_ bv0 32)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (select (select .cse107 .cse104) .cse108)) (= .cse109 (select .cse106 .cse108))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (or (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse117 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse120 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse115 (select (select .cse120 .cse10) .cse11)) (.cse118 (bvadd (_ bv4 32) (select (select .cse117 .cse10) .cse11)))) (let ((.cse119 (store .cse120 .cse115 (store (select .cse120 .cse115) .cse118 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse114 (select (select .cse119 .cse5) .cse6))) (let ((.cse116 (select .cse119 .cse114))) (or (not (= .cse114 .cse115)) (= (select .cse116 (_ bv4 32)) .cse115) (= (select .cse116 (bvadd (select (select (store .cse117 .cse115 (store (select .cse117 .cse115) .cse118 (_ bv0 32))) .cse5) .cse6) (_ bv4 32))) .cse114)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse125 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse127 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse122 (select (select .cse127 .cse10) .cse11)) (.cse126 (bvadd (_ bv4 32) (select (select .cse125 .cse10) .cse11)))) (let ((.cse124 (store .cse127 .cse122 (store (select .cse127 .cse122) .cse126 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse123 (store .cse125 .cse122 (store (select .cse125 .cse122) .cse126 (_ bv0 32)))) (.cse121 (select (select .cse124 .cse5) .cse6))) (or (not (= .cse121 .cse122)) (= (select (select .cse123 .cse121) (_ bv4 32)) (_ bv0 32)) (= (select (select .cse124 .cse121) (bvadd (select (select .cse123 .cse5) .cse6) (_ bv4 32))) .cse121)))))))))) .cse40) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse135 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse133 (select (select .cse135 .cse10) .cse11)) (.cse134 (bvadd (_ bv4 32) (select (select .cse132 .cse10) .cse11)))) (let ((.cse131 (store .cse135 .cse133 (store (select .cse135 .cse133) .cse134 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse129 (select (select .cse131 .cse5) .cse6)) (.cse130 (select (select (store .cse132 .cse133 (store (select .cse132 .cse133) .cse134 (_ bv0 32))) .cse5) .cse6))) (let ((.cse128 (select (select .cse131 .cse129) (bvadd .cse130 (_ bv4 32))))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse128) (= .cse128 .cse129) (= .cse130 (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse143 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse145 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse137 (select (select .cse145 .cse10) .cse11)) (.cse144 (bvadd (_ bv4 32) (select (select .cse143 .cse10) .cse11)))) (let ((.cse142 (store .cse145 .cse137 (store (select .cse145 .cse137) .cse144 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (.cse141 (store .cse143 .cse137 (store (select .cse143 .cse137) .cse144 (_ bv0 32))))) (let ((.cse140 (select (select .cse141 .cse5) .cse6)) (.cse136 (select (select .cse142 .cse5) .cse6))) (let ((.cse138 (select .cse142 .cse136)) (.cse139 (bvadd .cse140 (_ bv4 32)))) (or (not (= .cse136 .cse137)) (= (select .cse138 (_ bv4 32)) .cse137) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (select .cse138 .cse139)) (= .cse140 (select (select .cse141 .cse136) .cse139))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse154 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse152 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse149 (select (select .cse152 .cse10) .cse11)) (.cse153 (bvadd (_ bv4 32) (select (select .cse154 .cse10) .cse11)))) (let ((.cse151 (store .cse154 .cse149 (store (select .cse154 .cse149) .cse153 (_ bv0 32))))) (let ((.cse146 (store .cse152 .cse149 (store (select .cse152 .cse149) .cse153 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (.cse150 (select (select .cse151 .cse5) .cse6))) (let ((.cse148 (bvadd .cse150 (_ bv4 32))) (.cse147 (select (select .cse146 .cse5) .cse6))) (or (not (= (select (select .cse146 .cse147) .cse148) .cse149)) (= .cse147 .cse149) (= .cse150 (select (select .cse151 .cse147) .cse148)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse147)))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse161 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse158 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse159 (select (select .cse158 .cse10) .cse11)) (.cse160 (bvadd (_ bv4 32) (select (select .cse161 .cse10) .cse11)))) (let ((.cse157 (store .cse161 .cse159 (store (select .cse161 .cse159) .cse160 (_ bv0 32))))) (let ((.cse155 (select (select .cse157 .cse5) .cse6))) (let ((.cse156 (select (select .cse157 (select (select (store .cse158 .cse159 (store (select .cse158 .cse159) .cse160 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)) .cse5) .cse6)) (bvadd .cse155 (_ bv4 32))))) (or (= .cse155 .cse156) (= .cse156 (_ bv0 32)) (= .cse155 (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (or (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32)) (v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse164 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse167 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse165 (select (select .cse167 .cse10) .cse11)) (.cse166 (bvadd (_ bv4 32) (select (select .cse164 .cse10) .cse11)))) (let ((.cse162 (store .cse167 .cse165 (store (select .cse167 .cse165) .cse166 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse163 (select (select .cse162 .cse5) .cse6))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (= (select (select .cse162 .cse163) (bvadd (select (select (store .cse164 .cse165 (store (select .cse164 .cse165) .cse166 (_ bv0 32))) .cse5) .cse6) (_ bv4 32))) .cse163) (= .cse163 .cse165) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse163))))))) .cse40) (or (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse173 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse175 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse169 (select (select .cse175 .cse10) .cse11)) (.cse174 (bvadd (_ bv4 32) (select (select .cse173 .cse10) .cse11)))) (let ((.cse170 (store .cse175 .cse169 (store (select .cse175 .cse169) .cse174 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse168 (select (select .cse170 .cse5) .cse6))) (or (not (= .cse168 .cse169)) (= (select (select .cse170 .cse168) (_ bv4 32)) .cse169) (let ((.cse172 (store .cse173 .cse169 (store (select .cse173 .cse169) .cse174 (_ bv0 32))))) (let ((.cse171 (select (select .cse172 .cse5) .cse6))) (= .cse171 (select (select .cse172 .cse168) (bvadd .cse171 (_ bv4 32)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse183 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse181 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse177 (select (select .cse181 .cse10) .cse11)) (.cse182 (bvadd (_ bv4 32) (select (select .cse183 .cse10) .cse11)))) (let ((.cse180 (store .cse183 .cse177 (store (select .cse183 .cse177) .cse182 (_ bv0 32)))) (.cse176 (select (select (store .cse181 .cse177 (store (select .cse181 .cse177) .cse182 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)) .cse5) .cse6))) (let ((.cse178 (select .cse180 .cse176))) (or (not (= .cse176 .cse177)) (= (select .cse178 (_ bv4 32)) (_ bv0 32)) (let ((.cse179 (select (select .cse180 .cse5) .cse6))) (= .cse179 (select .cse178 (bvadd .cse179 (_ bv4 32))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))))) .cse40) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse190 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse192 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse185 (select (select .cse192 .cse10) .cse11)) (.cse191 (bvadd (_ bv4 32) (select (select .cse190 .cse10) .cse11)))) (let ((.cse189 (store .cse192 .cse185 (store (select .cse192 .cse185) .cse191 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse188 (store .cse190 .cse185 (store (select .cse190 .cse185) .cse191 (_ bv0 32)))) (.cse184 (select (select .cse189 .cse5) .cse6))) (let ((.cse186 (select .cse189 .cse184)) (.cse187 (bvadd (select (select .cse188 .cse5) .cse6) (_ bv4 32)))) (or (not (= .cse184 .cse185)) (= (select .cse186 (_ bv4 32)) .cse185) (= (select .cse186 .cse187) .cse184) (= (select (select .cse188 .cse184) .cse187) (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse198 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse200 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse194 (select (select .cse200 .cse10) .cse11)) (.cse199 (bvadd (_ bv4 32) (select (select .cse198 .cse10) .cse11)))) (let ((.cse197 (store .cse200 .cse194 (store (select .cse200 .cse194) .cse199 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse195 (select (select .cse197 .cse5) .cse6)) (.cse196 (select (select (store .cse198 .cse194 (store (select .cse198 .cse194) .cse199 (_ bv0 32))) .cse5) .cse6))) (let ((.cse193 (select (select .cse197 .cse195) (bvadd .cse196 (_ bv4 32))))) (or (not (= .cse193 .cse194)) (= .cse193 .cse195) (= .cse196 (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse208 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse210 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse202 (select (select .cse210 .cse10) .cse11)) (.cse209 (bvadd (_ bv4 32) (select (select .cse208 .cse10) .cse11)))) (let ((.cse204 (store .cse210 .cse202 (store (select .cse210 .cse202) .cse209 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (.cse207 (store .cse208 .cse202 (store (select .cse208 .cse202) .cse209 (_ bv0 32))))) (let ((.cse206 (select (select .cse207 .cse5) .cse6)) (.cse201 (select (select .cse204 .cse5) .cse6))) (let ((.cse203 (select .cse207 .cse201)) (.cse205 (bvadd .cse206 (_ bv4 32)))) (or (not (= .cse201 .cse202)) (= (select .cse203 (_ bv4 32)) (_ bv0 32)) (not (= (select (select .cse204 .cse201) .cse205) .cse202)) (= .cse206 (select .cse203 .cse205))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse216 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse218 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse214 (select (select .cse218 .cse10) .cse11)) (.cse217 (bvadd (_ bv4 32) (select (select .cse216 .cse10) .cse11)))) (let ((.cse211 (store .cse218 .cse214 (store (select .cse218 .cse214) .cse217 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (.cse215 (store .cse216 .cse214 (store (select .cse216 .cse214) .cse217 (_ bv0 32))))) (let ((.cse213 (bvadd (select (select .cse215 .cse5) .cse6) (_ bv4 32))) (.cse212 (select (select .cse211 .cse5) .cse6))) (or (= (select (select .cse211 .cse212) .cse213) .cse212) (= .cse212 .cse214) (= (select (select .cse215 .cse212) .cse213) (_ bv0 32)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse212))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse227 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse224 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse225 (select (select .cse224 .cse10) .cse11)) (.cse226 (bvadd (_ bv4 32) (select (select .cse227 .cse10) .cse11)))) (let ((.cse222 (store .cse227 .cse225 (store (select .cse227 .cse225) .cse226 (_ bv0 32))))) (let ((.cse223 (select (select .cse222 .cse5) .cse6)) (.cse219 (store .cse224 .cse225 (store (select .cse224 .cse225) .cse226 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse220 (select (select .cse219 .cse5) .cse6)) (.cse221 (bvadd .cse223 (_ bv4 32)))) (or (= (select (select .cse219 .cse220) .cse221) .cse220) (= (select (select .cse222 .cse220) .cse221) (_ bv0 32)) (= .cse223 (_ bv0 32))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse234 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse236 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse229 (select (select .cse236 .cse10) .cse11)) (.cse235 (bvadd (_ bv4 32) (select (select .cse234 .cse10) .cse11)))) (let ((.cse231 (store .cse236 .cse229 (store (select .cse236 .cse229) .cse235 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse233 (store .cse234 .cse229 (store (select .cse234 .cse229) .cse235 (_ bv0 32)))) (.cse228 (select (select .cse231 .cse5) .cse6))) (let ((.cse230 (select .cse233 .cse228)) (.cse232 (bvadd (select (select .cse233 .cse5) .cse6) (_ bv4 32)))) (or (not (= .cse228 .cse229)) (= (select .cse230 (_ bv4 32)) (_ bv0 32)) (= (select (select .cse231 .cse228) .cse232) .cse228) (= (select .cse230 .cse232) (_ bv0 32))))))))))) (or (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32)) (v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse242 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse239 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse240 (select (select .cse239 .cse10) .cse11)) (.cse241 (bvadd (_ bv4 32) (select (select .cse242 .cse10) .cse11)))) (let ((.cse238 (store .cse242 .cse240 (store (select .cse242 .cse240) .cse241 (_ bv0 32))))) (let ((.cse237 (select (select .cse238 .cse5) .cse6))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (= .cse237 (select (select .cse238 (select (select (store .cse239 .cse240 (store (select .cse239 .cse240) .cse241 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)) .cse5) .cse6)) (bvadd .cse237 (_ bv4 32)))) (= .cse237 (_ bv0 32)))))))) .cse40) (or (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32)) (v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse247 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse249 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse244 (select (select .cse249 .cse10) .cse11)) (.cse248 (bvadd (_ bv4 32) (select (select .cse247 .cse10) .cse11)))) (let ((.cse243 (select (select (store .cse249 .cse244 (store (select .cse249 .cse244) .cse248 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)) .cse5) .cse6))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (= .cse243 .cse244) (let ((.cse246 (store .cse247 .cse244 (store (select .cse247 .cse244) .cse248 (_ bv0 32))))) (let ((.cse245 (select (select .cse246 .cse5) .cse6))) (= .cse245 (select (select .cse246 .cse243) (bvadd .cse245 (_ bv4 32)))))) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse243)))))) .cse40) (or (not .cse40) (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse254 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse256 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse252 (select (select .cse256 .cse10) .cse11)) (.cse255 (bvadd (_ bv4 32) (select (select .cse254 .cse10) .cse11)))) (let ((.cse253 (store .cse256 .cse252 (store (select .cse256 .cse252) .cse255 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse251 (select (select .cse253 .cse5) .cse6))) (let ((.cse250 (select (select .cse253 .cse251) (bvadd (select (select (store .cse254 .cse252 (store (select .cse254 .cse252) .cse255 (_ bv0 32))) .cse5) .cse6) (_ bv4 32))))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| .cse250) (= .cse250 .cse251) (= .cse251 .cse252)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse265 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse263 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse260 (select (select .cse263 .cse10) .cse11)) (.cse264 (bvadd (_ bv4 32) (select (select .cse265 .cse10) .cse11)))) (let ((.cse262 (store .cse265 .cse260 (store (select .cse265 .cse260) .cse264 (_ bv0 32))))) (let ((.cse261 (select (select .cse262 .cse5) .cse6)) (.cse257 (store .cse263 .cse260 (store (select .cse263 .cse260) .cse264 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse258 (select (select .cse257 .cse5) .cse6)) (.cse259 (bvadd .cse261 (_ bv4 32)))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (select (select .cse257 .cse258) .cse259)) (= .cse258 .cse260) (= .cse261 (select (select .cse262 .cse258) .cse259))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse274 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse272 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse269 (select (select .cse272 .cse10) .cse11)) (.cse273 (bvadd (_ bv4 32) (select (select .cse274 .cse10) .cse11)))) (let ((.cse271 (store .cse274 .cse269 (store (select .cse274 .cse269) .cse273 (_ bv0 32))))) (let ((.cse270 (select (select .cse271 .cse5) .cse6)) (.cse266 (store .cse272 .cse269 (store (select .cse272 .cse269) .cse273 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse267 (select (select .cse266 .cse5) .cse6)) (.cse268 (bvadd .cse270 (_ bv4 32)))) (or (not (= (select (select .cse266 .cse267) .cse268) .cse269)) (= .cse267 .cse269) (= .cse270 (select (select .cse271 .cse267) .cse268))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse279 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse281 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse276 (select (select .cse281 .cse10) .cse11)) (.cse280 (bvadd (_ bv4 32) (select (select .cse279 .cse10) .cse11)))) (let ((.cse278 (store .cse281 .cse276 (store (select .cse281 .cse276) .cse280 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse277 (select (select .cse278 .cse5) .cse6))) (let ((.cse275 (select (select .cse278 .cse277) (bvadd (select (select (store .cse279 .cse276 (store (select .cse279 .cse276) .cse280 (_ bv0 32))) .cse5) .cse6) (_ bv4 32))))) (or (not (= .cse275 .cse276)) (= .cse275 .cse277)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))) (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse289 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse287 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse285 (select (select .cse287 .cse10) .cse11)) (.cse288 (bvadd (_ bv4 32) (select (select .cse289 .cse10) .cse11)))) (let ((.cse286 (store .cse289 .cse285 (store (select .cse289 .cse285) .cse288 (_ bv0 32)))) (.cse282 (store .cse287 .cse285 (store (select .cse287 .cse285) .cse288 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)))) (let ((.cse283 (select (select .cse282 .cse5) .cse6)) (.cse284 (bvadd (select (select .cse286 .cse5) .cse6) (_ bv4 32)))) (or (= (select (select .cse282 .cse283) .cse284) .cse283) (= .cse283 .cse285) (= (select (select .cse286 .cse283) .cse284) (_ bv0 32)))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| (_ BitVec 32))) (or (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse297 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1190)) (.cse295 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64| v_ArrVal_1189))) (let ((.cse291 (select (select .cse295 .cse10) .cse11)) (.cse296 (bvadd (_ bv4 32) (select (select .cse297 .cse10) .cse11)))) (let ((.cse294 (store .cse297 .cse291 (store (select .cse297 .cse291) .cse296 (_ bv0 32))))) (let ((.cse290 (select (select (store .cse295 .cse291 (store (select .cse295 .cse291) .cse296 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|)) .cse5) .cse6)) (.cse292 (select (select .cse294 .cse5) .cse6))) (let ((.cse293 (select (select .cse294 .cse290) (bvadd .cse292 (_ bv4 32))))) (or (= .cse290 .cse291) (= .cse292 .cse293) (= .cse293 (_ bv0 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_64|))))))))) is different from true [2023-11-29 07:10:33,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:10:33,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96922061] [2023-11-29 07:10:33,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96922061] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:10:33,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [322124887] [2023-11-29 07:10:33,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:10:33,054 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:10:33,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:10:33,056 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:10:33,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49c8e6b-b211-42d3-8076-cd0bf368fda5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-11-29 07:10:33,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:10:33,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:10:33,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 87 conjunts are in the unsatisfiable core [2023-11-29 07:10:33,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:10:34,744 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 07:10:38,044 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:10:38,044 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 07:10:39,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:10:39,635 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 07:10:43,171 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 07:10:43,210 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 07:10: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 07:10:45,643 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 07:10:50,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:10:50,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 40 treesize of output 29 [2023-11-29 07:10:51,172 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-29 07:10:51,172 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 07:10:51,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 20 treesize of output 15 [2023-11-29 07:10:58,852 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-29 07:10:58,853 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 185 treesize of output 91 [2023-11-29 07:10:58,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:10:58,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2023-11-29 07:10:59,179 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 59 treesize of output 23 [2023-11-29 07:11:00,912 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 97 treesize of output 65 [2023-11-29 07:11:06,519 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 07:11:06,519 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 77 treesize of output 40 [2023-11-29 07:11:06,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-11-29 07:11:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:11:10,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:11:23,613 INFO L349 Elim1Store]: treesize reduction 4, result has 99.4 percent of original size [2023-11-29 07:11:23,613 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 9246 treesize of output 8771