./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1 --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 64bit --witnessprinter.graph.data.programhash d7c0f5b67426dc3769ace794e9c8c036d37ffa3960449e6b59343c653ea0c545 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 15:10:46,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 15:10:46,742 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-12-02 15:10:46,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 15:10:46,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 15:10:46,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 15:10:46,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 15:10:46,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 15:10:46,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 15:10:46,771 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 15:10:46,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 15:10:46,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 15:10:46,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 15:10:46,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 15:10:46,772 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 15:10:46,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 15:10:46,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 15:10:46,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 15:10:46,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 15:10:46,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 15:10:46,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 15:10:46,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 15:10:46,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 15:10:46,773 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 15:10:46,773 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 15:10:46,774 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 15:10:46,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 15:10:46,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 15:10:46,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 15:10:46,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:10:46,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 15:10:46,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 15:10:46,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 15:10:46,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 15:10:46,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:10:46,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 15:10:46,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 15:10:46,775 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 15:10:46,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 15:10:46,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 15:10:46,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 15:10:46,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 15:10:46,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 15:10:46,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 15:10:46,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 15:10:46,776 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7c0f5b67426dc3769ace794e9c8c036d37ffa3960449e6b59343c653ea0c545 [2024-12-02 15:10:47,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 15:10:47,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 15:10:47,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 15:10:47,024 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 15:10:47,024 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 15:10:47,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i [2024-12-02 15:10:49,959 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/data/dc59e57a1/a2363009b9cc40b68ee3cc771da4b0dd/FLAGb399bc72f [2024-12-02 15:10:50,351 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 15:10:50,351 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i [2024-12-02 15:10:50,382 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/data/dc59e57a1/a2363009b9cc40b68ee3cc771da4b0dd/FLAGb399bc72f [2024-12-02 15:10:50,399 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/data/dc59e57a1/a2363009b9cc40b68ee3cc771da4b0dd [2024-12-02 15:10:50,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 15:10:50,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 15:10:50,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 15:10:50,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 15:10:50,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 15:10:50,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:10:50" (1/1) ... [2024-12-02 15:10:50,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40045eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:50, skipping insertion in model container [2024-12-02 15:10:50,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:10:50" (1/1) ... [2024-12-02 15:10:50,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 15:10:50,749 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4493,4506] [2024-12-02 15:10:50,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4553,4566] [2024-12-02 15:10:51,675 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:51,676 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:51,676 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:51,677 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:51,678 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:51,689 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:51,690 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:51,691 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:51,691 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:51,693 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:51,694 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:51,694 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:51,695 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,289 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,290 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,295 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,303 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 15:10:52,411 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 15:10:52,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4493,4506] [2024-12-02 15:10:52,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4553,4566] [2024-12-02 15:10:52,477 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,477 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,477 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,478 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,478 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,485 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,485 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,486 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,487 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,488 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,488 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,489 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,489 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,554 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,555 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,556 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,561 WARN L1675 CHandler]: Possible shadowing of function index [2024-12-02 15:10:52,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7775-7786] [2024-12-02 15:10:52,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 15:10:52,782 INFO L204 MainTranslator]: Completed translation [2024-12-02 15:10:52,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52 WrapperNode [2024-12-02 15:10:52,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 15:10:52,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 15:10:52,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 15:10:52,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 15:10:52,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52" (1/1) ... [2024-12-02 15:10:52,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52" (1/1) ... [2024-12-02 15:10:52,911 INFO L138 Inliner]: procedures = 680, calls = 1678, calls flagged for inlining = 52, calls inlined = 7, statements flattened = 718 [2024-12-02 15:10:52,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 15:10:52,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 15:10:52,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 15:10:52,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 15:10:52,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52" (1/1) ... [2024-12-02 15:10:52,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52" (1/1) ... [2024-12-02 15:10:52,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52" (1/1) ... [2024-12-02 15:10:52,993 INFO L175 MemorySlicer]: Split 313 memory accesses to 5 slices as follows [238, 2, 7, 9, 57]. 76 percent of accesses are in the largest equivalence class. The 24 initializations are split as follows [6, 2, 5, 1, 10]. The 241 writes are split as follows [232, 0, 1, 1, 7]. [2024-12-02 15:10:52,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52" (1/1) ... [2024-12-02 15:10:52,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52" (1/1) ... [2024-12-02 15:10:53,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52" (1/1) ... [2024-12-02 15:10:53,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52" (1/1) ... [2024-12-02 15:10:53,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52" (1/1) ... [2024-12-02 15:10:53,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52" (1/1) ... [2024-12-02 15:10:53,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52" (1/1) ... [2024-12-02 15:10:53,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 15:10:53,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 15:10:53,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 15:10:53,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 15:10:53,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52" (1/1) ... [2024-12-02 15:10:53,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:10:53,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:10:53,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 15:10:53,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 15:10:53,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 15:10:53,124 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2024-12-02 15:10:53,124 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2024-12-02 15:10:53,124 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2024-12-02 15:10:53,124 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2024-12-02 15:10:53,124 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-12-02 15:10:53,125 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-12-02 15:10:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2024-12-02 15:10:53,125 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2024-12-02 15:10:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-12-02 15:10:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-12-02 15:10:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-12-02 15:10:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-12-02 15:10:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-12-02 15:10:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 15:10:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 15:10:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-12-02 15:10:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-12-02 15:10:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-12-02 15:10:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-12-02 15:10:53,126 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-12-02 15:10:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-02 15:10:53,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-02 15:10:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 15:10:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 15:10:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-12-02 15:10:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-12-02 15:10:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-12-02 15:10:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-12-02 15:10:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-12-02 15:10:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2024-12-02 15:10:53,127 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2024-12-02 15:10:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 15:10:53,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 15:10:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-12-02 15:10:53,127 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-12-02 15:10:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-12-02 15:10:53,127 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-12-02 15:10:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-12-02 15:10:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-12-02 15:10:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-12-02 15:10:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-12-02 15:10:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-12-02 15:10:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2024-12-02 15:10:53,128 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2024-12-02 15:10:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2024-12-02 15:10:53,128 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2024-12-02 15:10:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-02 15:10:53,128 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-02 15:10:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2024-12-02 15:10:53,128 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2024-12-02 15:10:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2024-12-02 15:10:53,128 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2024-12-02 15:10:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-02 15:10:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-12-02 15:10:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-12-02 15:10:53,129 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-12-02 15:10:53,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-12-02 15:10:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-12-02 15:10:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2024-12-02 15:10:53,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2024-12-02 15:10:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 15:10:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 15:10:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-12-02 15:10:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-12-02 15:10:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-12-02 15:10:53,426 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 15:10:53,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 15:10:59,617 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-12-02 15:10:59,617 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 15:10:59,629 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 15:10:59,629 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 15:10:59,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:10:59 BoogieIcfgContainer [2024-12-02 15:10:59,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 15:10:59,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 15:10:59,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 15:10:59,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 15:10:59,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:10:50" (1/3) ... [2024-12-02 15:10:59,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6b7865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:10:59, skipping insertion in model container [2024-12-02 15:10:59,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:10:52" (2/3) ... [2024-12-02 15:10:59,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6b7865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:10:59, skipping insertion in model container [2024-12-02 15:10:59,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:10:59" (3/3) ... [2024-12-02 15:10:59,638 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_array_list_copy_harness.i [2024-12-02 15:10:59,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 15:10:59,650 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_array_list_copy_harness.i that has 18 procedures, 209 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-12-02 15:10:59,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 15:10:59,709 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@541796a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 15:10:59,709 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 15:10:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 119 states have (on average 1.184873949579832) internal successors, (141), 120 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2024-12-02 15:10:59,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-02 15:10:59,727 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:10:59,727 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:10:59,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:10:59,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:10:59,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1329126664, now seen corresponding path program 1 times [2024-12-02 15:10:59,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:10:59,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121634029] [2024-12-02 15:10:59,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:10:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:11:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:11:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-12-02 15:11:06,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:11:06,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121634029] [2024-12-02 15:11:06,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121634029] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:11:06,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303889767] [2024-12-02 15:11:06,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:11:06,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:11:06,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:11:06,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:11:06,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 15:11:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:11:13,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 4363 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-12-02 15:11:13,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:11:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2024-12-02 15:11:13,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:11:13,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303889767] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:11:13,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 15:11:13,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-12-02 15:11:13,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498723940] [2024-12-02 15:11:13,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:11:13,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 15:11:13,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:11:13,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 15:11:13,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 15:11:13,342 INFO L87 Difference]: Start difference. First operand has 209 states, 119 states have (on average 1.184873949579832) internal successors, (141), 120 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-12-02 15:11:13,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:11:13,390 INFO L93 Difference]: Finished difference Result 414 states and 603 transitions. [2024-12-02 15:11:13,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 15:11:13,392 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2024-12-02 15:11:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:11:13,399 INFO L225 Difference]: With dead ends: 414 [2024-12-02 15:11:13,400 INFO L226 Difference]: Without dead ends: 204 [2024-12-02 15:11:13,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 15:11:13,406 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 15:11:13,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 15:11:13,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-12-02 15:11:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-12-02 15:11:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 115 states have (on average 1.173913043478261) internal successors, (135), 116 states have internal predecessors, (135), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-12-02 15:11:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 276 transitions. [2024-12-02 15:11:13,455 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 276 transitions. Word has length 145 [2024-12-02 15:11:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:11:13,456 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 276 transitions. [2024-12-02 15:11:13,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-12-02 15:11:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 276 transitions. [2024-12-02 15:11:13,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-02 15:11:13,459 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:11:13,459 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:11:13,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 15:11:13,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-12-02 15:11:13,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:11:13,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:11:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash -433130932, now seen corresponding path program 1 times [2024-12-02 15:11:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:11:13,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964915381] [2024-12-02 15:11:13,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:11:13,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:11:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:11:19,563 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-12-02 15:11:19,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:11:19,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964915381] [2024-12-02 15:11:19,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964915381] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:11:19,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796211761] [2024-12-02 15:11:19,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:11:19,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:11:19,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:11:19,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:11:19,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 15:11:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:11:25,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 4363 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 15:11:25,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:11:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-12-02 15:11:26,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:11:26,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796211761] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:11:26,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 15:11:26,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-12-02 15:11:26,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691238459] [2024-12-02 15:11:26,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:11:26,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:11:26,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:11:26,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:11:26,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:11:26,010 INFO L87 Difference]: Start difference. First operand 204 states and 276 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-12-02 15:11:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:11:26,079 INFO L93 Difference]: Finished difference Result 403 states and 547 transitions. [2024-12-02 15:11:26,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:11:26,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2024-12-02 15:11:26,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:11:26,082 INFO L225 Difference]: With dead ends: 403 [2024-12-02 15:11:26,082 INFO L226 Difference]: Without dead ends: 205 [2024-12-02 15:11:26,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:11:26,084 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 546 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 [2024-12-02 15:11:26,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 546 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 15:11:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-12-02 15:11:26,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-12-02 15:11:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 116 states have (on average 1.1724137931034482) internal successors, (136), 117 states have internal predecessors, (136), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-12-02 15:11:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 277 transitions. [2024-12-02 15:11:26,110 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 277 transitions. Word has length 145 [2024-12-02 15:11:26,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:11:26,110 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 277 transitions. [2024-12-02 15:11:26,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-12-02 15:11:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 277 transitions. [2024-12-02 15:11:26,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-02 15:11:26,113 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:11:26,113 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:11:26,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 15:11:26,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:11:26,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:11:26,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:11:26,315 INFO L85 PathProgramCache]: Analyzing trace with hash 995250632, now seen corresponding path program 1 times [2024-12-02 15:11:26,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:11:26,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369942500] [2024-12-02 15:11:26,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:11:26,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:11:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:11:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2024-12-02 15:11:32,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:11:32,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369942500] [2024-12-02 15:11:32,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369942500] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:11:32,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177717224] [2024-12-02 15:11:32,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:11:32,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:11:32,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:11:32,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:11:32,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 15:11:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:11:38,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 4369 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 15:11:38,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:11:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-12-02 15:11:39,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:11:39,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177717224] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:11:39,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 15:11:39,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-12-02 15:11:39,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919220715] [2024-12-02 15:11:39,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:11:39,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:11:39,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:11:39,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:11:39,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-12-02 15:11:39,203 INFO L87 Difference]: Start difference. First operand 205 states and 277 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-12-02 15:11:41,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:11:41,784 INFO L93 Difference]: Finished difference Result 405 states and 558 transitions. [2024-12-02 15:11:41,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:11:41,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 145 [2024-12-02 15:11:41,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:11:41,789 INFO L225 Difference]: With dead ends: 405 [2024-12-02 15:11:41,789 INFO L226 Difference]: Without dead ends: 207 [2024-12-02 15:11:41,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-12-02 15:11:41,791 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 282 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 15:11:41,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 779 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 15:11:41,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-12-02 15:11:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-12-02 15:11:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 117 states have (on average 1.170940170940171) internal successors, (137), 119 states have internal predecessors, (137), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (82), 70 states have call predecessors, (82), 70 states have call successors, (82) [2024-12-02 15:11:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 290 transitions. [2024-12-02 15:11:41,810 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 290 transitions. Word has length 145 [2024-12-02 15:11:41,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:11:41,810 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 290 transitions. [2024-12-02 15:11:41,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-12-02 15:11:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 290 transitions. [2024-12-02 15:11:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-02 15:11:41,812 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:11:41,812 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:11:41,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 15:11:42,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-12-02 15:11:42,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:11:42,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:11:42,013 INFO L85 PathProgramCache]: Analyzing trace with hash -139108393, now seen corresponding path program 1 times [2024-12-02 15:11:42,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:11:42,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691015951] [2024-12-02 15:11:42,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:11:42,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:11:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:11:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-12-02 15:11:48,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:11:48,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691015951] [2024-12-02 15:11:48,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691015951] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:11:48,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849472711] [2024-12-02 15:11:48,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:11:48,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:11:48,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:11:48,718 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:11:48,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 15:11:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:11:55,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 4496 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 15:11:56,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:11:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-12-02 15:11:56,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:11:56,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849472711] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:11:56,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 15:11:56,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-12-02 15:11:56,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329926439] [2024-12-02 15:11:56,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:11:56,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:11:56,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:11:56,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:11:56,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-12-02 15:11:56,648 INFO L87 Difference]: Start difference. First operand 207 states and 290 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-12-02 15:11:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:11:59,090 INFO L93 Difference]: Finished difference Result 380 states and 530 transitions. [2024-12-02 15:11:59,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:11:59,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 160 [2024-12-02 15:11:59,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:11:59,094 INFO L225 Difference]: With dead ends: 380 [2024-12-02 15:11:59,094 INFO L226 Difference]: Without dead ends: 207 [2024-12-02 15:11:59,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-12-02 15:11:59,096 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 280 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-12-02 15:11:59,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 782 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-12-02 15:11:59,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-12-02 15:11:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-12-02 15:11:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 117 states have (on average 1.170940170940171) internal successors, (137), 119 states have internal predecessors, (137), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (80), 70 states have call predecessors, (80), 70 states have call successors, (80) [2024-12-02 15:11:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2024-12-02 15:11:59,124 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 160 [2024-12-02 15:11:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:11:59,125 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2024-12-02 15:11:59,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-12-02 15:11:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2024-12-02 15:11:59,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-02 15:11:59,127 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:11:59,128 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:11:59,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 15:11:59,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:11:59,328 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:11:59,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:11:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1577477002, now seen corresponding path program 2 times [2024-12-02 15:11:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:11:59,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232640325] [2024-12-02 15:11:59,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 15:11:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:05,038 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 15:12:05,038 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 15:12:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-12-02 15:12:05,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:05,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232640325] [2024-12-02 15:12:05,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232640325] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:05,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:05,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:12:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898076500] [2024-12-02 15:12:05,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:05,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 15:12:05,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:05,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 15:12:05,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:12:05,753 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-12-02 15:12:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:12:05,905 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions. [2024-12-02 15:12:05,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 15:12:05,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 175 [2024-12-02 15:12:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:12:05,909 INFO L225 Difference]: With dead ends: 266 [2024-12-02 15:12:05,909 INFO L226 Difference]: Without dead ends: 212 [2024-12-02 15:12:05,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:12:05,911 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 15:12:05,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1086 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 15:12:05,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-12-02 15:12:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-12-02 15:12:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 121 states have (on average 1.165289256198347) internal successors, (141), 123 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 19 states have return successors, (82), 71 states have call predecessors, (82), 70 states have call successors, (82) [2024-12-02 15:12:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2024-12-02 15:12:05,932 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 175 [2024-12-02 15:12:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:12:05,933 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2024-12-02 15:12:05,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-12-02 15:12:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2024-12-02 15:12:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-12-02 15:12:05,936 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:12:05,937 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:05,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 15:12:05,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:12:05,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:05,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1443434910, now seen corresponding path program 1 times [2024-12-02 15:12:05,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:05,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483999106] [2024-12-02 15:12:05,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-12-02 15:12:14,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:14,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483999106] [2024-12-02 15:12:14,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483999106] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:12:14,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153851096] [2024-12-02 15:12:14,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:14,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:14,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:12:14,364 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:12:14,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 15:12:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:21,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 4627 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-02 15:12:21,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:12:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-12-02 15:12:22,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:12:22,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153851096] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:22,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 15:12:22,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2024-12-02 15:12:22,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286959742] [2024-12-02 15:12:22,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:22,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 15:12:22,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:22,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 15:12:22,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-12-02 15:12:22,274 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-12-02 15:12:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:12:24,928 INFO L93 Difference]: Finished difference Result 379 states and 521 transitions. [2024-12-02 15:12:24,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 15:12:24,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 181 [2024-12-02 15:12:24,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:12:24,931 INFO L225 Difference]: With dead ends: 379 [2024-12-02 15:12:24,931 INFO L226 Difference]: Without dead ends: 212 [2024-12-02 15:12:24,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-12-02 15:12:24,933 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 308 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-12-02 15:12:24,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 945 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-12-02 15:12:24,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-12-02 15:12:24,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-12-02 15:12:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 121 states have (on average 1.165289256198347) internal successors, (141), 123 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 19 states have return successors, (77), 71 states have call predecessors, (77), 70 states have call successors, (77) [2024-12-02 15:12:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 289 transitions. [2024-12-02 15:12:24,953 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 289 transitions. Word has length 181 [2024-12-02 15:12:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:12:24,954 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 289 transitions. [2024-12-02 15:12:24,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-12-02 15:12:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 289 transitions. [2024-12-02 15:12:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-12-02 15:12:24,957 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:12:24,957 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:24,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 15:12:25,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-12-02 15:12:25,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:12:25,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:25,159 INFO L85 PathProgramCache]: Analyzing trace with hash 447772293, now seen corresponding path program 1 times [2024-12-02 15:12:25,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:25,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656937811] [2024-12-02 15:12:25,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:25,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2024-12-02 15:12:31,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:31,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656937811] [2024-12-02 15:12:31,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656937811] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:31,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:31,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 15:12:31,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004067583] [2024-12-02 15:12:31,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:31,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:12:31,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:31,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:12:31,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:12:31,010 INFO L87 Difference]: Start difference. First operand 212 states and 289 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-12-02 15:12:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:12:31,924 INFO L93 Difference]: Finished difference Result 376 states and 506 transitions. [2024-12-02 15:12:31,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:12:31,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 195 [2024-12-02 15:12:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:12:31,927 INFO L225 Difference]: With dead ends: 376 [2024-12-02 15:12:31,927 INFO L226 Difference]: Without dead ends: 210 [2024-12-02 15:12:31,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:12:31,928 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 46 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 15:12:31,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1092 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 15:12:31,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-12-02 15:12:31,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-12-02 15:12:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 120 states have (on average 1.1583333333333334) internal successors, (139), 121 states have internal predecessors, (139), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (72), 71 states have call predecessors, (72), 70 states have call successors, (72) [2024-12-02 15:12:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 282 transitions. [2024-12-02 15:12:31,940 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 282 transitions. Word has length 195 [2024-12-02 15:12:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:12:31,940 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 282 transitions. [2024-12-02 15:12:31,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-12-02 15:12:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 282 transitions. [2024-12-02 15:12:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-12-02 15:12:31,944 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:12:31,944 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:31,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 15:12:31,945 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:12:31,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:31,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1713877896, now seen corresponding path program 1 times [2024-12-02 15:12:31,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:31,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353611439] [2024-12-02 15:12:31,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:31,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2024-12-02 15:12:40,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:40,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353611439] [2024-12-02 15:12:40,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353611439] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:40,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:40,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 15:12:40,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213689796] [2024-12-02 15:12:40,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:40,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 15:12:40,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:40,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 15:12:40,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-12-02 15:12:40,055 INFO L87 Difference]: Start difference. First operand 210 states and 282 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 6 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 7 states have call predecessors, (26), 6 states have call successors, (26) [2024-12-02 15:12:44,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 15:12:48,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 15:12:52,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-12-02 15:13:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:13:04,887 INFO L93 Difference]: Finished difference Result 337 states and 465 transitions. [2024-12-02 15:13:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 15:13:04,888 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 6 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 7 states have call predecessors, (26), 6 states have call successors, (26) Word has length 210 [2024-12-02 15:13:04,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:13:04,892 INFO L225 Difference]: With dead ends: 337 [2024-12-02 15:13:04,892 INFO L226 Difference]: Without dead ends: 286 [2024-12-02 15:13:04,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-12-02 15:13:04,893 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 357 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 76 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2024-12-02 15:13:04,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1599 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 960 Invalid, 3 Unknown, 0 Unchecked, 23.7s Time] [2024-12-02 15:13:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-12-02 15:13:04,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 236. [2024-12-02 15:13:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 134 states have (on average 1.1567164179104477) internal successors, (155), 134 states have internal predecessors, (155), 82 states have call successors, (82), 17 states have call predecessors, (82), 19 states have return successors, (86), 84 states have call predecessors, (86), 81 states have call successors, (86) [2024-12-02 15:13:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 323 transitions. [2024-12-02 15:13:04,915 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 323 transitions. Word has length 210 [2024-12-02 15:13:04,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:13:04,916 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 323 transitions. [2024-12-02 15:13:04,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 6 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 7 states have call predecessors, (26), 6 states have call successors, (26) [2024-12-02 15:13:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 323 transitions. [2024-12-02 15:13:04,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-02 15:13:04,918 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:13:04,918 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:13:04,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 15:13:04,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:13:04,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:13:04,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1947341260, now seen corresponding path program 1 times [2024-12-02 15:13:04,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:13:04,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270723009] [2024-12-02 15:13:04,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:13:04,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:13:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:13:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2024-12-02 15:13:10,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:13:10,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270723009] [2024-12-02 15:13:10,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270723009] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:13:10,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:13:10,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 15:13:10,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416732689] [2024-12-02 15:13:10,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:13:10,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:13:10,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:13:10,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:13:10,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:13:10,953 INFO L87 Difference]: Start difference. First operand 236 states and 323 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2024-12-02 15:13:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:13:11,184 INFO L93 Difference]: Finished difference Result 285 states and 381 transitions. [2024-12-02 15:13:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:13:11,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) Word has length 216 [2024-12-02 15:13:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:13:11,192 INFO L225 Difference]: With dead ends: 285 [2024-12-02 15:13:11,192 INFO L226 Difference]: Without dead ends: 238 [2024-12-02 15:13:11,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:13:11,193 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 15:13:11,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1349 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 15:13:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-12-02 15:13:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-12-02 15:13:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 136 states have (on average 1.1544117647058822) internal successors, (157), 136 states have internal predecessors, (157), 82 states have call successors, (82), 17 states have call predecessors, (82), 19 states have return successors, (86), 84 states have call predecessors, (86), 81 states have call successors, (86) [2024-12-02 15:13:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 325 transitions. [2024-12-02 15:13:11,222 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 325 transitions. Word has length 216 [2024-12-02 15:13:11,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:13:11,223 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 325 transitions. [2024-12-02 15:13:11,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2024-12-02 15:13:11,223 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 325 transitions. [2024-12-02 15:13:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-12-02 15:13:11,226 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:13:11,226 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:13:11,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 15:13:11,226 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:13:11,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:13:11,227 INFO L85 PathProgramCache]: Analyzing trace with hash -561213031, now seen corresponding path program 1 times [2024-12-02 15:13:11,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:13:11,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100759286] [2024-12-02 15:13:11,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:13:11,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:13:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:13:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2024-12-02 15:13:26,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:13:26,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100759286] [2024-12-02 15:13:26,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100759286] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:13:26,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265011069] [2024-12-02 15:13:26,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:13:26,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:13:26,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:13:26,778 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:13:26,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 15:13:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:13:33,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 5008 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-12-02 15:13:33,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:13:33,781 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 10 treesize of output 8 [2024-12-02 15:13:36,251 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_ensure_array_list_has_allocated_data_member_~list.offset_8 Int)) (and (= |c_#memory_$Pointer$#4.base| (store |c_old(#memory_$Pointer$#4.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#4.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_8 (select (select |c_#memory_$Pointer$#4.base| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_8)))) (<= v_ensure_array_list_has_allocated_data_member_~list.offset_8 |c_ensure_array_list_has_allocated_data_member_#in~list.offset|) (= (store |c_old(#memory_$Pointer$#4.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#4.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_8 (select (select |c_#memory_$Pointer$#4.offset| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_8))) |c_#memory_$Pointer$#4.offset|))) is different from true [2024-12-02 15:13:36,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:13:36,395 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 25 treesize of output 13 [2024-12-02 15:13:36,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:13:36,457 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 25 treesize of output 13 [2024-12-02 15:13:40,821 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (= (select (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0))))))) is different from false [2024-12-02 15:13:40,843 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (= (select (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0))))))) is different from true [2024-12-02 15:13:41,003 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0))))) is different from false [2024-12-02 15:13:41,022 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0))))) is different from true [2024-12-02 15:13:43,318 WARN L851 $PredicateComparison]: unable to prove that (and |c_aws_array_list_is_valid_#t~short139| (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from false [2024-12-02 15:13:43,335 WARN L873 $PredicateComparison]: unable to prove that (and |c_aws_array_list_is_valid_#t~short139| (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from true [2024-12-02 15:13:43,597 WARN L851 $PredicateComparison]: unable to prove that (and (or (= |c_aws_array_list_is_valid_#res| 1) (= |c_aws_array_list_is_valid_#res| 0)) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from false [2024-12-02 15:13:43,621 WARN L873 $PredicateComparison]: unable to prove that (and (or (= |c_aws_array_list_is_valid_#res| 1) (= |c_aws_array_list_is_valid_#res| 0)) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from true [2024-12-02 15:13:44,076 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (= 0 |c_ULTIMATE.start_aws_array_list_copy_harness_#t~ret804#1|) (= 1 |c_ULTIMATE.start_aws_array_list_copy_harness_#t~ret804#1|)) (= (select (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0))))))) is different from false [2024-12-02 15:13:44,094 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (= 0 |c_ULTIMATE.start_aws_array_list_copy_harness_#t~ret804#1|) (= 1 |c_ULTIMATE.start_aws_array_list_copy_harness_#t~ret804#1|)) (= (select (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0))))))) is different from true [2024-12-02 15:13:44,308 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from false [2024-12-02 15:13:44,332 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from true [2024-12-02 15:13:44,555 WARN L851 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from false [2024-12-02 15:13:44,571 WARN L873 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from true [2024-12-02 15:13:44,814 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0)) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from false [2024-12-02 15:13:44,833 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0)) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from true [2024-12-02 15:13:45,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0))))))) is different from false [2024-12-02 15:13:45,348 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0))))))) is different from true [2024-12-02 15:13:45,841 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from false [2024-12-02 15:13:45,860 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from true [2024-12-02 15:13:46,873 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse5 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse4 (select |c_#memory_$Pointer$#4.offset| .cse4)) |c_#memory_$Pointer$#4.offset|) (not (= .cse4 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0))))))) is different from false [2024-12-02 15:13:46,892 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse5 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse4 (select |c_#memory_$Pointer$#4.offset| .cse4)) |c_#memory_$Pointer$#4.offset|) (not (= .cse4 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0))))))) is different from true [2024-12-02 15:13:48,401 INFO L349 Elim1Store]: treesize reduction 36, result has 70.2 percent of original size [2024-12-02 15:13:48,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 139 [2024-12-02 15:13:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 290 proven. 34 refuted. 2 times theorem prover too weak. 133 trivial. 55 not checked. [2024-12-02 15:13:48,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:14:06,470 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (forall ((v_ArrVal_23638 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0#1.base| v_ArrVal_23638) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_23639 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0#1.base| v_ArrVal_23639) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0)))) is different from false [2024-12-02 15:14:06,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265011069] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:14:06,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:14:06,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23] total 28 [2024-12-02 15:14:06,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127763879] [2024-12-02 15:14:06,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:14:06,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-12-02 15:14:06,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:14:06,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-12-02 15:14:06,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=387, Unknown=27, NotChecked=676, Total=1190 [2024-12-02 15:14:06,484 INFO L87 Difference]: Start difference. First operand 238 states and 325 transitions. Second operand has 28 states, 25 states have (on average 5.24) internal successors, (131), 23 states have internal predecessors, (131), 14 states have call successors, (55), 7 states have call predecessors, (55), 12 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) [2024-12-02 15:14:14,967 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (.cse1 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select .cse0 32) 0) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset| 0) (= (select .cse2 32) 0) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0#1.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (or (= (select .cse2 .cse1) 0) (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0))))))) is different from false [2024-12-02 15:14:14,985 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (.cse1 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select .cse0 32) 0) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset| 0) (= (select .cse2 32) 0) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0#1.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (or (= (select .cse2 .cse1) 0) (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0))))))) is different from true [2024-12-02 15:14:15,007 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_old(#memory_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from false [2024-12-02 15:14:15,026 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_old(#memory_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from true [2024-12-02 15:14:15,083 WARN L851 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from false [2024-12-02 15:14:15,101 WARN L873 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from true [2024-12-02 15:14:15,130 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0)) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from false [2024-12-02 15:14:15,148 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0)) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from true [2024-12-02 15:14:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:14:25,947 INFO L93 Difference]: Finished difference Result 513 states and 674 transitions. [2024-12-02 15:14:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-12-02 15:14:25,948 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 5.24) internal successors, (131), 23 states have internal predecessors, (131), 14 states have call successors, (55), 7 states have call predecessors, (55), 12 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) Word has length 226 [2024-12-02 15:14:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:14:25,951 INFO L225 Difference]: With dead ends: 513 [2024-12-02 15:14:25,952 INFO L226 Difference]: Without dead ends: 300 [2024-12-02 15:14:25,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 346 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=196, Invalid=767, Unknown=35, NotChecked=1258, Total=2256 [2024-12-02 15:14:25,953 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 170 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 99 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 6841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 5277 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2024-12-02 15:14:25,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 745 Invalid, 6841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1462 Invalid, 3 Unknown, 5277 Unchecked, 16.6s Time] [2024-12-02 15:14:25,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-12-02 15:14:25,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 295. [2024-12-02 15:14:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 173 states have (on average 1.1560693641618498) internal successors, (200), 174 states have internal predecessors, (200), 94 states have call successors, (94), 26 states have call predecessors, (94), 27 states have return successors, (98), 94 states have call predecessors, (98), 93 states have call successors, (98) [2024-12-02 15:14:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 392 transitions. [2024-12-02 15:14:25,979 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 392 transitions. Word has length 226 [2024-12-02 15:14:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:14:25,980 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 392 transitions. [2024-12-02 15:14:25,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 5.24) internal successors, (131), 23 states have internal predecessors, (131), 14 states have call successors, (55), 7 states have call predecessors, (55), 12 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) [2024-12-02 15:14:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 392 transitions. [2024-12-02 15:14:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-02 15:14:25,981 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:14:25,982 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:14:26,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-12-02 15:14:26,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-12-02 15:14:26,182 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:14:26,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:14:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1525028899, now seen corresponding path program 1 times [2024-12-02 15:14:26,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:14:26,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224496] [2024-12-02 15:14:26,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:14:26,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:14:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:14:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-12-02 15:14:48,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:14:48,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224496] [2024-12-02 15:14:48,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224496] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:14:48,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417489674] [2024-12-02 15:14:48,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:14:48,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:14:48,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:14:48,758 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:14:48,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 15:14:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:14:56,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 5045 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-12-02 15:14:56,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:14:57,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 15:15:02,659 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 0 case distinctions, treesize of input 26 treesize of output 14 [2024-12-02 15:15:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-12-02 15:15:10,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:15:10,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417489674] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:15:10,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 15:15:10,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 28 [2024-12-02 15:15:10,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851485354] [2024-12-02 15:15:10,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:15:10,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 15:15:10,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:15:10,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 15:15:10,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=666, Unknown=1, NotChecked=0, Total=756 [2024-12-02 15:15:10,280 INFO L87 Difference]: Start difference. First operand 295 states and 392 transitions. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 7 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2024-12-02 15:15:14,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:15:19,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:15:28,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:15:34,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:15:39,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:15:43,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:15:47,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:15:51,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:15:56,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:16:04,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:16:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:16:06,055 INFO L93 Difference]: Finished difference Result 613 states and 807 transitions. [2024-12-02 15:16:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 15:16:06,056 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 7 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) Word has length 232 [2024-12-02 15:16:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:16:06,059 INFO L225 Difference]: With dead ends: 613 [2024-12-02 15:16:06,060 INFO L226 Difference]: Without dead ends: 435 [2024-12-02 15:16:06,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 227 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=126, Invalid=995, Unknown=1, NotChecked=0, Total=1122 [2024-12-02 15:16:06,061 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 163 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 37 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 2868 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.8s IncrementalHoareTripleChecker+Time [2024-12-02 15:16:06,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 2868 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1156 Invalid, 10 Unknown, 0 Unchecked, 53.8s Time] [2024-12-02 15:16:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-12-02 15:16:06,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 427. [2024-12-02 15:16:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 252 states have (on average 1.1547619047619047) internal successors, (291), 258 states have internal predecessors, (291), 130 states have call successors, (130), 41 states have call predecessors, (130), 44 states have return successors, (142), 127 states have call predecessors, (142), 128 states have call successors, (142) [2024-12-02 15:16:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 563 transitions. [2024-12-02 15:16:06,117 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 563 transitions. Word has length 232 [2024-12-02 15:16:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:16:06,117 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 563 transitions. [2024-12-02 15:16:06,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 7 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2024-12-02 15:16:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 563 transitions. [2024-12-02 15:16:06,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-02 15:16:06,120 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:16:06,120 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:16:06,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-12-02 15:16:06,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:16:06,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:16:06,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:16:06,322 INFO L85 PathProgramCache]: Analyzing trace with hash -293180649, now seen corresponding path program 1 times [2024-12-02 15:16:06,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:16:06,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644063593] [2024-12-02 15:16:06,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:16:06,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:16:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:16:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-12-02 15:16:28,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:16:28,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644063593] [2024-12-02 15:16:28,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644063593] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:16:28,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75767427] [2024-12-02 15:16:28,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:16:28,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:16:28,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:16:28,925 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:16:28,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 15:16:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:16:36,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 5050 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-12-02 15:16:36,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:16:36,195 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 10 treesize of output 8 [2024-12-02 15:16:39,568 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_ensure_array_list_has_allocated_data_member_~list.offset_13 Int)) (and (= (store |c_old(#memory_$Pointer$#4.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#4.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_13 (select (select |c_#memory_$Pointer$#4.base| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_13))) |c_#memory_$Pointer$#4.base|) (<= v_ensure_array_list_has_allocated_data_member_~list.offset_13 |c_ensure_array_list_has_allocated_data_member_#in~list.offset|) (= (store |c_old(#memory_$Pointer$#4.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#4.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_13 (select (select |c_#memory_$Pointer$#4.offset| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_13))) |c_#memory_$Pointer$#4.offset|))) is different from true [2024-12-02 15:16:39,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:16:39,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 25 treesize of output 13 [2024-12-02 15:16:39,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:16:39,756 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 25 treesize of output 13 [2024-12-02 15:16:47,777 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 8 treesize of output 1 [2024-12-02 15:16:47,800 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 8 treesize of output 1 [2024-12-02 15:16:48,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-12-02 15:16:48,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-12-02 15:16:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 293 proven. 50 refuted. 0 times theorem prover too weak. 162 trivial. 2 not checked. [2024-12-02 15:16:52,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:16:59,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75767427] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:16:59,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:16:59,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 30 [2024-12-02 15:16:59,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115967618] [2024-12-02 15:16:59,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:16:59,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-12-02 15:16:59,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:16:59,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-12-02 15:16:59,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1032, Unknown=19, NotChecked=66, Total=1260 [2024-12-02 15:16:59,291 INFO L87 Difference]: Start difference. First operand 427 states and 563 transitions. Second operand has 30 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 27 states have internal predecessors, (142), 16 states have call successors, (58), 4 states have call predecessors, (58), 11 states have return successors, (58), 15 states have call predecessors, (58), 16 states have call successors, (58) [2024-12-02 15:17:13,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:17:18,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:17:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:17:58,381 INFO L93 Difference]: Finished difference Result 691 states and 899 transitions. [2024-12-02 15:17:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-12-02 15:17:58,382 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 27 states have internal predecessors, (142), 16 states have call successors, (58), 4 states have call predecessors, (58), 11 states have return successors, (58), 15 states have call predecessors, (58), 16 states have call successors, (58) Word has length 234 [2024-12-02 15:17:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:17:58,386 INFO L225 Difference]: With dead ends: 691 [2024-12-02 15:17:58,386 INFO L226 Difference]: Without dead ends: 389 [2024-12-02 15:17:58,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 354 SyntacticMatches, 16 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=281, Invalid=1959, Unknown=20, NotChecked=92, Total=2352 [2024-12-02 15:17:58,390 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 276 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 3800 mSolverCounterSat, 188 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 4347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 3800 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 52.8s IncrementalHoareTripleChecker+Time [2024-12-02 15:17:58,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1293 Invalid, 4347 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [188 Valid, 3800 Invalid, 5 Unknown, 354 Unchecked, 52.8s Time] [2024-12-02 15:17:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-12-02 15:17:58,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2024-12-02 15:17:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 226 states have (on average 1.1504424778761062) internal successors, (260), 231 states have internal predecessors, (260), 120 states have call successors, (120), 36 states have call predecessors, (120), 39 states have return successors, (131), 118 states have call predecessors, (131), 118 states have call successors, (131) [2024-12-02 15:17:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 511 transitions. [2024-12-02 15:17:58,443 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 511 transitions. Word has length 234 [2024-12-02 15:17:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:17:58,443 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 511 transitions. [2024-12-02 15:17:58,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 27 states have internal predecessors, (142), 16 states have call successors, (58), 4 states have call predecessors, (58), 11 states have return successors, (58), 15 states have call predecessors, (58), 16 states have call successors, (58) [2024-12-02 15:17:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 511 transitions. [2024-12-02 15:17:58,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-12-02 15:17:58,446 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:17:58,446 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:17:58,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-12-02 15:17:58,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:17:58,647 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:17:58,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:17:58,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1632454995, now seen corresponding path program 1 times [2024-12-02 15:17:58,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:17:58,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397867799] [2024-12-02 15:17:58,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:17:58,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:18:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:18:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 1 proven. 47 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2024-12-02 15:18:16,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:18:16,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397867799] [2024-12-02 15:18:16,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397867799] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:18:16,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694407858] [2024-12-02 15:18:16,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:18:16,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:18:16,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:18:16,442 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:18:16,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 15:18:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:18:23,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 5087 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-12-02 15:18:23,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:18:25,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 15:18:26,993 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 0 case distinctions, treesize of input 26 treesize of output 14 [2024-12-02 15:18:39,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 15:18:49,425 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-12-02 15:18:49,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2024-12-02 15:19:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 328 proven. 8 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-12-02 15:19:02,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:19:13,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694407858] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:19:13,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:19:13,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 37 [2024-12-02 15:19:13,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013043927] [2024-12-02 15:19:13,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:19:13,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-12-02 15:19:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:19:13,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-12-02 15:19:13,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1701, Unknown=3, NotChecked=0, Total=1892 [2024-12-02 15:19:13,901 INFO L87 Difference]: Start difference. First operand 386 states and 511 transitions. Second operand has 37 states, 35 states have (on average 4.285714285714286) internal successors, (150), 31 states have internal predecessors, (150), 20 states have call successors, (60), 5 states have call predecessors, (60), 11 states have return successors, (59), 20 states have call predecessors, (59), 20 states have call successors, (59) [2024-12-02 15:19:17,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:19:22,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:19:28,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:19:32,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:19:37,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:19:41,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:19:46,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:19:50,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:19:54,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:19:58,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:20:02,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:20:06,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:20:16,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:20:24,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:21:07,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:21:11,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:21:16,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:21:29,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:21:33,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:21:39,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:21:43,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:21:49,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-12-02 15:21:53,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-12-02 15:21:59,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:22:03,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:22:08,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:22:12,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:22:26,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:22:31,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:22:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:22:51,925 INFO L93 Difference]: Finished difference Result 838 states and 1124 transitions. [2024-12-02 15:22:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-12-02 15:22:51,926 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 4.285714285714286) internal successors, (150), 31 states have internal predecessors, (150), 20 states have call successors, (60), 5 states have call predecessors, (60), 11 states have return successors, (59), 20 states have call predecessors, (59), 20 states have call successors, (59) Word has length 240 [2024-12-02 15:22:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:22:51,929 INFO L225 Difference]: With dead ends: 838 [2024-12-02 15:22:51,929 INFO L226 Difference]: Without dead ends: 475 [2024-12-02 15:22:51,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 354 SyntacticMatches, 17 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 83.6s TimeCoverageRelationStatistics Valid=456, Invalid=3955, Unknown=11, NotChecked=0, Total=4422 [2024-12-02 15:22:51,933 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 441 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 4936 mSolverCounterSat, 459 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 176.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 5424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 4936 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 177.8s IncrementalHoareTripleChecker+Time [2024-12-02 15:22:51,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1526 Invalid, 5424 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [459 Valid, 4936 Invalid, 29 Unknown, 0 Unchecked, 177.8s Time] [2024-12-02 15:22:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-12-02 15:22:52,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 460. [2024-12-02 15:22:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 271 states have (on average 1.151291512915129) internal successors, (312), 277 states have internal predecessors, (312), 141 states have call successors, (141), 43 states have call predecessors, (141), 47 states have return successors, (156), 139 states have call predecessors, (156), 138 states have call successors, (156) [2024-12-02 15:22:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 609 transitions. [2024-12-02 15:22:52,010 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 609 transitions. Word has length 240 [2024-12-02 15:22:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:22:52,010 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 609 transitions. [2024-12-02 15:22:52,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 4.285714285714286) internal successors, (150), 31 states have internal predecessors, (150), 20 states have call successors, (60), 5 states have call predecessors, (60), 11 states have return successors, (59), 20 states have call predecessors, (59), 20 states have call successors, (59) [2024-12-02 15:22:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 609 transitions. [2024-12-02 15:22:52,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-02 15:22:52,013 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:22:52,013 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:22:52,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-12-02 15:22:52,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:22:52,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:22:52,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:22:52,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1487634061, now seen corresponding path program 1 times [2024-12-02 15:22:52,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:22:52,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257698952] [2024-12-02 15:22:52,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:22:52,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:23:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:23:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 37 proven. 11 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2024-12-02 15:23:11,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:23:11,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257698952] [2024-12-02 15:23:11,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257698952] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:23:11,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076333850] [2024-12-02 15:23:11,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:23:11,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:23:11,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:23:11,289 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:23:11,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 15:23:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:23:19,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 5118 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-12-02 15:23:19,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:23:20,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 15:23:22,170 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 0 case distinctions, treesize of input 26 treesize of output 14 [2024-12-02 15:23:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-12-02 15:23:37,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:23:37,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076333850] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:23:37,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 15:23:37,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [20] total 31 [2024-12-02 15:23:37,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207577973] [2024-12-02 15:23:37,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:23:37,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 15:23:37,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:23:37,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 15:23:37,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2024-12-02 15:23:37,459 INFO L87 Difference]: Start difference. First operand 460 states and 609 transitions. Second operand has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 13 states have internal predecessors, (108), 8 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2024-12-02 15:23:41,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:23:51,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:23:58,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:24:02,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:24:06,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:24:10,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:24:15,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:24:24,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:24:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:24:27,358 INFO L93 Difference]: Finished difference Result 723 states and 944 transitions. [2024-12-02 15:24:27,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-02 15:24:27,359 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 13 states have internal predecessors, (108), 8 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 241 [2024-12-02 15:24:27,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:24:27,362 INFO L225 Difference]: With dead ends: 723 [2024-12-02 15:24:27,362 INFO L226 Difference]: Without dead ends: 509 [2024-12-02 15:24:27,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 217 SyntacticMatches, 18 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=152, Invalid=1254, Unknown=0, NotChecked=0, Total=1406 [2024-12-02 15:24:27,364 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 245 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 74 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 2629 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.8s IncrementalHoareTripleChecker+Time [2024-12-02 15:24:27,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 2629 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1374 Invalid, 8 Unknown, 0 Unchecked, 47.8s Time] [2024-12-02 15:24:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-12-02 15:24:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 504. [2024-12-02 15:24:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 300 states have (on average 1.1533333333333333) internal successors, (346), 307 states have internal predecessors, (346), 151 states have call successors, (151), 48 states have call predecessors, (151), 52 states have return successors, (163), 148 states have call predecessors, (163), 147 states have call successors, (163) [2024-12-02 15:24:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 660 transitions. [2024-12-02 15:24:27,422 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 660 transitions. Word has length 241 [2024-12-02 15:24:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:24:27,423 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 660 transitions. [2024-12-02 15:24:27,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 13 states have internal predecessors, (108), 8 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2024-12-02 15:24:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 660 transitions. [2024-12-02 15:24:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-02 15:24:27,425 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:24:27,425 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:24:27,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-12-02 15:24:27,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc9dc4ae-e277-4cd6-a98c-5e420c6ea33c/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:24:27,625 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:24:27,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:24:27,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1562388687, now seen corresponding path program 2 times [2024-12-02 15:24:27,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:24:27,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007499057] [2024-12-02 15:24:27,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 15:24:27,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:24:40,783 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 15:24:40,783 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat