./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash aabf7ad166d752d3872d668e3b551e8cefeb907fee1d51e6917a6895600694bb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:52:59,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:52:59,907 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 05:52:59,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:52:59,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:52:59,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:52:59,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:52:59,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:52:59,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:52:59,936 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:52:59,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:52:59,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:52:59,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:52:59,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:52:59,939 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:52:59,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:52:59,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:52:59,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:52:59,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:52:59,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:52:59,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:52:59,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:52:59,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:52:59,944 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:52:59,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:52:59,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:52:59,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:52:59,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:52:59,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:52:59,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:52:59,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:52:59,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:52:59,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:52:59,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:52:59,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:52:59,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:52:59,949 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:52:59,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:52:59,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:52:59,950 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aabf7ad166d752d3872d668e3b551e8cefeb907fee1d51e6917a6895600694bb [2023-11-29 05:53:00,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:53:00,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:53:00,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:53:00,183 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:53:00,183 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:53:00,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i [2023-11-29 05:53:02,928 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:53:03,283 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:53:03,284 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i [2023-11-29 05:53:03,315 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/data/91cd48696/2d5d8add9b8c432d80155694e88c5575/FLAGc2cf1fa2c [2023-11-29 05:53:03,329 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/data/91cd48696/2d5d8add9b8c432d80155694e88c5575 [2023-11-29 05:53:03,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:53:03,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:53:03,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:53:03,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:53:03,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:53:03,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:53:03" (1/1) ... [2023-11-29 05:53:03,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f505a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:03, skipping insertion in model container [2023-11-29 05:53:03,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:53:03" (1/1) ... [2023-11-29 05:53:03,456 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:53:03,700 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2023-11-29 05:53:03,707 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2023-11-29 05:53:04,412 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,413 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,414 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,415 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,416 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,431 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,432 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,434 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,435 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,437 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,438 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,439 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,440 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,736 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 05:53:04,737 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 05:53:04,738 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 05:53:04,740 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 05:53:04,741 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 05:53:04,742 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 05:53:04,743 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 05:53:04,744 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 05:53:04,744 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 05:53:04,745 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 05:53:04,899 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:53:04,915 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:53:04,929 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2023-11-29 05:53:04,929 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2023-11-29 05:53:04,978 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,979 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,979 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,980 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,981 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,992 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,993 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,994 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,995 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,996 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,997 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,998 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:04,998 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:53:05,040 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 05:53:05,042 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 05:53:05,043 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 05:53:05,043 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 05:53:05,045 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 05:53:05,045 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 05:53:05,046 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 05:53:05,046 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 05:53:05,047 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 05:53:05,047 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 05:53:05,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:53:05,349 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,350 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,350 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,350 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,350 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,350 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,350 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,350 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,351 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,351 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,351 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,351 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,351 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,352 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,352 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:53:05,358 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:53:05,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:05 WrapperNode [2023-11-29 05:53:05,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:53:05,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:53:05,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:53:05,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:53:05,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:05" (1/1) ... [2023-11-29 05:53:05,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:05" (1/1) ... [2023-11-29 05:53:05,461 INFO L138 Inliner]: procedures = 678, calls = 1048, calls flagged for inlining = 49, calls inlined = 4, statements flattened = 87 [2023-11-29 05:53:05,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:53:05,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:53:05,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:53:05,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:53:05,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:05" (1/1) ... [2023-11-29 05:53:05,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:05" (1/1) ... [2023-11-29 05:53:05,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:05" (1/1) ... [2023-11-29 05:53:05,495 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 5, 23]. 77 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 7 writes are split as follows [0, 0, 7]. [2023-11-29 05:53:05,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:05" (1/1) ... [2023-11-29 05:53:05,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:05" (1/1) ... [2023-11-29 05:53:05,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:05" (1/1) ... [2023-11-29 05:53:05,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:05" (1/1) ... [2023-11-29 05:53:05,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:05" (1/1) ... [2023-11-29 05:53:05,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:05" (1/1) ... [2023-11-29 05:53:05,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:53:05,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:53:05,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:53:05,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:53:05,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:05" (1/1) ... [2023-11-29 05:53:05,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:53:05,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:53:05,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:53:05,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:53:05,600 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2023-11-29 05:53:05,600 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2023-11-29 05:53:05,600 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2023-11-29 05:53:05,600 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2023-11-29 05:53:05,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:53:05,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:53:05,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:53:05,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:53:05,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 05:53:05,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 05:53:05,601 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-29 05:53:05,602 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-29 05:53:05,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:53:05,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:53:05,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:53:05,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:53:05,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:53:05,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:53:05,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 05:53:05,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 05:53:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 05:53:05,603 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 05:53:05,603 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 05:53:05,603 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 05:53:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:53:05,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:53:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:53:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:53:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:53:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:53:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:53:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:53:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:53:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-29 05:53:05,604 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-29 05:53:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:53:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:53:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:53:05,819 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:53:05,821 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:53:06,057 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:53:06,093 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:53:06,094 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 05:53:06,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:53:06 BoogieIcfgContainer [2023-11-29 05:53:06,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:53:06,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:53:06,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:53:06,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:53:06,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:53:03" (1/3) ... [2023-11-29 05:53:06,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7bce4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:53:06, skipping insertion in model container [2023-11-29 05:53:06,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:53:05" (2/3) ... [2023-11-29 05:53:06,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7bce4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:53:06, skipping insertion in model container [2023-11-29 05:53:06,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:53:06" (3/3) ... [2023-11-29 05:53:06,101 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_remove_harness_negated.i [2023-11-29 05:53:06,115 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:53:06,116 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:53:06,154 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:53:06,160 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b4b84e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:53:06,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:53:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 05:53:06,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 05:53:06,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:53:06,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:53:06,173 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:53:06,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:53:06,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1133169586, now seen corresponding path program 1 times [2023-11-29 05:53:06,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:53:06,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134781746] [2023-11-29 05:53:06,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:06,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:53:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:06,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:53:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:06,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:53:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:06,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:53:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:06,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:53:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:06,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:53:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:06,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:53:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:53:06,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:53:06,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134781746] [2023-11-29 05:53:06,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134781746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:53:06,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:53:06,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:53:06,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116088771] [2023-11-29 05:53:06,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:53:06,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:53:06,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:53:06,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:53:06,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:53:06,662 INFO L87 Difference]: Start difference. First operand has 64 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 05:53:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:53:06,716 INFO L93 Difference]: Finished difference Result 123 states and 176 transitions. [2023-11-29 05:53:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:53:06,718 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-11-29 05:53:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:53:06,726 INFO L225 Difference]: With dead ends: 123 [2023-11-29 05:53:06,726 INFO L226 Difference]: Without dead ends: 62 [2023-11-29 05:53:06,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:53:06,733 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:53:06,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:53:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-29 05:53:06,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-29 05:53:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:53:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2023-11-29 05:53:06,773 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 45 [2023-11-29 05:53:06,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:53:06,774 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2023-11-29 05:53:06,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 05:53:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2023-11-29 05:53:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:53:06,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:53:06,777 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:53:06,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:53:06,777 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:53:06,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:53:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1465100467, now seen corresponding path program 1 times [2023-11-29 05:53:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:53:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737756079] [2023-11-29 05:53:06,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:53:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:06,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:53:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:06,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:53:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:07,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:53:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:07,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:53:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:07,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:53:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:07,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:53:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:07,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:53:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:53:07,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:53:07,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737756079] [2023-11-29 05:53:07,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737756079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:53:07,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:53:07,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:53:07,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740073952] [2023-11-29 05:53:07,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:53:07,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:53:07,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:53:07,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:53:07,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:53:07,125 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:53:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:53:07,461 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2023-11-29 05:53:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:53:07,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2023-11-29 05:53:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:53:07,464 INFO L225 Difference]: With dead ends: 123 [2023-11-29 05:53:07,465 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 05:53:07,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:53:07,467 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 39 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:53:07,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 105 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:53:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 05:53:07,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2023-11-29 05:53:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 40 states have internal predecessors, (48), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:53:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2023-11-29 05:53:07,480 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 50 [2023-11-29 05:53:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:53:07,480 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2023-11-29 05:53:07,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:53:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2023-11-29 05:53:07,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:53:07,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:53:07,482 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:53:07,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:53:07,482 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:53:07,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:53:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1442468213, now seen corresponding path program 1 times [2023-11-29 05:53:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:53:07,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885117982] [2023-11-29 05:53:07,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:07,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:53:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:07,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:53:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:07,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:53:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:07,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:53:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:07,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:53:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:07,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:53:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:07,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:53:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:53:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:53:07,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:53:07,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885117982] [2023-11-29 05:53:07,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885117982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:53:07,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:53:07,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:53:07,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814616977] [2023-11-29 05:53:07,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:53:07,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:53:07,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:53:07,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:53:07,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:53:07,922 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:53:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:53:08,382 INFO L93 Difference]: Finished difference Result 125 states and 158 transitions. [2023-11-29 05:53:08,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:53:08,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2023-11-29 05:53:08,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:53:08,384 INFO L225 Difference]: With dead ends: 125 [2023-11-29 05:53:08,385 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 05:53:08,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:53:08,387 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 56 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:53:08,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 146 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:53:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 05:53:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2023-11-29 05:53:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2023-11-29 05:53:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2023-11-29 05:53:08,399 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 50 [2023-11-29 05:53:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:53:08,399 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2023-11-29 05:53:08,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:53:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2023-11-29 05:53:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:53:08,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:53:08,402 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:53:08,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:53:08,402 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:53:08,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:53:08,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1739860081, now seen corresponding path program 1 times [2023-11-29 05:53:08,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:53:08,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430451712] [2023-11-29 05:53:08,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:08,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:53:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:08,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:53:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:08,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:53:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:08,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:53:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:08,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:53:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:08,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:53:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:08,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:53:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:08,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:53:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:53:08,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:53:08,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430451712] [2023-11-29 05:53:08,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430451712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:53:08,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:53:08,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:53:08,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886963080] [2023-11-29 05:53:08,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:53:08,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:53:08,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:53:08,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:53:08,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:53:08,964 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 05:53:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:53:09,360 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2023-11-29 05:53:09,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:53:09,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 50 [2023-11-29 05:53:09,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:53:09,362 INFO L225 Difference]: With dead ends: 78 [2023-11-29 05:53:09,362 INFO L226 Difference]: Without dead ends: 76 [2023-11-29 05:53:09,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:53:09,363 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 42 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:53:09,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 157 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:53:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-29 05:53:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2023-11-29 05:53:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 47 states have internal predecessors, (53), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-29 05:53:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2023-11-29 05:53:09,376 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 50 [2023-11-29 05:53:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:53:09,377 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2023-11-29 05:53:09,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 05:53:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2023-11-29 05:53:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:53:09,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:53:09,379 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:53:09,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:53:09,379 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:53:09,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:53:09,380 INFO L85 PathProgramCache]: Analyzing trace with hash 987045016, now seen corresponding path program 1 times [2023-11-29 05:53:09,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:53:09,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903540267] [2023-11-29 05:53:09,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:09,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:53:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:09,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:53:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:09,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:53:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:09,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:53:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:09,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:53:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:09,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:53:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:09,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:53:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:09,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:53:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:53:09,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:53:09,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903540267] [2023-11-29 05:53:09,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903540267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:53:09,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:53:09,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:53:09,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089544627] [2023-11-29 05:53:09,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:53:09,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:53:09,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:53:09,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:53:09,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:53:09,716 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:53:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:53:09,986 INFO L93 Difference]: Finished difference Result 130 states and 160 transitions. [2023-11-29 05:53:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:53:09,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2023-11-29 05:53:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:53:09,988 INFO L225 Difference]: With dead ends: 130 [2023-11-29 05:53:09,988 INFO L226 Difference]: Without dead ends: 74 [2023-11-29 05:53:09,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:53:09,990 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 34 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:53:09,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 104 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:53:09,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-29 05:53:09,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-29 05:53:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.2) internal successors, (54), 48 states have internal predecessors, (54), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-29 05:53:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2023-11-29 05:53:10,001 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 50 [2023-11-29 05:53:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:53:10,002 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2023-11-29 05:53:10,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:53:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2023-11-29 05:53:10,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 05:53:10,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:53:10,003 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:53:10,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:53:10,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:53:10,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:53:10,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1785489350, now seen corresponding path program 1 times [2023-11-29 05:53:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:53:10,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488889030] [2023-11-29 05:53:10,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:10,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:53:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:10,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:53:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:10,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:53:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:10,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:53:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:10,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:53:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:10,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:53:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:10,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:53:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:10,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:53:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:53:10,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:53:10,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488889030] [2023-11-29 05:53:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488889030] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:53:10,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474739580] [2023-11-29 05:53:10,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:10,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:53:10,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:53:10,358 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:53:10,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:53:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:10,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:53:10,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:53:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:53:10,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:53:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 05:53:10,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474739580] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:53:10,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:53:10,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 6] total 11 [2023-11-29 05:53:10,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058402405] [2023-11-29 05:53:10,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:53:10,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:53:10,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:53:10,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:53:10,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:53:10,753 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 05:53:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:53:10,828 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2023-11-29 05:53:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:53:10,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 51 [2023-11-29 05:53:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:53:10,830 INFO L225 Difference]: With dead ends: 117 [2023-11-29 05:53:10,830 INFO L226 Difference]: Without dead ends: 75 [2023-11-29 05:53:10,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:53:10,832 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 3 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:53:10,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 204 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:53:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-29 05:53:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-29 05:53:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 49 states have internal predecessors, (55), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-29 05:53:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2023-11-29 05:53:10,842 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 51 [2023-11-29 05:53:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:53:10,843 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2023-11-29 05:53:10,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 05:53:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2023-11-29 05:53:10,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 05:53:10,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:53:10,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:53:10,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:53:11,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:53:11,050 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:53:11,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:53:11,051 INFO L85 PathProgramCache]: Analyzing trace with hash 159910930, now seen corresponding path program 1 times [2023-11-29 05:53:11,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:53:11,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846873242] [2023-11-29 05:53:11,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:11,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:53:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:11,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:53:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:11,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:53:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:11,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:53:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:11,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:53:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:11,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:53:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:11,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:53:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:11,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:53:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 05:53:11,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:53:11,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846873242] [2023-11-29 05:53:11,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846873242] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:53:11,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519763705] [2023-11-29 05:53:11,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:11,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:53:11,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:53:11,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:53:11,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:53:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:11,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:53:11,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:53:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 05:53:11,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:53:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 05:53:11,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519763705] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:53:11,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:53:11,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-29 05:53:11,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983188140] [2023-11-29 05:53:11,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:53:11,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:53:11,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:53:11,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:53:11,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:53:11,861 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand has 11 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 05:53:12,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:53:12,349 INFO L93 Difference]: Finished difference Result 136 states and 168 transitions. [2023-11-29 05:53:12,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:53:12,352 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 53 [2023-11-29 05:53:12,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:53:12,353 INFO L225 Difference]: With dead ends: 136 [2023-11-29 05:53:12,354 INFO L226 Difference]: Without dead ends: 78 [2023-11-29 05:53:12,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:53:12,355 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 34 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:53:12,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 188 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:53:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-29 05:53:12,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-29 05:53:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.183673469387755) internal successors, (58), 52 states have internal predecessors, (58), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-29 05:53:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2023-11-29 05:53:12,367 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 53 [2023-11-29 05:53:12,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:53:12,367 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2023-11-29 05:53:12,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 05:53:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2023-11-29 05:53:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-29 05:53:12,368 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:53:12,369 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:53:12,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:53:12,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:53:12,572 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:53:12,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:53:12,572 INFO L85 PathProgramCache]: Analyzing trace with hash 821972964, now seen corresponding path program 2 times [2023-11-29 05:53:12,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:53:12,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539700179] [2023-11-29 05:53:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:12,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:53:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:12,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:53:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:12,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:53:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:12,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:53:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:12,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:53:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:12,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:53:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:12,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:53:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:13,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:53:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 05:53:13,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:53:13,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539700179] [2023-11-29 05:53:13,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539700179] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:53:13,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882851628] [2023-11-29 05:53:13,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:53:13,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:53:13,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:53:13,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:53:13,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:53:13,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:53:13,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:53:13,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 05:53:13,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:53:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 05:53:13,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:53:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 05:53:13,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882851628] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:53:13,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:53:13,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 5] total 17 [2023-11-29 05:53:13,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624335237] [2023-11-29 05:53:13,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:53:13,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 05:53:13,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:53:13,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:53:13,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:53:13,654 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 17 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 05:53:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:53:14,676 INFO L93 Difference]: Finished difference Result 154 states and 190 transitions. [2023-11-29 05:53:14,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 05:53:14,676 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 56 [2023-11-29 05:53:14,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:53:14,677 INFO L225 Difference]: With dead ends: 154 [2023-11-29 05:53:14,678 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 05:53:14,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2023-11-29 05:53:14,679 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 77 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:53:14,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 318 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:53:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 05:53:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2023-11-29 05:53:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 59 states have internal predecessors, (68), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-29 05:53:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2023-11-29 05:53:14,691 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 56 [2023-11-29 05:53:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:53:14,691 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2023-11-29 05:53:14,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 05:53:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2023-11-29 05:53:14,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 05:53:14,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:53:14,693 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:53:14,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:53:14,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:53:14,900 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:53:14,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:53:14,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1350686857, now seen corresponding path program 1 times [2023-11-29 05:53:14,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:53:14,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243826676] [2023-11-29 05:53:14,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:14,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:53:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:15,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:53:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:15,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:53:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:15,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:53:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:15,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:53:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:15,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:53:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:15,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:53:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:15,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:53:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:15,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:53:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:53:15,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:53:15,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243826676] [2023-11-29 05:53:15,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243826676] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:53:15,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942608982] [2023-11-29 05:53:15,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:15,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:53:15,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:53:15,512 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:53:15,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:53:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:15,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-29 05:53:15,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:53:15,841 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-29 05:53:15,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:53:15,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:53:15,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2023-11-29 05:53:15,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-29 05:53:15,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 25 [2023-11-29 05:53:15,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 05:53:15,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 05:53:15,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:53:15,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:53:15,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 05:53:15,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:53:15,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2023-11-29 05:53:15,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-29 05:53:15,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:53:15,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 05:53:16,277 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse1 (select .cse2 0)) (.cse0 (select .cse2 8))) (and (not (= .cse0 0)) (not (= .cse0 .cse1)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse1)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (not (= .cse0 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse4 (select v_DerPreprocessor_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse4))) (let ((.cse5 (select .cse3 0))) (and (= .cse3 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse4) 8 .cse5) 0 .cse5)) (not (= .cse4 .cse5)) (not (= .cse5 0)) (<= 2 .cse4))))))) is different from true [2023-11-29 05:53:16,663 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse8 (select v_DerPreprocessor_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse8))) (let ((.cse9 (select .cse7 0))) (and (= .cse7 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) .cse8) 8 .cse9) 0 .cse9)) (not (= .cse8 .cse9)) (not (= .cse9 0)) (<= 2 .cse8)))))))) (and (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse1 (select .cse2 0)) (.cse0 (select .cse2 8))) (and (not (= .cse0 0)) (not (= .cse0 .cse1)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse1)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (not (= .cse0 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|)))))) .cse3) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse4 (select .cse6 8)) (.cse5 (select .cse6 0))) (and (not (= .cse4 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse5)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse4)) (not (= .cse4 .cse5)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))))) .cse3))) is different from true [2023-11-29 05:53:16,980 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse12 (select v_DerPreprocessor_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse12))) (let ((.cse13 (select .cse11 0))) (and (= .cse11 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) .cse13 v_DerPreprocessor_2) .cse12) 8 .cse13) 0 .cse13)) (not (= .cse12 .cse13)) (not (= .cse13 0)) (<= 2 .cse12)))))))) (and (<= 2 |c_aws_linked_list_remove_~node#1.base|) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base|))) (let ((.cse0 (select .cse1 0))) (let ((.cse2 (not (= .cse0 |c_aws_linked_list_remove_~node#1.base|)))) (or (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (and (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |c_aws_linked_list_remove_~node#1.base|) 8 .cse0) 0 .cse0) .cse1) (= (select v_DerPreprocessor_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|))) (not (= .cse0 0)) .cse2) (let ((.cse3 (select .cse1 8))) (and (not (= .cse3 |c_aws_linked_list_remove_~node#1.base|)) (not (= .cse0 .cse3)) (not (= .cse3 0)) .cse2)))))) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse5 (select .cse6 0)) (.cse4 (select .cse6 8))) (and (not (= .cse4 0)) (not (= .cse4 .cse5)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse5)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (not (= .cse4 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|)))))) .cse7) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse8 (select .cse10 8)) (.cse9 (select .cse10 0))) (and (not (= .cse8 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse9)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse8)) (not (= .cse8 .cse9)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))))) .cse7) (= |c_aws_linked_list_remove_~node#1.offset| 0))) is different from true [2023-11-29 05:53:17,169 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse11 (select v_DerPreprocessor_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse11))) (let ((.cse12 (select .cse10 0))) (and (= .cse10 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) .cse11) 8 .cse12) 0 .cse12)) (not (= .cse11 .cse12)) (not (= .cse12 0)) (<= 2 .cse11)))))))) (and (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse1 (select .cse2 0)) (.cse0 (select .cse2 8))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse1)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse0)))))) .cse3) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse5 (select .cse6 0)) (.cse4 (select .cse6 8))) (and (not (= .cse4 0)) (not (= .cse4 .cse5)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse5)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (not (= .cse4 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|)))))) .cse3) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse7 (select .cse9 8)) (.cse8 (select .cse9 0))) (and (not (= .cse7 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse8)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse7)) (not (= .cse7 .cse8)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))))) .cse3))) is different from true [2023-11-29 05:53:17,700 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse15 (select v_DerPreprocessor_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| .cse15))) (let ((.cse16 (select .cse14 0))) (and (= .cse14 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse15 v_DerPreprocessor_1) .cse16 v_DerPreprocessor_2) .cse15) 8 .cse16) 0 .cse16)) (not (= .cse15 .cse16)) (not (= .cse16 0)) (<= 2 .cse15)))))))) (and (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse1 (select .cse2 0)) (.cse0 (select .cse2 8))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse1)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse0)))))) .cse3) (<= 2 |c_aws_linked_list_remove_~node#1.base|) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base|))) (let ((.cse4 (select .cse5 0))) (let ((.cse6 (not (= .cse4 |c_aws_linked_list_remove_~node#1.base|)))) (or (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (and (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |c_aws_linked_list_remove_~node#1.base|) 8 .cse4) 0 .cse4) .cse5) (= (select v_DerPreprocessor_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|))) (not (= .cse4 0)) .cse6) (let ((.cse7 (select .cse5 8))) (and (not (= .cse7 |c_aws_linked_list_remove_~node#1.base|)) (not (= .cse4 .cse7)) (not (= .cse7 0)) .cse6)))))) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse9 (select .cse10 0)) (.cse8 (select .cse10 8))) (and (not (= .cse8 0)) (not (= .cse8 .cse9)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse9)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (not (= .cse8 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|)))))) .cse3) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse11 (select .cse13 8)) (.cse12 (select .cse13 0))) (and (not (= .cse11 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse12)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse11)) (not (= .cse11 .cse12)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))))) .cse3) (= |c_aws_linked_list_remove_~node#1.offset| 0))) is different from true [2023-11-29 05:53:17,820 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse14 (select v_DerPreprocessor_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse14))) (let ((.cse15 (select .cse13 0))) (and (= .cse13 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse14 v_DerPreprocessor_1) .cse15 v_DerPreprocessor_2) .cse14) 8 .cse15) 0 .cse15)) (not (= .cse14 .cse15)) (not (= .cse15 0)) (<= 2 .cse14)))))))) (and (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse1 (select .cse2 0)) (.cse0 (select .cse2 8))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse1)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse0)))))) .cse3) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|))) (let ((.cse5 (select .cse6 0)) (.cse4 (select .cse6 8))) (and (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| .cse4)) (not (= .cse4 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| .cse5)) (not (= .cse5 .cse4)))))) .cse3) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse8 (select .cse9 0)) (.cse7 (select .cse9 8))) (and (not (= .cse7 0)) (not (= .cse7 .cse8)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse8)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (not (= .cse7 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|)))))) .cse3) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse10 (select .cse12 8)) (.cse11 (select .cse12 0))) (and (not (= .cse10 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse11)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse10)) (not (= .cse10 .cse11)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))))) .cse3))) is different from true [2023-11-29 05:53:18,317 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse18 (select v_DerPreprocessor_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse18))) (let ((.cse19 (select .cse17 0))) (and (= .cse17 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_1) .cse19 v_DerPreprocessor_2) .cse18) 8 .cse19) 0 .cse19)) (not (= .cse18 .cse19)) (not (= .cse19 0)) (<= 2 .cse18)))))))) (and (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse1 (select .cse2 0)) (.cse0 (select .cse2 8))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse1)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse0)))))) .cse3) (<= 2 |c_aws_linked_list_remove_~node#1.base|) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|))) (let ((.cse5 (select .cse6 0)) (.cse4 (select .cse6 8))) (and (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| .cse4)) (not (= .cse4 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| .cse5)) (not (= .cse5 .cse4)))))) .cse3) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base|))) (let ((.cse7 (select .cse8 0))) (let ((.cse9 (not (= .cse7 |c_aws_linked_list_remove_~node#1.base|)))) (or (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (and (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) |c_aws_linked_list_remove_~node#1.base|) 8 .cse7) 0 .cse7) .cse8) (= (select v_DerPreprocessor_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|))) (not (= .cse7 0)) .cse9) (let ((.cse10 (select .cse8 8))) (and (not (= .cse10 |c_aws_linked_list_remove_~node#1.base|)) (not (= .cse7 .cse10)) (not (= .cse10 0)) .cse9)))))) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse12 (select .cse13 0)) (.cse11 (select .cse13 8))) (and (not (= .cse11 0)) (not (= .cse11 .cse12)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse12)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (not (= .cse11 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|)))))) .cse3) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse14 (select .cse16 8)) (.cse15 (select .cse16 0))) (and (not (= .cse14 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse15)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse14)) (not (= .cse14 .cse15)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))))) .cse3) (= |c_aws_linked_list_remove_~node#1.offset| 0))) is different from true [2023-11-29 05:53:20,039 INFO L349 Elim1Store]: treesize reduction 814, result has 39.7 percent of original size [2023-11-29 05:53:20,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 56 case distinctions, treesize of input 820 treesize of output 1129 [2023-11-29 05:53:20,141 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 197 treesize of output 167 [2023-11-29 05:53:20,187 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 195 treesize of output 165 [2023-11-29 05:53:20,238 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 193 treesize of output 163 [2023-11-29 05:53:20,284 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 191 treesize of output 161 [2023-11-29 05:53:20,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2023-11-29 05:53:20,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2023-11-29 05:53:20,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2023-11-29 05:53:20,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2023-11-29 05:53:20,538 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 19 treesize of output 17 [2023-11-29 05:53:20,592 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 79 treesize of output 77 [2023-11-29 05:53:20,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 82 [2023-11-29 05:53:20,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 05:53:21,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 05:53:21,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 05:53:21,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 05:53:22,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 05:53:23,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 05:54:26,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-11-29 05:55:18,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 63 [2023-11-29 06:00:54,513 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 06:00:54,513 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 06:00:54,515 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 06:00:54,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 06:00:54,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:00:54,716 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-11-29 06:00:54,718 INFO L158 Benchmark]: Toolchain (without parser) took 471385.34ms. Allocated memory was 155.2MB in the beginning and 866.1MB in the end (delta: 710.9MB). Free memory was 102.7MB in the beginning and 552.2MB in the end (delta: -449.6MB). Peak memory consumption was 542.9MB. Max. memory is 16.1GB. [2023-11-29 06:00:54,718 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:00:54,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2024.16ms. Allocated memory was 155.2MB in the beginning and 199.2MB in the end (delta: 44.0MB). Free memory was 102.4MB in the beginning and 130.0MB in the end (delta: -27.6MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2023-11-29 06:00:54,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.02ms. Allocated memory is still 199.2MB. Free memory was 130.0MB in the beginning and 124.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:00:54,719 INFO L158 Benchmark]: Boogie Preprocessor took 68.35ms. Allocated memory is still 199.2MB. Free memory was 124.8MB in the beginning and 119.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 06:00:54,720 INFO L158 Benchmark]: RCFGBuilder took 563.24ms. Allocated memory is still 199.2MB. Free memory was 119.6MB in the beginning and 90.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-29 06:00:54,720 INFO L158 Benchmark]: TraceAbstraction took 468621.52ms. Allocated memory was 199.2MB in the beginning and 866.1MB in the end (delta: 666.9MB). Free memory was 90.2MB in the beginning and 552.2MB in the end (delta: -462.0MB). Peak memory consumption was 483.2MB. Max. memory is 16.1GB. [2023-11-29 06:00:54,722 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2024.16ms. Allocated memory was 155.2MB in the beginning and 199.2MB in the end (delta: 44.0MB). Free memory was 102.4MB in the beginning and 130.0MB in the end (delta: -27.6MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.02ms. Allocated memory is still 199.2MB. Free memory was 130.0MB in the beginning and 124.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.35ms. Allocated memory is still 199.2MB. Free memory was 124.8MB in the beginning and 119.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 563.24ms. Allocated memory is still 199.2MB. Free memory was 119.6MB in the beginning and 90.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 468621.52ms. Allocated memory was 199.2MB in the beginning and 866.1MB in the end (delta: 666.9MB). Free memory was 90.2MB in the beginning and 552.2MB in the end (delta: -462.0MB). Peak memory consumption was 483.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash aabf7ad166d752d3872d668e3b551e8cefeb907fee1d51e6917a6895600694bb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:00:56,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:00:56,484 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-29 06:00:56,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:00:56,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:00:56,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:00:56,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:00:56,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:00:56,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:00:56,518 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:00:56,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:00:56,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:00:56,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:00:56,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:00:56,521 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:00:56,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:00:56,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:00:56,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:00:56,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:00:56,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:00:56,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:00:56,525 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:00:56,525 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 06:00:56,526 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 06:00:56,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:00:56,527 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:00:56,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:00:56,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:00:56,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:00:56,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:00:56,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:00:56,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:00:56,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:00:56,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:00:56,530 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 06:00:56,530 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 06:00:56,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:00:56,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:00:56,531 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:00:56,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:00:56,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:00:56,532 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 06:00:56,532 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aabf7ad166d752d3872d668e3b551e8cefeb907fee1d51e6917a6895600694bb [2023-11-29 06:00:56,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:00:56,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:00:56,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:00:56,845 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:00:56,845 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:00:56,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i [2023-11-29 06:00:59,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:01:00,037 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:01:00,038 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i [2023-11-29 06:01:00,073 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/data/995a7a586/63fbf920b08b4f8a9bc62c66eb797ee9/FLAG839911a89 [2023-11-29 06:01:00,088 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/data/995a7a586/63fbf920b08b4f8a9bc62c66eb797ee9 [2023-11-29 06:01:00,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:01:00,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:01:00,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:01:00,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:01:00,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:01:00,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:01:00" (1/1) ... [2023-11-29 06:01:00,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c0d1fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:00, skipping insertion in model container [2023-11-29 06:01:00,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:01:00" (1/1) ... [2023-11-29 06:01:00,228 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:01:00,467 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2023-11-29 06:01:00,475 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2023-11-29 06:01:01,201 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,202 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,202 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,203 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,205 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,221 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,222 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,224 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,225 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,227 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,229 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,229 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,230 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,515 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 06:01:01,516 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 06:01:01,518 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 06:01:01,519 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 06:01:01,521 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 06:01:01,521 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 06:01:01,522 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 06:01:01,523 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 06:01:01,524 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 06:01:01,524 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 06:01:01,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:01:01,727 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 06:01:01,762 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:01:01,767 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2023-11-29 06:01:01,768 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2023-11-29 06:01:01,810 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,810 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,811 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,811 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,812 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,819 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,820 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,821 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,822 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,823 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,824 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,824 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,825 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,879 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 06:01:01,880 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 06:01:01,881 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 06:01:01,881 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 06:01:01,882 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 06:01:01,883 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 06:01:01,884 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 06:01:01,884 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 06:01:01,885 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 06:01:01,885 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 06:01:01,921 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:01:01,928 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:01:01,938 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2023-11-29 06:01:01,939 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2023-11-29 06:01:01,973 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,973 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,974 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,974 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,975 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,983 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,983 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,984 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,984 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,985 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,986 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,986 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:01,987 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:01:02,030 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 06:01:02,031 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 06:01:02,031 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 06:01:02,032 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 06:01:02,033 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 06:01:02,033 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 06:01:02,033 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 06:01:02,034 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 06:01:02,034 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 06:01:02,034 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 06:01:02,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:01:02,306 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,306 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,306 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,306 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,307 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,307 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,307 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,307 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,307 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,307 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,308 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,308 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,308 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,308 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,308 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:01:02,314 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:01:02,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:02 WrapperNode [2023-11-29 06:01:02,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:01:02,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:01:02,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:01:02,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:01:02,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:02" (1/1) ... [2023-11-29 06:01:02,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:02" (1/1) ... [2023-11-29 06:01:02,433 INFO L138 Inliner]: procedures = 697, calls = 1048, calls flagged for inlining = 49, calls inlined = 4, statements flattened = 88 [2023-11-29 06:01:02,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:01:02,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:01:02,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:01:02,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:01:02,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:02" (1/1) ... [2023-11-29 06:01:02,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:02" (1/1) ... [2023-11-29 06:01:02,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:02" (1/1) ... [2023-11-29 06:01:02,474 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 5, 23]. 77 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 7 writes are split as follows [0, 0, 7]. [2023-11-29 06:01:02,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:02" (1/1) ... [2023-11-29 06:01:02,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:02" (1/1) ... [2023-11-29 06:01:02,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:02" (1/1) ... [2023-11-29 06:01:02,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:02" (1/1) ... [2023-11-29 06:01:02,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:02" (1/1) ... [2023-11-29 06:01:02,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:02" (1/1) ... [2023-11-29 06:01:02,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:01:02,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:01:02,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:01:02,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:01:02,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:02" (1/1) ... [2023-11-29 06:01:02,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:01:02,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:01:02,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:01:02,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:01:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2023-11-29 06:01:02,588 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2023-11-29 06:01:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2023-11-29 06:01:02,589 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2023-11-29 06:01:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:01:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 06:01:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 06:01:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 06:01:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 06:01:02,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 06:01:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-29 06:01:02,590 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-29 06:01:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:01:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:01:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:01:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 06:01:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:01:02,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:01:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 06:01:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 06:01:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 06:01:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 06:01:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 06:01:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 06:01:02,591 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 06:01:02,592 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 06:01:02,592 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 06:01:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 06:01:02,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 06:01:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:01:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:01:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:01:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 06:01:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 06:01:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 06:01:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 06:01:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-29 06:01:02,593 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-29 06:01:02,814 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:01:02,816 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:01:03,219 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:01:03,258 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:01:03,258 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 06:01:03,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:01:03 BoogieIcfgContainer [2023-11-29 06:01:03,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:01:03,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:01:03,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:01:03,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:01:03,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:01:00" (1/3) ... [2023-11-29 06:01:03,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132a15fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:01:03, skipping insertion in model container [2023-11-29 06:01:03,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:01:02" (2/3) ... [2023-11-29 06:01:03,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132a15fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:01:03, skipping insertion in model container [2023-11-29 06:01:03,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:01:03" (3/3) ... [2023-11-29 06:01:03,268 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_remove_harness_negated.i [2023-11-29 06:01:03,287 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:01:03,287 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:01:03,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:01:03,342 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@635ed682, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:01:03,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:01:03,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 06:01:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 06:01:03,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:01:03,357 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:01:03,357 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:01:03,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:01:03,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1133169586, now seen corresponding path program 1 times [2023-11-29 06:01:03,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:01:03,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208226013] [2023-11-29 06:01:03,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:01:03,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:03,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:01:03,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:01:03,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 06:01:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:01:03,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 06:01:03,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:01:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 06:01:03,782 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:01:03,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:01:03,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208226013] [2023-11-29 06:01:03,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208226013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:01:03,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:01:03,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:01:03,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312002805] [2023-11-29 06:01:03,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:01:03,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:01:03,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:01:03,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:01:03,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:01:03,820 INFO L87 Difference]: Start difference. First operand has 64 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 06:01:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:01:03,973 INFO L93 Difference]: Finished difference Result 123 states and 176 transitions. [2023-11-29 06:01:03,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:01:03,976 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-11-29 06:01:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:01:03,984 INFO L225 Difference]: With dead ends: 123 [2023-11-29 06:01:03,984 INFO L226 Difference]: Without dead ends: 62 [2023-11-29 06:01:03,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:01:03,991 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:01:03,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:01:04,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-29 06:01:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-29 06:01:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 06:01:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2023-11-29 06:01:04,035 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 45 [2023-11-29 06:01:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:01:04,037 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2023-11-29 06:01:04,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 06:01:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2023-11-29 06:01:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 06:01:04,040 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:01:04,040 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:01:04,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:01:04,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:04,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:01:04,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:01:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1465100467, now seen corresponding path program 1 times [2023-11-29 06:01:04,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:01:04,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230883024] [2023-11-29 06:01:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:01:04,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:04,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:01:04,243 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:01:04,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 06:01:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:01:04,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:01:04,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:01:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 06:01:04,652 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:01:04,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:01:04,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230883024] [2023-11-29 06:01:04,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230883024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:01:04,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:01:04,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:01:04,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860408868] [2023-11-29 06:01:04,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:01:04,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:01:04,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:01:04,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:01:04,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:01:04,657 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 06:01:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:01:05,387 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2023-11-29 06:01:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:01:05,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2023-11-29 06:01:05,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:01:05,390 INFO L225 Difference]: With dead ends: 121 [2023-11-29 06:01:05,391 INFO L226 Difference]: Without dead ends: 66 [2023-11-29 06:01:05,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:01:05,393 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:01:05,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 337 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:01:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-29 06:01:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-11-29 06:01:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2023-11-29 06:01:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2023-11-29 06:01:05,408 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 50 [2023-11-29 06:01:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:01:05,409 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2023-11-29 06:01:05,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 06:01:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2023-11-29 06:01:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 06:01:05,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:01:05,411 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:01:05,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 06:01:05,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:05,616 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:01:05,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:01:05,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1739860081, now seen corresponding path program 1 times [2023-11-29 06:01:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:01:05,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565986317] [2023-11-29 06:01:05,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:01:05,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:05,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:01:05,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:01:05,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 06:01:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:01:05,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:01:05,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:01:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 06:01:05,906 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:01:05,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:01:05,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565986317] [2023-11-29 06:01:05,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565986317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:01:05,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:01:05,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:01:05,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878889918] [2023-11-29 06:01:05,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:01:05,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:01:05,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:01:05,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:01:05,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:01:05,909 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 06:01:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:01:06,205 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2023-11-29 06:01:06,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:01:06,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2023-11-29 06:01:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:01:06,207 INFO L225 Difference]: With dead ends: 116 [2023-11-29 06:01:06,208 INFO L226 Difference]: Without dead ends: 67 [2023-11-29 06:01:06,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:01:06,210 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:01:06,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 211 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:01:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-29 06:01:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-29 06:01:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2023-11-29 06:01:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2023-11-29 06:01:06,223 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 50 [2023-11-29 06:01:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:01:06,223 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2023-11-29 06:01:06,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 06:01:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2023-11-29 06:01:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 06:01:06,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:01:06,225 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:01:06,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 06:01:06,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:06,428 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:01:06,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:01:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash -941415747, now seen corresponding path program 1 times [2023-11-29 06:01:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:01:06,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904443145] [2023-11-29 06:01:06,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:01:06,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:06,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:01:06,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:01:06,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 06:01:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:01:06,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:01:06,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:01:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 06:01:06,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:01:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 06:01:06,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:01:06,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904443145] [2023-11-29 06:01:06,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904443145] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:01:06,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:01:06,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 06:01:06,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538951882] [2023-11-29 06:01:06,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:01:06,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:01:06,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:01:06,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:01:06,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:01:06,814 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 8 states, 6 states have (on average 6.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 06:01:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:01:07,217 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2023-11-29 06:01:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:01:07,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 51 [2023-11-29 06:01:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:01:07,220 INFO L225 Difference]: With dead ends: 120 [2023-11-29 06:01:07,220 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 06:01:07,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:01:07,222 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:01:07,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 210 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:01:07,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 06:01:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-11-29 06:01:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 46 states have internal predecessors, (54), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2023-11-29 06:01:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2023-11-29 06:01:07,236 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 51 [2023-11-29 06:01:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:01:07,237 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2023-11-29 06:01:07,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 06:01:07,237 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2023-11-29 06:01:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 06:01:07,238 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:01:07,238 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:01:07,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 06:01:07,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:07,439 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:01:07,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:01:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1767650063, now seen corresponding path program 2 times [2023-11-29 06:01:07,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:01:07,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724425096] [2023-11-29 06:01:07,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:01:07,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:07,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:01:07,442 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:01:07,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 06:01:07,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 06:01:07,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:01:07,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:01:07,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:01:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 06:01:07,691 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:01:07,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:01:07,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724425096] [2023-11-29 06:01:07,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724425096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:01:07,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:01:07,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:01:07,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492626024] [2023-11-29 06:01:07,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:01:07,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:01:07,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:01:07,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:01:07,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:01:07,694 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 06:01:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:01:08,166 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2023-11-29 06:01:08,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:01:08,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2023-11-29 06:01:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:01:08,168 INFO L225 Difference]: With dead ends: 80 [2023-11-29 06:01:08,168 INFO L226 Difference]: Without dead ends: 78 [2023-11-29 06:01:08,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:01:08,169 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 5 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:01:08,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 336 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:01:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-29 06:01:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2023-11-29 06:01:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 51 states have internal predecessors, (58), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-29 06:01:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2023-11-29 06:01:08,183 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 54 [2023-11-29 06:01:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:01:08,183 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2023-11-29 06:01:08,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 06:01:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2023-11-29 06:01:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 06:01:08,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:01:08,185 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:01:08,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 06:01:08,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:08,388 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:01:08,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:01:08,388 INFO L85 PathProgramCache]: Analyzing trace with hash 199587864, now seen corresponding path program 1 times [2023-11-29 06:01:08,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:01:08,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502383742] [2023-11-29 06:01:08,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:01:08,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:08,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:01:08,390 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:01:08,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 06:01:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:01:08,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:01:08,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:01:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 06:01:08,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:01:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 06:01:08,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:01:08,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502383742] [2023-11-29 06:01:08,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502383742] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:01:08,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:01:08,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 06:01:08,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734656577] [2023-11-29 06:01:08,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:01:08,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 06:01:08,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:01:08,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 06:01:08,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:01:08,934 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 06:01:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:01:09,945 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2023-11-29 06:01:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:01:09,946 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 54 [2023-11-29 06:01:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:01:09,947 INFO L225 Difference]: With dead ends: 140 [2023-11-29 06:01:09,947 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 06:01:09,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2023-11-29 06:01:09,949 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:01:09,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:01:09,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 06:01:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-29 06:01:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 57 states have internal predecessors, (64), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-29 06:01:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2023-11-29 06:01:09,962 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 54 [2023-11-29 06:01:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:01:09,962 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2023-11-29 06:01:09,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 06:01:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2023-11-29 06:01:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 06:01:09,964 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:01:09,964 INFO L195 NwaCegarLoop]: trace histogram [10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:01:09,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 06:01:10,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:10,165 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:01:10,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:01:10,165 INFO L85 PathProgramCache]: Analyzing trace with hash 191084888, now seen corresponding path program 2 times [2023-11-29 06:01:10,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:01:10,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538599920] [2023-11-29 06:01:10,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:01:10,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:10,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:01:10,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:01:10,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 06:01:10,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 06:01:10,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:01:10,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:01:10,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:01:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-11-29 06:01:10,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:01:10,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:01:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538599920] [2023-11-29 06:01:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538599920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:01:10,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:01:10,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:01:10,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434380571] [2023-11-29 06:01:10,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:01:10,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:01:10,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:01:10,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:01:10,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:01:10,375 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 06:01:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:01:10,651 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2023-11-29 06:01:10,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:01:10,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2023-11-29 06:01:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:01:10,653 INFO L225 Difference]: With dead ends: 129 [2023-11-29 06:01:10,653 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 06:01:10,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:01:10,655 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 5 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:01:10,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 205 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:01:10,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 06:01:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2023-11-29 06:01:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 58 states have internal predecessors, (65), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-29 06:01:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2023-11-29 06:01:10,667 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 60 [2023-11-29 06:01:10,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:01:10,667 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2023-11-29 06:01:10,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 06:01:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2023-11-29 06:01:10,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 06:01:10,669 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:01:10,669 INFO L195 NwaCegarLoop]: trace histogram [10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:01:10,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 06:01:10,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:10,870 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:01:10,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:01:10,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1240547620, now seen corresponding path program 1 times [2023-11-29 06:01:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:01:10,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387887860] [2023-11-29 06:01:10,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:01:10,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:10,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:01:10,872 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:01:10,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 06:01:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:01:11,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 06:01:11,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:01:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 06:01:11,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:01:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 06:01:11,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:01:11,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387887860] [2023-11-29 06:01:11,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387887860] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:01:11,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:01:11,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 06:01:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150454566] [2023-11-29 06:01:11,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:01:11,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 06:01:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:01:11,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 06:01:11,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2023-11-29 06:01:11,924 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 26 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 06:01:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:01:13,836 INFO L93 Difference]: Finished difference Result 148 states and 185 transitions. [2023-11-29 06:01:13,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 06:01:13,837 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2023-11-29 06:01:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:01:13,838 INFO L225 Difference]: With dead ends: 148 [2023-11-29 06:01:13,838 INFO L226 Difference]: Without dead ends: 90 [2023-11-29 06:01:13,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2023-11-29 06:01:13,840 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:01:13,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 832 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 06:01:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-29 06:01:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-29 06:01:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-29 06:01:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2023-11-29 06:01:13,851 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 62 [2023-11-29 06:01:13,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:01:13,852 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2023-11-29 06:01:13,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 06:01:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2023-11-29 06:01:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 06:01:13,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:01:13,854 INFO L195 NwaCegarLoop]: trace histogram [16, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:01:13,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 06:01:14,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:14,062 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:01:14,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:01:14,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1555710564, now seen corresponding path program 2 times [2023-11-29 06:01:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:01:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923287249] [2023-11-29 06:01:14,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:01:14,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:14,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:01:14,064 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:01:14,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 06:01:14,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:01:14,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:01:14,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:01:14,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:01:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-11-29 06:01:14,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:01:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-11-29 06:01:14,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:01:14,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923287249] [2023-11-29 06:01:14,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923287249] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:01:14,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:01:14,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 06:01:14,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237048174] [2023-11-29 06:01:14,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:01:14,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:01:14,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:01:14,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:01:14,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:01:14,618 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:01:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:01:15,068 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2023-11-29 06:01:15,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:01:15,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-11-29 06:01:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:01:15,070 INFO L225 Difference]: With dead ends: 147 [2023-11-29 06:01:15,070 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 06:01:15,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:01:15,072 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 18 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:01:15,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 283 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:01:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 06:01:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2023-11-29 06:01:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 70 states have internal predecessors, (80), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-29 06:01:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2023-11-29 06:01:15,083 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 68 [2023-11-29 06:01:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:01:15,083 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2023-11-29 06:01:15,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 06:01:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2023-11-29 06:01:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-29 06:01:15,085 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:01:15,085 INFO L195 NwaCegarLoop]: trace histogram [16, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:01:15,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 06:01:15,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:15,285 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:01:15,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:01:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash 107886821, now seen corresponding path program 1 times [2023-11-29 06:01:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:01:15,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871164414] [2023-11-29 06:01:15,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:01:15,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:01:15,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:01:15,287 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:01:15,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3605bded-3054-489c-be79-bc2ca16c8657/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 06:01:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:01:15,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 06:01:15,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:01:15,755 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 12 treesize of output 8 [2023-11-29 06:01:15,778 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 23 treesize of output 22 [2023-11-29 06:01:15,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:01:15,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2023-11-29 06:01:15,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:01:15,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2023-11-29 06:01:16,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:01:16,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 61 [2023-11-29 06:01:16,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:01:16,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 63 treesize of output 74 [2023-11-29 06:01:16,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:01:16,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 87 [2023-11-29 06:01:16,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:01:16,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 83 treesize of output 100 [2023-11-29 06:01:16,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:01:16,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 93 treesize of output 113 [2023-11-29 06:01:17,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:01:17,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 103 treesize of output 126 [2023-11-29 06:01:17,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:01:17,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 113 treesize of output 139 [2023-11-29 06:01:18,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:01:18,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 123 treesize of output 152 [2023-11-29 06:01:18,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:01:18,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 133 treesize of output 165 [2023-11-29 06:01:19,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:01:19,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 143 treesize of output 178 [2023-11-29 06:01:20,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:01:20,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 153 treesize of output 191 [2023-11-29 06:01:20,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:01:20,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 163 treesize of output 204 [2023-11-29 06:02:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 06:02:21,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:05:24,848 WARN L293 SmtUtils]: Spent 3.02m on a formula simplification. DAG size of input: 183 DAG size of output: 181 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-29 06:06:41,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 100 [2023-11-29 06:06:41,480 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 209 treesize of output 207 [2023-11-29 06:06:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 122 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 06:06:43,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:43,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871164414] [2023-11-29 06:06:43,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871164414] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:06:43,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:06:43,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 45 [2023-11-29 06:06:43,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477443657] [2023-11-29 06:06:43,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:06:43,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-29 06:06:43,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:43,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-29 06:06:43,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1461, Unknown=28, NotChecked=0, Total=1980 [2023-11-29 06:06:43,343 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 45 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 44 states have internal predecessors, (75), 4 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 06:06:48,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:06:53,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:06:57,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:07:01,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:07:05,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:07:09,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:07:14,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:07:18,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:07:22,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:07:26,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:07:31,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]