./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --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 bcbdd24aa3539f554995115754c17957131f4a70e9c01f3bd768b3e606eed4d4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 10:55:02,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:55:02,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:55:02,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:55:02,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:55:02,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:55:02,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:55:02,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:55:02,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:55:02,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:55:02,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:55:02,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:55:02,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:55:02,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:55:02,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:55:02,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:55:02,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:55:02,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:55:02,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:55:02,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:55:02,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:55:02,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:55:02,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:55:02,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:55:03,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:55:03,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:55:03,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:55:03,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:55:03,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:55:03,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:55:03,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:55:03,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:55:03,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:55:03,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:55:03,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:55:03,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:55:03,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:55:03,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:55:03,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:55:03,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:55:03,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:55:03,023 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 10:55:03,067 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:55:03,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:55:03,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:55:03,069 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:55:03,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:55:03,070 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:55:03,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:55:03,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:55:03,071 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:55:03,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:55:03,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:55:03,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:55:03,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 10:55:03,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:55:03,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 10:55:03,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 10:55:03,073 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:55:03,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 10:55:03,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:55:03,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:55:03,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:55:03,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:55:03,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:55:03,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:55:03,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 10:55:03,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 10:55:03,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 10:55:03,076 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 10:55:03,076 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 10:55:03,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 10:55:03,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> bcbdd24aa3539f554995115754c17957131f4a70e9c01f3bd768b3e606eed4d4 [2022-11-16 10:55:03,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:55:03,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:55:03,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:55:03,359 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:55:03,360 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:55:03,362 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2022-11-16 10:55:03,438 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/data/ec1bb6886/0a071c828c0240a58059fd1928058cd0/FLAG710e3f60b [2022-11-16 10:55:04,162 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:55:04,164 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2022-11-16 10:55:04,204 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/data/ec1bb6886/0a071c828c0240a58059fd1928058cd0/FLAG710e3f60b [2022-11-16 10:55:04,243 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/data/ec1bb6886/0a071c828c0240a58059fd1928058cd0 [2022-11-16 10:55:04,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:55:04,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:55:04,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:55:04,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:55:04,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:55:04,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:55:04" (1/1) ... [2022-11-16 10:55:04,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3904a74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:04, skipping insertion in model container [2022-11-16 10:55:04,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:55:04" (1/1) ... [2022-11-16 10:55:04,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:55:04,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:55:04,668 WARN L229 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_05c07925-9a99-4339-a97b-52eaef2fb368/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2022-11-16 10:55:04,676 WARN L229 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_05c07925-9a99-4339-a97b-52eaef2fb368/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2022-11-16 10:55:05,557 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:05,558 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:05,559 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:05,560 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:05,561 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:05,575 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:05,576 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:05,579 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:05,580 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:05,582 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:05,583 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:05,584 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:05,585 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:05,973 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 10:55:05,979 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 10:55:05,981 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 10:55:05,984 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 10:55:05,986 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 10:55:05,987 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 10:55:05,988 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 10:55:05,989 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 10:55:05,990 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 10:55:05,993 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 10:55:06,139 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 10:55:06,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:55:06,200 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:55:06,218 WARN L229 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_05c07925-9a99-4339-a97b-52eaef2fb368/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2022-11-16 10:55:06,218 WARN L229 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_05c07925-9a99-4339-a97b-52eaef2fb368/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2022-11-16 10:55:06,267 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:06,267 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:06,268 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:06,268 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:06,269 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:06,278 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:06,278 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:06,280 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:06,280 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:06,282 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:06,282 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:06,283 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:06,283 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 10:55:06,356 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 10:55:06,357 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 10:55:06,358 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 10:55:06,359 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 10:55:06,360 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 10:55:06,360 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 10:55:06,361 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 10:55:06,361 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 10:55:06,362 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 10:55:06,362 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 10:55:06,404 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 10:55:06,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:55:06,680 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:55:06,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:06 WrapperNode [2022-11-16 10:55:06,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:55:06,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:55:06,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:55:06,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:55:06,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:06" (1/1) ... [2022-11-16 10:55:06,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:06" (1/1) ... [2022-11-16 10:55:06,827 INFO L138 Inliner]: procedures = 679, calls = 1046, calls flagged for inlining = 52, calls inlined = 8, statements flattened = 225 [2022-11-16 10:55:06,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:55:06,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:55:06,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:55:06,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:55:06,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:06" (1/1) ... [2022-11-16 10:55:06,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:06" (1/1) ... [2022-11-16 10:55:06,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:06" (1/1) ... [2022-11-16 10:55:06,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:06" (1/1) ... [2022-11-16 10:55:06,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:06" (1/1) ... [2022-11-16 10:55:06,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:06" (1/1) ... [2022-11-16 10:55:06,870 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:06" (1/1) ... [2022-11-16 10:55:06,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:06" (1/1) ... [2022-11-16 10:55:06,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:55:06,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:55:06,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:55:06,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:55:06,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:06" (1/1) ... [2022-11-16 10:55:06,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:55:06,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:06,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:55:06,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:55:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2022-11-16 10:55:06,985 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2022-11-16 10:55:06,986 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2022-11-16 10:55:06,986 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2022-11-16 10:55:06,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 10:55:06,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 10:55:06,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 10:55:06,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 10:55:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-16 10:55:06,989 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-16 10:55:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 10:55:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-16 10:55:06,990 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-16 10:55:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:55:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 10:55:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:55:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:55:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-11-16 10:55:06,992 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-11-16 10:55:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-16 10:55:06,992 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-16 10:55:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 10:55:06,993 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 10:55:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 10:55:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 10:55:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 10:55:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-16 10:55:06,994 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-16 10:55:06,994 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-16 10:55:06,994 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-16 10:55:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 10:55:07,312 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:55:07,314 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:55:07,718 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:55:07,733 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:55:07,734 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-16 10:55:07,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:55:07 BoogieIcfgContainer [2022-11-16 10:55:07,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:55:07,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:55:07,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:55:07,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:55:07,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:55:04" (1/3) ... [2022-11-16 10:55:07,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e8268d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:55:07, skipping insertion in model container [2022-11-16 10:55:07,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:06" (2/3) ... [2022-11-16 10:55:07,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e8268d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:55:07, skipping insertion in model container [2022-11-16 10:55:07,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:55:07" (3/3) ... [2022-11-16 10:55:07,749 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_back_harness.i [2022-11-16 10:55:07,768 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:55:07,768 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 10:55:07,830 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:55:07,840 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=LoopsAndPotentialCycles, 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;@4741a291, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:55:07,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 10:55:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-11-16 10:55:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 10:55:07,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:07,861 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 10:55:07,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:55:07,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:07,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1579343520, now seen corresponding path program 1 times [2022-11-16 10:55:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:07,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933295820] [2022-11-16 10:55:07,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:07,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 10:55:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 10:55:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 10:55:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 10:55:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 10:55:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 10:55:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 10:55:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 10:55:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 10:55:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 10:55:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:08,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 10:55:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:09,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 10:55:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-11-16 10:55:09,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:09,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933295820] [2022-11-16 10:55:09,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933295820] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:09,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872528429] [2022-11-16 10:55:09,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:09,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:09,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:09,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:09,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 10:55:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:09,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 10:55:09,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-16 10:55:09,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:55:09,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872528429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:09,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 10:55:09,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-16 10:55:09,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897213571] [2022-11-16 10:55:09,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:09,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:55:09,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:09,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:55:09,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:55:09,469 INFO L87 Difference]: Start difference. First operand has 137 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 10:55:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:09,610 INFO L93 Difference]: Finished difference Result 274 states and 414 transitions. [2022-11-16 10:55:09,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:55:09,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2022-11-16 10:55:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:09,638 INFO L225 Difference]: With dead ends: 274 [2022-11-16 10:55:09,638 INFO L226 Difference]: Without dead ends: 140 [2022-11-16 10:55:09,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:55:09,650 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 12 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:09,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 536 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 10:55:09,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-16 10:55:09,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2022-11-16 10:55:09,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 86 states have (on average 1.244186046511628) internal successors, (107), 87 states have internal predecessors, (107), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-16 10:55:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 180 transitions. [2022-11-16 10:55:09,706 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 180 transitions. Word has length 116 [2022-11-16 10:55:09,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:09,708 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 180 transitions. [2022-11-16 10:55:09,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 10:55:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 180 transitions. [2022-11-16 10:55:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 10:55:09,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:09,711 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 10:55:09,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:09,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-16 10:55:09,918 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:55:09,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash -183799078, now seen corresponding path program 1 times [2022-11-16 10:55:09,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:09,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333435799] [2022-11-16 10:55:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:09,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 10:55:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 10:55:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 10:55:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 10:55:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 10:55:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 10:55:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 10:55:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 10:55:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 10:55:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 10:55:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 10:55:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 10:55:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-11-16 10:55:10,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:10,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333435799] [2022-11-16 10:55:10,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333435799] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:10,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388326806] [2022-11-16 10:55:10,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:10,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:10,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:10,335 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:10,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 10:55:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 10:55:10,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-16 10:55:10,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:55:10,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388326806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:10,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 10:55:10,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-16 10:55:10,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134877212] [2022-11-16 10:55:10,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:10,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:55:10,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:10,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:55:10,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:55:10,591 INFO L87 Difference]: Start difference. First operand 134 states and 180 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 10:55:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:10,639 INFO L93 Difference]: Finished difference Result 252 states and 345 transitions. [2022-11-16 10:55:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:55:10,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2022-11-16 10:55:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:10,647 INFO L225 Difference]: With dead ends: 252 [2022-11-16 10:55:10,648 INFO L226 Difference]: Without dead ends: 138 [2022-11-16 10:55:10,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:55:10,651 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 3 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:10,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 520 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 10:55:10,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-16 10:55:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2022-11-16 10:55:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 90 states have internal predecessors, (110), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-16 10:55:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 183 transitions. [2022-11-16 10:55:10,672 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 183 transitions. Word has length 116 [2022-11-16 10:55:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:10,673 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 183 transitions. [2022-11-16 10:55:10,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 10:55:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 183 transitions. [2022-11-16 10:55:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 10:55:10,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:10,680 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 10:55:10,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:10,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:10,880 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:55:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:10,881 INFO L85 PathProgramCache]: Analyzing trace with hash -543175276, now seen corresponding path program 1 times [2022-11-16 10:55:10,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:10,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503961100] [2022-11-16 10:55:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:10,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 10:55:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 10:55:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 10:55:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 10:55:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 10:55:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 10:55:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 10:55:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 10:55:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 10:55:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 10:55:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 10:55:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 10:55:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-11-16 10:55:12,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:12,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503961100] [2022-11-16 10:55:12,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503961100] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:12,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254001369] [2022-11-16 10:55:12,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:12,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:12,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:12,459 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:12,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 10:55:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:12,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 10:55:12,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:12,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:12,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-16 10:55:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-16 10:55:13,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:55:13,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254001369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:13,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 10:55:13,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2022-11-16 10:55:13,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214265450] [2022-11-16 10:55:13,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:13,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 10:55:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:13,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 10:55:13,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-11-16 10:55:13,628 INFO L87 Difference]: Start difference. First operand 137 states and 183 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-16 10:55:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:13,847 INFO L93 Difference]: Finished difference Result 327 states and 440 transitions. [2022-11-16 10:55:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 10:55:13,848 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 116 [2022-11-16 10:55:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:13,857 INFO L225 Difference]: With dead ends: 327 [2022-11-16 10:55:13,857 INFO L226 Difference]: Without dead ends: 203 [2022-11-16 10:55:13,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 134 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-11-16 10:55:13,861 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 64 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:13,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1097 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 126 Unchecked, 0.1s Time] [2022-11-16 10:55:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-16 10:55:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 169. [2022-11-16 10:55:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 114 states have internal predecessors, (136), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 41 states have call predecessors, (43), 42 states have call successors, (43) [2022-11-16 10:55:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 222 transitions. [2022-11-16 10:55:13,899 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 222 transitions. Word has length 116 [2022-11-16 10:55:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:13,900 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 222 transitions. [2022-11-16 10:55:13,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-16 10:55:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 222 transitions. [2022-11-16 10:55:13,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 10:55:13,910 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:13,911 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:13,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:14,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:14,117 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:55:14,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1369878566, now seen corresponding path program 1 times [2022-11-16 10:55:14,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:14,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073971368] [2022-11-16 10:55:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:14,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:14,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:14,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 10:55:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 10:55:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:14,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:14,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 10:55:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:14,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 10:55:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:14,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:14,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 10:55:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:14,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 10:55:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:15,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 10:55:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:15,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 10:55:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:15,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 10:55:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:15,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 10:55:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:15,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:15,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 10:55:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:15,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 10:55:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-11-16 10:55:15,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:15,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073971368] [2022-11-16 10:55:15,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073971368] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:15,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405189663] [2022-11-16 10:55:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:15,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:15,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:15,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:15,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 10:55:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:15,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 10:55:15,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:15,718 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 10:55:15,719 INFO L350 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-16 10:55:15,736 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 10:55:15,736 INFO L350 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-16 10:55:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 105 proven. 17 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-16 10:55:17,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:55:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-16 10:55:18,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405189663] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:55:18,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 10:55:18,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 12] total 28 [2022-11-16 10:55:18,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918620599] [2022-11-16 10:55:18,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 10:55:18,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 10:55:18,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:18,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 10:55:18,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2022-11-16 10:55:18,094 INFO L87 Difference]: Start difference. First operand 169 states and 222 transitions. Second operand has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 10 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-16 10:55:21,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:21,064 INFO L93 Difference]: Finished difference Result 438 states and 614 transitions. [2022-11-16 10:55:21,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-16 10:55:21,066 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 10 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) Word has length 116 [2022-11-16 10:55:21,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:21,069 INFO L225 Difference]: With dead ends: 438 [2022-11-16 10:55:21,069 INFO L226 Difference]: Without dead ends: 317 [2022-11-16 10:55:21,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 245 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=370, Invalid=1886, Unknown=0, NotChecked=0, Total=2256 [2022-11-16 10:55:21,072 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 347 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 2575 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 372 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:21,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 2575 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1213 Invalid, 0 Unknown, 372 Unchecked, 1.4s Time] [2022-11-16 10:55:21,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-16 10:55:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 222. [2022-11-16 10:55:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 149 states have (on average 1.1879194630872483) internal successors, (177), 153 states have internal predecessors, (177), 54 states have call successors, (54), 16 states have call predecessors, (54), 18 states have return successors, (67), 52 states have call predecessors, (67), 53 states have call successors, (67) [2022-11-16 10:55:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 298 transitions. [2022-11-16 10:55:21,109 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 298 transitions. Word has length 116 [2022-11-16 10:55:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:21,110 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 298 transitions. [2022-11-16 10:55:21,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 10 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-16 10:55:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 298 transitions. [2022-11-16 10:55:21,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 10:55:21,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:21,113 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 10:55:21,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:21,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:21,324 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:55:21,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:21,325 INFO L85 PathProgramCache]: Analyzing trace with hash -552701722, now seen corresponding path program 1 times [2022-11-16 10:55:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:21,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746030604] [2022-11-16 10:55:21,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:21,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 10:55:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 10:55:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 10:55:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 10:55:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 10:55:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 10:55:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 10:55:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 10:55:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 10:55:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 10:55:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 10:55:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 10:55:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-11-16 10:55:21,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:21,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746030604] [2022-11-16 10:55:21,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746030604] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:21,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544040339] [2022-11-16 10:55:21,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:21,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:21,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:21,819 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:21,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 10:55:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:22,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-16 10:55:22,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:22,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-16 10:55:22,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-16 10:55:22,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:22,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:22,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-16 10:55:22,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:22,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:22,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-16 10:55:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-11-16 10:55:24,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:55:24,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544040339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:24,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 10:55:24,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2022-11-16 10:55:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417042773] [2022-11-16 10:55:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:24,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 10:55:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 10:55:24,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-11-16 10:55:24,013 INFO L87 Difference]: Start difference. First operand 222 states and 298 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-11-16 10:55:24,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:24,370 INFO L93 Difference]: Finished difference Result 468 states and 648 transitions. [2022-11-16 10:55:24,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 10:55:24,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 116 [2022-11-16 10:55:24,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:24,377 INFO L225 Difference]: With dead ends: 468 [2022-11-16 10:55:24,378 INFO L226 Difference]: Without dead ends: 351 [2022-11-16 10:55:24,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 120 SyntacticMatches, 20 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-11-16 10:55:24,380 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 46 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:24,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1035 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 148 Unchecked, 0.2s Time] [2022-11-16 10:55:24,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-16 10:55:24,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 311. [2022-11-16 10:55:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 211 states have (on average 1.1753554502369667) internal successors, (248), 218 states have internal predecessors, (248), 72 states have call successors, (72), 22 states have call predecessors, (72), 27 states have return successors, (101), 70 states have call predecessors, (101), 71 states have call successors, (101) [2022-11-16 10:55:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 421 transitions. [2022-11-16 10:55:24,450 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 421 transitions. Word has length 116 [2022-11-16 10:55:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:24,451 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 421 transitions. [2022-11-16 10:55:24,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-11-16 10:55:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 421 transitions. [2022-11-16 10:55:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-16 10:55:24,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:24,454 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2022-11-16 10:55:24,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-16 10:55:24,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:24,661 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:55:24,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1991074974, now seen corresponding path program 1 times [2022-11-16 10:55:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:24,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252801603] [2022-11-16 10:55:24,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:24,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 10:55:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 10:55:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 10:55:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 10:55:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 10:55:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 10:55:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 10:55:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 10:55:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-16 10:55:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-16 10:55:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 10:55:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 10:55:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:25,007 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-11-16 10:55:25,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:25,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252801603] [2022-11-16 10:55:25,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252801603] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:25,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673824874] [2022-11-16 10:55:25,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:25,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:25,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:25,012 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:25,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 10:55:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:25,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 10:55:25,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-16 10:55:25,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:55:25,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673824874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:25,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 10:55:25,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2022-11-16 10:55:25,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402006016] [2022-11-16 10:55:25,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:25,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 10:55:25,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:25,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 10:55:25,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-16 10:55:25,349 INFO L87 Difference]: Start difference. First operand 311 states and 421 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 10:55:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:25,678 INFO L93 Difference]: Finished difference Result 477 states and 657 transitions. [2022-11-16 10:55:25,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:55:25,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 118 [2022-11-16 10:55:25,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:25,681 INFO L225 Difference]: With dead ends: 477 [2022-11-16 10:55:25,681 INFO L226 Difference]: Without dead ends: 316 [2022-11-16 10:55:25,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-11-16 10:55:25,683 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 215 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:25,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 739 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:55:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-11-16 10:55:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2022-11-16 10:55:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 214 states have (on average 1.1728971962616823) internal successors, (251), 223 states have internal predecessors, (251), 72 states have call successors, (72), 22 states have call predecessors, (72), 29 states have return successors, (119), 70 states have call predecessors, (119), 71 states have call successors, (119) [2022-11-16 10:55:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 442 transitions. [2022-11-16 10:55:25,735 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 442 transitions. Word has length 118 [2022-11-16 10:55:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:25,737 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 442 transitions. [2022-11-16 10:55:25,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 10:55:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 442 transitions. [2022-11-16 10:55:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-16 10:55:25,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:25,741 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2022-11-16 10:55:25,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:25,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 10:55:25,948 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:55:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash 341810658, now seen corresponding path program 2 times [2022-11-16 10:55:25,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:25,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987031466] [2022-11-16 10:55:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:25,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 10:55:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 10:55:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 10:55:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 10:55:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 10:55:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 10:55:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 10:55:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 10:55:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-16 10:55:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-16 10:55:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 10:55:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 10:55:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-11-16 10:55:26,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:26,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987031466] [2022-11-16 10:55:26,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987031466] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:26,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094694641] [2022-11-16 10:55:26,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:55:26,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:26,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:26,350 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:26,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 10:55:26,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 10:55:26,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:55:26,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 10:55:26,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-16 10:55:26,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:55:26,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094694641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:26,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 10:55:26,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-11-16 10:55:26,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019898668] [2022-11-16 10:55:26,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:26,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 10:55:26,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:26,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 10:55:26,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-11-16 10:55:26,719 INFO L87 Difference]: Start difference. First operand 316 states and 442 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-16 10:55:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:27,116 INFO L93 Difference]: Finished difference Result 449 states and 618 transitions. [2022-11-16 10:55:27,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:55:27,116 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 118 [2022-11-16 10:55:27,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:27,119 INFO L225 Difference]: With dead ends: 449 [2022-11-16 10:55:27,119 INFO L226 Difference]: Without dead ends: 313 [2022-11-16 10:55:27,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-11-16 10:55:27,121 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 231 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:27,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 842 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:55:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-16 10:55:27,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-11-16 10:55:27,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 212 states have (on average 1.169811320754717) internal successors, (248), 220 states have internal predecessors, (248), 72 states have call successors, (72), 22 states have call predecessors, (72), 28 states have return successors, (109), 70 states have call predecessors, (109), 71 states have call successors, (109) [2022-11-16 10:55:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 429 transitions. [2022-11-16 10:55:27,153 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 429 transitions. Word has length 118 [2022-11-16 10:55:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:27,153 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 429 transitions. [2022-11-16 10:55:27,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-16 10:55:27,154 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 429 transitions. [2022-11-16 10:55:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-16 10:55:27,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:27,158 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2022-11-16 10:55:27,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:27,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 10:55:27,365 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:55:27,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:27,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1492302642, now seen corresponding path program 1 times [2022-11-16 10:55:27,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:27,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322519071] [2022-11-16 10:55:27,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:27,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 10:55:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 10:55:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 10:55:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 10:55:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 10:55:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 10:55:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 10:55:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 10:55:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-16 10:55:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-16 10:55:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 10:55:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 10:55:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-11-16 10:55:27,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:27,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322519071] [2022-11-16 10:55:27,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322519071] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:27,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657302177] [2022-11-16 10:55:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:27,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:27,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:27,713 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:27,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 10:55:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:27,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-16 10:55:27,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:27,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 10:55:28,127 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 10:55:28,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 10:55:28,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 10:55:28,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 10:55:28,231 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-11-16 10:55:28,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 99 [2022-11-16 10:55:28,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:28,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 71 [2022-11-16 10:55:28,261 INFO L350 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 16 treesize of output 15 [2022-11-16 10:55:28,367 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21|))) (let ((.cse0 (select .cse1 0))) (and (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| v_DerPreprocessor_2) .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21|)) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)))))) is different from true [2022-11-16 10:55:28,583 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21|))) (let ((.cse0 (select .cse1 0))) (and (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| v_DerPreprocessor_2) .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21|)) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22|)) (= (select v_DerPreprocessor_4 24) (select .cse3 24)) (not (= .cse2 0)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22| v_DerPreprocessor_4) .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22| v_DerPreprocessor_4) .cse2))))))) is different from true [2022-11-16 10:55:28,956 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21|))) (let ((.cse0 (select .cse1 0))) (and (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| v_DerPreprocessor_2) .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21|)) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22|)) (= (select v_DerPreprocessor_4 24) (select .cse3 24)) (not (= .cse2 0)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22| v_DerPreprocessor_4) .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22| v_DerPreprocessor_4) .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18|))) (let ((.cse4 (select .cse5 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18| v_DerPreprocessor_6) .cse4 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18| v_DerPreprocessor_6) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (not (= .cse4 0)) (= (select .cse5 24) (select v_DerPreprocessor_6 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18| .cse4))))))) is different from true [2022-11-16 10:55:29,490 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_19| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_19|))) (let ((.cse0 (select .cse1 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_19| v_DerPreprocessor_6) .cse0 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_19| v_DerPreprocessor_6) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_19|)) (= (select .cse1 24) (select v_DerPreprocessor_6 24)) (not (= .cse0 0)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21|))) (let ((.cse2 (select .cse3 0))) (and (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| v_DerPreprocessor_2) .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| v_DerPreprocessor_2) .cse2)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21|)) (not (= .cse2 0)) (= (select .cse3 24) (select v_DerPreprocessor_2 24)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22|))) (let ((.cse4 (select .cse5 0))) (and (not (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22|)) (= (select v_DerPreprocessor_4 24) (select .cse5 24)) (not (= .cse4 0)) (= (select |c_#memory_$Pointer$.base| .cse4) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22| v_DerPreprocessor_4) .cse4 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22| v_DerPreprocessor_4) .cse4)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18|))) (let ((.cse6 (select .cse7 0))) (and (not (= .cse6 0)) (= (select .cse7 24) (select v_DerPreprocessor_8 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18| v_DerPreprocessor_8) .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18| v_DerPreprocessor_8) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18| .cse6))))))) is different from true [2022-11-16 10:55:29,978 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21|))) (let ((.cse0 (select .cse1 0))) (and (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21| v_DerPreprocessor_2) .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_21|)) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22|)) (= (select v_DerPreprocessor_4 24) (select .cse3 24)) (not (= .cse2 0)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22| v_DerPreprocessor_4) .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_22| v_DerPreprocessor_4) .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18|))) (let ((.cse4 (select .cse5 0))) (and (not (= .cse4 0)) (= (select .cse5 24) (select v_DerPreprocessor_8 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18| v_DerPreprocessor_8) .cse4 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18| v_DerPreprocessor_8) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_18| .cse4)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_20| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_20|))) (let ((.cse6 (select .cse7 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_20| v_DerPreprocessor_6) .cse6 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_20| v_DerPreprocessor_6) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= .cse6 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_20|)) (not (= .cse6 0)) (= (select .cse7 24) (select v_DerPreprocessor_6 24)))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_19| Int) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_19|))) (let ((.cse8 (select .cse9 0))) (and (not (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_19|)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_19| v_DerPreprocessor_10) .cse8 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_19| v_DerPreprocessor_10) .cse8) (select |c_#memory_$Pointer$.base| .cse8)) (= (select .cse9 24) (select v_DerPreprocessor_10 24)) (not (= .cse8 0))))))) is different from true [2022-11-16 10:55:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 45 not checked. [2022-11-16 10:55:31,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:55:32,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_654 Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) v_ArrVal_654)) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset|) 0))) is different from false [2022-11-16 10:55:32,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:32,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-11-16 10:55:32,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:32,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 156 [2022-11-16 10:55:32,096 INFO L350 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 144 treesize of output 140 [2022-11-16 10:55:32,106 INFO L350 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 140 treesize of output 138 [2022-11-16 10:55:32,226 INFO L350 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 24 treesize of output 22 [2022-11-16 10:55:32,237 INFO L350 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 6 treesize of output 4 [2022-11-16 10:55:32,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:32,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 91 [2022-11-16 10:55:32,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657302177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:32,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:55:32,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 21] total 25 [2022-11-16 10:55:32,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510026149] [2022-11-16 10:55:32,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:55:32,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 10:55:32,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:32,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 10:55:32,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=24, NotChecked=342, Total=1122 [2022-11-16 10:55:32,706 INFO L87 Difference]: Start difference. First operand 313 states and 429 transitions. Second operand has 25 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 11 states have call successors, (31), 8 states have call predecessors, (31), 10 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-11-16 10:55:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:34,471 INFO L93 Difference]: Finished difference Result 601 states and 814 transitions. [2022-11-16 10:55:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-16 10:55:34,472 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 11 states have call successors, (31), 8 states have call predecessors, (31), 10 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) Word has length 118 [2022-11-16 10:55:34,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:34,474 INFO L225 Difference]: With dead ends: 601 [2022-11-16 10:55:34,474 INFO L226 Difference]: Without dead ends: 301 [2022-11-16 10:55:34,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=170, Invalid=1604, Unknown=56, NotChecked=522, Total=2352 [2022-11-16 10:55:34,477 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 48 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 3229 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2032 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:34,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 3229 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 2032 Unchecked, 0.4s Time] [2022-11-16 10:55:34,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-16 10:55:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 256. [2022-11-16 10:55:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 175 states have (on average 1.16) internal successors, (203), 179 states have internal predecessors, (203), 55 states have call successors, (55), 24 states have call predecessors, (55), 25 states have return successors, (66), 52 states have call predecessors, (66), 54 states have call successors, (66) [2022-11-16 10:55:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 324 transitions. [2022-11-16 10:55:34,525 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 324 transitions. Word has length 118 [2022-11-16 10:55:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:34,525 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 324 transitions. [2022-11-16 10:55:34,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 11 states have call successors, (31), 8 states have call predecessors, (31), 10 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-11-16 10:55:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 324 transitions. [2022-11-16 10:55:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-16 10:55:34,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:34,528 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2022-11-16 10:55:34,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-16 10:55:34,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:34,734 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:55:34,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:34,735 INFO L85 PathProgramCache]: Analyzing trace with hash -267467697, now seen corresponding path program 1 times [2022-11-16 10:55:34,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:34,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622543638] [2022-11-16 10:55:34,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:34,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 10:55:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 10:55:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 10:55:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 10:55:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 10:55:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 10:55:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 10:55:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-16 10:55:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 10:55:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 10:55:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 10:55:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 10:55:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-11-16 10:55:35,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:35,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622543638] [2022-11-16 10:55:35,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622543638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:35,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387772222] [2022-11-16 10:55:35,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:35,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:35,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:35,130 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:35,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 10:55:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 10:55:35,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-16 10:55:35,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:55:35,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387772222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:35,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 10:55:35,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-11-16 10:55:35,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970996565] [2022-11-16 10:55:35,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:35,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 10:55:35,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:35,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 10:55:35,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-11-16 10:55:35,494 INFO L87 Difference]: Start difference. First operand 256 states and 324 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 10:55:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:35,896 INFO L93 Difference]: Finished difference Result 431 states and 570 transitions. [2022-11-16 10:55:35,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:55:35,896 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 120 [2022-11-16 10:55:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:35,898 INFO L225 Difference]: With dead ends: 431 [2022-11-16 10:55:35,898 INFO L226 Difference]: Without dead ends: 268 [2022-11-16 10:55:35,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-16 10:55:35,900 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 252 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:35,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 850 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:55:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-16 10:55:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 261. [2022-11-16 10:55:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 179 states have (on average 1.1620111731843576) internal successors, (208), 184 states have internal predecessors, (208), 55 states have call successors, (55), 24 states have call predecessors, (55), 26 states have return successors, (69), 52 states have call predecessors, (69), 54 states have call successors, (69) [2022-11-16 10:55:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 332 transitions. [2022-11-16 10:55:35,926 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 332 transitions. Word has length 120 [2022-11-16 10:55:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:35,927 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 332 transitions. [2022-11-16 10:55:35,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 10:55:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 332 transitions. [2022-11-16 10:55:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-16 10:55:35,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:35,929 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2022-11-16 10:55:35,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:36,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-16 10:55:36,140 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:55:36,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1914003673, now seen corresponding path program 1 times [2022-11-16 10:55:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:36,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363019655] [2022-11-16 10:55:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:36,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 10:55:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 10:55:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 10:55:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 10:55:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 10:55:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 10:55:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 10:55:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 10:55:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 10:55:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 10:55:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 10:55:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-16 10:55:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-11-16 10:55:36,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:36,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363019655] [2022-11-16 10:55:36,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363019655] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:36,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232456035] [2022-11-16 10:55:36,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:36,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:36,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:36,506 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:36,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 10:55:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:36,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 10:55:36,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:36,759 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-16 10:55:36,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:55:36,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232456035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:36,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 10:55:36,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-16 10:55:36,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428145031] [2022-11-16 10:55:36,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:36,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:36,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:36,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:36,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:55:36,762 INFO L87 Difference]: Start difference. First operand 261 states and 332 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 10:55:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:36,796 INFO L93 Difference]: Finished difference Result 435 states and 580 transitions. [2022-11-16 10:55:36,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:36,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2022-11-16 10:55:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:36,799 INFO L225 Difference]: With dead ends: 435 [2022-11-16 10:55:36,799 INFO L226 Difference]: Without dead ends: 267 [2022-11-16 10:55:36,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:55:36,800 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 6 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:36,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 352 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 10:55:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-16 10:55:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 262. [2022-11-16 10:55:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 180 states have (on average 1.1611111111111112) internal successors, (209), 185 states have internal predecessors, (209), 55 states have call successors, (55), 24 states have call predecessors, (55), 26 states have return successors, (69), 52 states have call predecessors, (69), 54 states have call successors, (69) [2022-11-16 10:55:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 333 transitions. [2022-11-16 10:55:36,827 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 333 transitions. Word has length 121 [2022-11-16 10:55:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:36,827 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 333 transitions. [2022-11-16 10:55:36,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 10:55:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 333 transitions. [2022-11-16 10:55:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-16 10:55:36,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:36,830 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:36,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:37,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 10:55:37,036 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:55:37,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:37,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1363735611, now seen corresponding path program 1 times [2022-11-16 10:55:37,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:37,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991391816] [2022-11-16 10:55:37,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:37,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 10:55:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 10:55:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 10:55:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 10:55:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 10:55:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 10:55:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 10:55:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-16 10:55:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 10:55:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 10:55:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 10:55:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 10:55:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-11-16 10:55:37,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:37,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991391816] [2022-11-16 10:55:37,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991391816] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:37,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197127886] [2022-11-16 10:55:37,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:37,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:37,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:37,476 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:37,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 10:55:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:37,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-16 10:55:37,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-16 10:55:37,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:55:37,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197127886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:37,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 10:55:37,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 14 [2022-11-16 10:55:37,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783432752] [2022-11-16 10:55:37,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:37,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 10:55:37,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:37,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 10:55:37,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-16 10:55:37,971 INFO L87 Difference]: Start difference. First operand 262 states and 333 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-16 10:55:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:38,531 INFO L93 Difference]: Finished difference Result 434 states and 568 transitions. [2022-11-16 10:55:38,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 10:55:38,532 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 129 [2022-11-16 10:55:38,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:38,534 INFO L225 Difference]: With dead ends: 434 [2022-11-16 10:55:38,534 INFO L226 Difference]: Without dead ends: 265 [2022-11-16 10:55:38,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2022-11-16 10:55:38,536 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 180 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:38,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1283 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 10:55:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-16 10:55:38,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2022-11-16 10:55:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 181 states have (on average 1.160220994475138) internal successors, (210), 186 states have internal predecessors, (210), 55 states have call successors, (55), 24 states have call predecessors, (55), 26 states have return successors, (69), 52 states have call predecessors, (69), 54 states have call successors, (69) [2022-11-16 10:55:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 334 transitions. [2022-11-16 10:55:38,564 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 334 transitions. Word has length 129 [2022-11-16 10:55:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:38,565 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 334 transitions. [2022-11-16 10:55:38,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-16 10:55:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 334 transitions. [2022-11-16 10:55:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-16 10:55:38,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:38,568 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:38,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:38,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:38,774 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:55:38,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1006833748, now seen corresponding path program 1 times [2022-11-16 10:55:38,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:38,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851850505] [2022-11-16 10:55:38,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:38,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 10:55:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 10:55:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 10:55:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 10:55:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-16 10:55:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-16 10:55:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-16 10:55:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 10:55:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 10:55:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-16 10:55:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:55:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 10:55:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 10:55:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,501 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-11-16 10:55:39,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:39,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851850505] [2022-11-16 10:55:39,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851850505] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:39,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355414624] [2022-11-16 10:55:39,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:39,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:39,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:39,503 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:39,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 10:55:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-16 10:55:39,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:39,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 10:55:40,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 10:55:40,092 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 10:55:40,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 10:55:40,097 INFO L350 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 [2022-11-16 10:55:40,118 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 10:55:40,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 10:55:40,205 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 10:55:40,210 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2022-11-16 10:55:40,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:40,228 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 10:55:40,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 42 [2022-11-16 10:55:40,242 INFO L350 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 [2022-11-16 10:55:40,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:40,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:40,384 INFO L321 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2022-11-16 10:55:40,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 53 [2022-11-16 10:55:40,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:40,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2022-11-16 10:56:04,972 WARN L233 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:56:07,219 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_36| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_36|) 0))) (and (not (= .cse0 0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_36|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (<= (+ (select (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) 2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_36|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_36| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_36|) 0))) (and (not (= .cse1 0)) (<= (+ .cse1 2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_36|))))) is different from true [2022-11-16 10:56:09,511 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) 0))) (and (not (= .cse0 0)) (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) 0))) (and (not (= .cse1 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| .cse1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|)) (not (= .cse1 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|)))))) is different from true [2022-11-16 10:56:11,747 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) 0))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) 0))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (<= (+ (select (select |c_#memory_$Pointer$.base| .cse1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) 2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|)) (not (= .cse1 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|)) (not (= .cse1 0)))))) is different from true [2022-11-16 10:56:13,930 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| .cse0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|)) (not (= 0 .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) 0))) (and (not (= 0 .cse1)) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|))))) is different from true [2022-11-16 10:56:20,055 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:56:28,319 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:56:34,449 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:56:41,996 WARN L233 SmtUtils]: Spent 7.30s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:56:50,104 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:56:50,197 INFO L321 Elim1Store]: treesize reduction 151, result has 0.7 percent of original size [2022-11-16 10:56:50,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 1 [2022-11-16 10:56:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 112 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 41 not checked. [2022-11-16 10:56:50,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:57:08,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:57:08,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 45 [2022-11-16 10:57:08,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:57:08,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 473 treesize of output 463 [2022-11-16 10:57:08,423 INFO L350 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 852 treesize of output 834 [2022-11-16 10:57:08,438 INFO L350 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 938 treesize of output 922 [2022-11-16 10:57:08,456 INFO L350 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 922 treesize of output 918 [2022-11-16 10:57:08,705 INFO L350 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 24 treesize of output 22 [2022-11-16 10:57:08,755 INFO L350 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 6 treesize of output 4 [2022-11-16 10:57:08,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:57:08,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 65 [2022-11-16 10:57:13,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355414624] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:57:13,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:57:13,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19] total 25 [2022-11-16 10:57:13,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507334644] [2022-11-16 10:57:13,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:57:13,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 10:57:13,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:57:13,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 10:57:13,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=863, Unknown=38, NotChecked=252, Total=1260 [2022-11-16 10:57:13,310 INFO L87 Difference]: Start difference. First operand 263 states and 334 transitions. Second operand has 25 states, 25 states have (on average 5.2) internal successors, (130), 25 states have internal predecessors, (130), 9 states have call successors, (33), 8 states have call predecessors, (33), 9 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) [2022-11-16 10:57:24,290 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:57:34,391 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:57:44,467 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:57:56,797 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:58:06,900 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:58:19,071 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:58:29,174 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:58:30,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:30,101 INFO L93 Difference]: Finished difference Result 623 states and 919 transitions. [2022-11-16 10:58:30,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 10:58:30,101 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.2) internal successors, (130), 25 states have internal predecessors, (130), 9 states have call successors, (33), 8 states have call predecessors, (33), 9 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) Word has length 135 [2022-11-16 10:58:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:30,105 INFO L225 Difference]: With dead ends: 623 [2022-11-16 10:58:30,105 INFO L226 Difference]: Without dead ends: 436 [2022-11-16 10:58:30,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 270 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 166.6s TimeCoverageRelationStatistics Valid=224, Invalid=1729, Unknown=43, NotChecked=356, Total=2352 [2022-11-16 10:58:30,107 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 159 mSDsluCounter, 3217 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 3533 SdHoareTripleChecker+Invalid, 3947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3035 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:30,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 3533 Invalid, 3947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 860 Invalid, 0 Unknown, 3035 Unchecked, 1.1s Time] [2022-11-16 10:58:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-11-16 10:58:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 331. [2022-11-16 10:58:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 232 states have (on average 1.1594827586206897) internal successors, (269), 237 states have internal predecessors, (269), 65 states have call successors, (65), 32 states have call predecessors, (65), 33 states have return successors, (77), 61 states have call predecessors, (77), 64 states have call successors, (77) [2022-11-16 10:58:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 411 transitions. [2022-11-16 10:58:30,153 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 411 transitions. Word has length 135 [2022-11-16 10:58:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:30,154 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 411 transitions. [2022-11-16 10:58:30,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.2) internal successors, (130), 25 states have internal predecessors, (130), 9 states have call successors, (33), 8 states have call predecessors, (33), 9 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) [2022-11-16 10:58:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 411 transitions. [2022-11-16 10:58:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-16 10:58:30,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:30,157 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:30,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 10:58:30,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:58:30,363 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:58:30,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:30,364 INFO L85 PathProgramCache]: Analyzing trace with hash 435065786, now seen corresponding path program 1 times [2022-11-16 10:58:30,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:30,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803394609] [2022-11-16 10:58:30,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:30,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:58:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 10:58:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 10:58:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:58:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 10:58:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 10:58:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:58:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 10:58:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 10:58:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:58:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 10:58:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 10:58:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 10:58:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-16 10:58:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:58:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-16 10:58:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 10:58:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-11-16 10:58:30,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:30,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803394609] [2022-11-16 10:58:30,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803394609] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:58:30,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548403459] [2022-11-16 10:58:30,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:30,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:58:30,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:58:30,799 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:58:30,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 10:58:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:31,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-16 10:58:31,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:31,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 10:58:31,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 10:58:31,449 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 10:58:31,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 10:58:31,457 INFO L350 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 [2022-11-16 10:58:31,484 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 10:58:31,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 10:58:31,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 10:58:31,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:58:31,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:58:31,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-16 10:58:31,618 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 10:58:31,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 10:58:31,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2022-11-16 10:58:31,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:58:31,773 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-16 10:58:31,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 44 [2022-11-16 10:58:32,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:58:32,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:58:32,015 INFO L350 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 48 treesize of output 39 [2022-11-16 10:58:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 112 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-16 10:58:34,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:58:38,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:58:38,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2022-11-16 10:58:38,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:58:38,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-11-16 10:58:38,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:58:38,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2022-11-16 10:58:38,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:58:38,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-11-16 10:58:38,544 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:58:38,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 9963 treesize of output 9861 [2022-11-16 10:58:38,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:58:38,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11759 treesize of output 11269 [2022-11-16 10:58:38,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:58:38,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12221 treesize of output 11979 [2022-11-16 10:58:39,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:58:39,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12213 treesize of output 12127 [2022-11-16 10:58:41,284 INFO L350 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 6 treesize of output 4 [2022-11-16 10:58:41,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:58:41,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 144 [2022-11-16 10:58:41,478 INFO L350 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 142 treesize of output 140 [2022-11-16 10:58:41,621 INFO L350 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 8 treesize of output 6 [2022-11-16 10:58:41,633 INFO L350 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 8 treesize of output 6 [2022-11-16 10:58:41,644 INFO L350 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 8 treesize of output 6 [2022-11-16 10:58:41,656 INFO L350 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 8 treesize of output 6 [2022-11-16 10:58:41,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:58:41,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2022-11-16 10:58:41,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:58:41,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 166 [2022-11-16 10:58:43,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548403459] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:58:43,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:58:43,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16] total 20 [2022-11-16 10:58:43,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296677263] [2022-11-16 10:58:43,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:58:43,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 10:58:43,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:58:43,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 10:58:43,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=886, Unknown=3, NotChecked=0, Total=992 [2022-11-16 10:58:43,011 INFO L87 Difference]: Start difference. First operand 331 states and 411 transitions. Second operand has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 8 states have call predecessors, (31), 8 states have call successors, (31) [2022-11-16 10:58:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:43,650 INFO L93 Difference]: Finished difference Result 570 states and 717 transitions. [2022-11-16 10:58:43,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 10:58:43,651 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 8 states have call predecessors, (31), 8 states have call successors, (31) Word has length 138 [2022-11-16 10:58:43,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:43,653 INFO L225 Difference]: With dead ends: 570 [2022-11-16 10:58:43,654 INFO L226 Difference]: Without dead ends: 363 [2022-11-16 10:58:43,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 262 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=142, Invalid=1337, Unknown=3, NotChecked=0, Total=1482 [2022-11-16 10:58:43,656 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 55 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 688 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:43,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 2395 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 688 Unchecked, 0.2s Time] [2022-11-16 10:58:43,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-11-16 10:58:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 353. [2022-11-16 10:58:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 250 states have (on average 1.156) internal successors, (289), 254 states have internal predecessors, (289), 68 states have call successors, (68), 35 states have call predecessors, (68), 34 states have return successors, (77), 63 states have call predecessors, (77), 67 states have call successors, (77) [2022-11-16 10:58:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 434 transitions. [2022-11-16 10:58:43,698 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 434 transitions. Word has length 138 [2022-11-16 10:58:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:43,698 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 434 transitions. [2022-11-16 10:58:43,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 8 states have call predecessors, (31), 8 states have call successors, (31) [2022-11-16 10:58:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 434 transitions. [2022-11-16 10:58:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-16 10:58:43,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:43,701 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:58:43,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 10:58:43,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 10:58:43,913 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:58:43,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:43,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1124373789, now seen corresponding path program 1 times [2022-11-16 10:58:43,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:58:43,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133921287] [2022-11-16 10:58:43,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:43,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:58:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:58:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 10:58:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 10:58:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:58:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 10:58:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 10:58:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:58:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 10:58:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 10:58:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:58:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 10:58:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 10:58:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:58:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 10:58:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 10:58:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 10:58:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 10:58:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 10:58:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-16 10:58:44,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:58:44,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133921287] [2022-11-16 10:58:44,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133921287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:58:44,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769725512] [2022-11-16 10:58:44,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:44,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:58:44,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:58:44,346 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:58:44,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 10:58:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:44,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 139 conjunts are in the unsatisfiable core [2022-11-16 10:58:44,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:44,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-16 10:58:44,770 INFO L350 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 6 treesize of output 5 [2022-11-16 10:58:44,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-16 10:58:44,789 INFO L350 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 6 treesize of output 5 [2022-11-16 10:58:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 157 proven. 11 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-16 10:58:48,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:59:02,068 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:59:12,233 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:59:14,048 INFO L321 Elim1Store]: treesize reduction 23, result has 86.1 percent of original size [2022-11-16 10:59:14,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 5594 treesize of output 5353 [2022-11-16 10:59:14,541 INFO L321 Elim1Store]: treesize reduction 23, result has 89.1 percent of original size [2022-11-16 10:59:14,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 34282 treesize of output 31859 [2022-11-16 10:59:15,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:59:15,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 31672 treesize of output 30004 [2022-11-16 10:59:15,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:59:15,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37092 treesize of output 35378 [2022-11-16 10:59:16,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:59:16,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 40631 treesize of output 39612 [2022-11-16 10:59:19,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:59:19,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 37444 treesize of output 37267 [2022-11-16 11:00:29,062 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-16 11:00:29,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:00:29,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 11:00:29,263 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Maybe an infinite loop at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) 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.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-16 11:00:29,266 INFO L158 Benchmark]: Toolchain (without parser) took 325015.58ms. Allocated memory was 90.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 64.8MB in the beginning and 932.4MB in the end (delta: -867.6MB). Peak memory consumption was 750.3MB. Max. memory is 16.1GB. [2022-11-16 11:00:29,266 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 90.2MB. Free memory was 67.2MB in the beginning and 67.1MB in the end (delta: 101.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:00:29,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2429.10ms. Allocated memory was 90.2MB in the beginning and 134.2MB in the end (delta: 44.0MB). Free memory was 64.5MB in the beginning and 72.5MB in the end (delta: -8.0MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2022-11-16 11:00:29,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 152.37ms. Allocated memory is still 134.2MB. Free memory was 72.5MB in the beginning and 66.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 11:00:29,267 INFO L158 Benchmark]: Boogie Preprocessor took 43.14ms. Allocated memory is still 134.2MB. Free memory was 66.2MB in the beginning and 62.8MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:00:29,267 INFO L158 Benchmark]: RCFGBuilder took 858.06ms. Allocated memory is still 134.2MB. Free memory was 62.8MB in the beginning and 69.7MB in the end (delta: -6.9MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2022-11-16 11:00:29,268 INFO L158 Benchmark]: TraceAbstraction took 321527.04ms. Allocated memory was 134.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 68.9MB in the beginning and 932.4MB in the end (delta: -863.5MB). Peak memory consumption was 711.0MB. Max. memory is 16.1GB. [2022-11-16 11:00:29,269 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 90.2MB. Free memory was 67.2MB in the beginning and 67.1MB in the end (delta: 101.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2429.10ms. Allocated memory was 90.2MB in the beginning and 134.2MB in the end (delta: 44.0MB). Free memory was 64.5MB in the beginning and 72.5MB in the end (delta: -8.0MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 152.37ms. Allocated memory is still 134.2MB. Free memory was 72.5MB in the beginning and 66.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.14ms. Allocated memory is still 134.2MB. Free memory was 66.2MB in the beginning and 62.8MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 858.06ms. Allocated memory is still 134.2MB. Free memory was 62.8MB in the beginning and 69.7MB in the end (delta: -6.9MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * TraceAbstraction took 321527.04ms. Allocated memory was 134.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 68.9MB in the beginning and 932.4MB in the end (delta: -863.5MB). Peak memory consumption was 711.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Maybe an infinite loop de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Maybe an infinite loop: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:130) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-16 11:00:29,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --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 bcbdd24aa3539f554995115754c17957131f4a70e9c01f3bd768b3e606eed4d4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:00:31,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:00:31,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:00:31,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:00:31,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:00:31,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:00:31,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:00:31,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:00:31,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:00:31,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:00:31,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:00:31,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:00:31,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:00:31,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:00:31,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:00:31,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:00:31,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:00:31,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:00:31,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:00:31,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:00:31,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:00:31,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:00:31,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:00:31,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:00:31,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:00:31,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:00:31,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:00:31,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:00:31,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:00:31,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:00:31,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:00:31,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:00:31,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:00:31,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:00:31,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:00:31,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:00:31,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:00:31,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:00:31,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:00:31,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:00:31,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:00:31,643 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-16 11:00:31,682 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:00:31,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:00:31,684 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:00:31,684 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:00:31,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:00:31,685 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:00:31,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:00:31,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:00:31,687 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:00:31,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:00:31,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:00:31,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:00:31,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:00:31,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:00:31,690 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:00:31,691 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:00:31,691 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:00:31,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:00:31,691 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:00:31,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:00:31,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:00:31,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:00:31,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:00:31,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:00:31,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:00:31,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:00:31,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:00:31,694 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:00:31,695 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:00:31,695 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:00:31,695 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:00:31,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:00:31,696 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:00:31,696 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> bcbdd24aa3539f554995115754c17957131f4a70e9c01f3bd768b3e606eed4d4 [2022-11-16 11:00:32,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:00:32,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:00:32,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:00:32,154 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:00:32,156 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:00:32,158 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2022-11-16 11:00:32,234 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/data/dbf3afab6/81ca6781a0da4674bd02b0076a31cc56/FLAG0cfa9a399 [2022-11-16 11:00:33,011 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:00:33,013 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2022-11-16 11:00:33,044 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/data/dbf3afab6/81ca6781a0da4674bd02b0076a31cc56/FLAG0cfa9a399 [2022-11-16 11:00:33,105 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/data/dbf3afab6/81ca6781a0da4674bd02b0076a31cc56 [2022-11-16 11:00:33,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:00:33,111 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:00:33,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:00:33,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:00:33,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:00:33,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:00:33" (1/1) ... [2022-11-16 11:00:33,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2115acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:00:33, skipping insertion in model container [2022-11-16 11:00:33,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:00:33" (1/1) ... [2022-11-16 11:00:33,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:00:33,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:00:33,603 WARN L229 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_05c07925-9a99-4339-a97b-52eaef2fb368/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2022-11-16 11:00:33,610 WARN L229 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_05c07925-9a99-4339-a97b-52eaef2fb368/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2022-11-16 11:00:34,748 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:34,749 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:34,749 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:34,751 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:34,752 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:34,776 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:34,779 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:34,783 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:34,783 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:34,787 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:34,789 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:34,790 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:34,791 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,202 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 11:00:35,204 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 11:00:35,205 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 11:00:35,206 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 11:00:35,207 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 11:00:35,208 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 11:00:35,209 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 11:00:35,209 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 11:00:35,210 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 11:00:35,211 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 11:00:35,329 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 11:00:35,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:00:35,386 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-16 11:00:35,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:00:35,431 WARN L229 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_05c07925-9a99-4339-a97b-52eaef2fb368/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2022-11-16 11:00:35,431 WARN L229 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_05c07925-9a99-4339-a97b-52eaef2fb368/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2022-11-16 11:00:35,515 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,520 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,520 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,521 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,522 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,528 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,534 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,535 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,536 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,537 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,541 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,542 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,542 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,589 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 11:00:35,590 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 11:00:35,591 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 11:00:35,593 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 11:00:35,624 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 11:00:35,625 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 11:00:35,626 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 11:00:35,627 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 11:00:35,627 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 11:00:35,628 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 11:00:35,654 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 11:00:35,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:00:35,693 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:00:35,719 WARN L229 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_05c07925-9a99-4339-a97b-52eaef2fb368/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2022-11-16 11:00:35,720 WARN L229 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_05c07925-9a99-4339-a97b-52eaef2fb368/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2022-11-16 11:00:35,771 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,771 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,771 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,772 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,772 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,781 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,781 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,783 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,783 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,784 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,785 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,785 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,786 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:00:35,847 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 11:00:35,848 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 11:00:35,848 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 11:00:35,849 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 11:00:35,851 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 11:00:35,851 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 11:00:35,852 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 11:00:35,852 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 11:00:35,853 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 11:00:35,853 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 11:00:35,885 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 11:00:35,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:00:36,205 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:00:36,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:00:36 WrapperNode [2022-11-16 11:00:36,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:00:36,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:00:36,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:00:36,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:00:36,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:00:36" (1/1) ... [2022-11-16 11:00:36,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:00:36" (1/1) ... [2022-11-16 11:00:36,399 INFO L138 Inliner]: procedures = 698, calls = 1046, calls flagged for inlining = 52, calls inlined = 8, statements flattened = 226 [2022-11-16 11:00:36,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:00:36,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:00:36,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:00:36,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:00:36,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:00:36" (1/1) ... [2022-11-16 11:00:36,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:00:36" (1/1) ... [2022-11-16 11:00:36,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:00:36" (1/1) ... [2022-11-16 11:00:36,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:00:36" (1/1) ... [2022-11-16 11:00:36,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:00:36" (1/1) ... [2022-11-16 11:00:36,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:00:36" (1/1) ... [2022-11-16 11:00:36,454 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:00:36" (1/1) ... [2022-11-16 11:00:36,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:00:36" (1/1) ... [2022-11-16 11:00:36,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:00:36,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:00:36,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:00:36,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:00:36,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:00:36" (1/1) ... [2022-11-16 11:00:36,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:00:36,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:00:36,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:00:36,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:00:36,552 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2022-11-16 11:00:36,552 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2022-11-16 11:00:36,552 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2022-11-16 11:00:36,553 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2022-11-16 11:00:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:00:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:00:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 11:00:36,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 11:00:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-16 11:00:36,555 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-16 11:00:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:00:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-16 11:00:36,556 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-16 11:00:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:00:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:00:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:00:36,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:00:36,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-16 11:00:36,572 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-11-16 11:00:36,572 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-11-16 11:00:36,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-16 11:00:36,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-16 11:00:36,573 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 11:00:36,573 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 11:00:36,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:00:36,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:00:36,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 11:00:36,574 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-16 11:00:36,574 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-16 11:00:36,574 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-16 11:00:36,574 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-16 11:00:37,024 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:00:37,031 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:00:37,672 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:00:37,678 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:00:37,679 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-16 11:00:37,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:00:37 BoogieIcfgContainer [2022-11-16 11:00:37,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:00:37,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:00:37,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:00:37,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:00:37,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:00:33" (1/3) ... [2022-11-16 11:00:37,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9de2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:00:37, skipping insertion in model container [2022-11-16 11:00:37,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:00:36" (2/3) ... [2022-11-16 11:00:37,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9de2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:00:37, skipping insertion in model container [2022-11-16 11:00:37,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:00:37" (3/3) ... [2022-11-16 11:00:37,698 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_back_harness.i [2022-11-16 11:00:37,716 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:00:37,717 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:00:37,787 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:00:37,798 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=LoopsAndPotentialCycles, 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;@7b453ea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:00:37,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:00:37,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-11-16 11:00:37,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 11:00:37,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:00:37,823 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 11:00:37,824 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:00:37,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:00:37,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1579343520, now seen corresponding path program 1 times [2022-11-16 11:00:37,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:00:37,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307665460] [2022-11-16 11:00:37,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:00:37,848 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 [2022-11-16 11:00:37,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:00:37,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:00:37,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:00:38,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:00:38,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:00:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-16 11:00:38,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:00:38,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:00:38,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307665460] [2022-11-16 11:00:38,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307665460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:00:38,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:00:38,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:00:38,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305058248] [2022-11-16 11:00:38,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:00:38,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:00:38,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:00:38,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:00:38,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:00:38,368 INFO L87 Difference]: Start difference. First operand has 137 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 11:00:38,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:00:38,472 INFO L93 Difference]: Finished difference Result 274 states and 414 transitions. [2022-11-16 11:00:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:00:38,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2022-11-16 11:00:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:00:38,492 INFO L225 Difference]: With dead ends: 274 [2022-11-16 11:00:38,497 INFO L226 Difference]: Without dead ends: 140 [2022-11-16 11:00:38,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:00:38,506 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 12 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:00:38,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 536 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:00:38,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-16 11:00:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2022-11-16 11:00:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 86 states have (on average 1.244186046511628) internal successors, (107), 87 states have internal predecessors, (107), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-16 11:00:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 180 transitions. [2022-11-16 11:00:38,595 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 180 transitions. Word has length 116 [2022-11-16 11:00:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:00:38,598 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 180 transitions. [2022-11-16 11:00:38,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 11:00:38,598 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 180 transitions. [2022-11-16 11:00:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 11:00:38,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:00:38,605 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 11:00:38,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:38,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:38,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:00:38,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:00:38,822 INFO L85 PathProgramCache]: Analyzing trace with hash -183799078, now seen corresponding path program 1 times [2022-11-16 11:00:38,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:00:38,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131584448] [2022-11-16 11:00:38,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:00:38,823 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 [2022-11-16 11:00:38,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:00:38,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:00:38,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:00:39,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:00:39,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:00:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-16 11:00:39,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:00:39,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:00:39,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131584448] [2022-11-16 11:00:39,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131584448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:00:39,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:00:39,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:00:39,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945052740] [2022-11-16 11:00:39,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:00:39,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:00:39,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:00:39,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:00:39,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:00:39,199 INFO L87 Difference]: Start difference. First operand 134 states and 180 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 11:00:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:00:39,309 INFO L93 Difference]: Finished difference Result 255 states and 350 transitions. [2022-11-16 11:00:39,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:00:39,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2022-11-16 11:00:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:00:39,312 INFO L225 Difference]: With dead ends: 255 [2022-11-16 11:00:39,312 INFO L226 Difference]: Without dead ends: 141 [2022-11-16 11:00:39,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:00:39,315 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 9 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:00:39,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 688 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:00:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-16 11:00:39,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2022-11-16 11:00:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 90 states have internal predecessors, (110), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-16 11:00:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 183 transitions. [2022-11-16 11:00:39,327 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 183 transitions. Word has length 116 [2022-11-16 11:00:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:00:39,328 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 183 transitions. [2022-11-16 11:00:39,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 11:00:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 183 transitions. [2022-11-16 11:00:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 11:00:39,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:00:39,330 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 11:00:39,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 11:00:39,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:39,552 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:00:39,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:00:39,553 INFO L85 PathProgramCache]: Analyzing trace with hash -543175276, now seen corresponding path program 1 times [2022-11-16 11:00:39,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:00:39,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703437848] [2022-11-16 11:00:39,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:00:39,554 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 [2022-11-16 11:00:39,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:00:39,556 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:00:39,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:00:39,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:00:39,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:00:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-16 11:00:39,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:00:39,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:00:39,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703437848] [2022-11-16 11:00:39,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703437848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:00:39,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:00:39,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:00:39,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706415604] [2022-11-16 11:00:39,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:00:39,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:00:39,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:00:39,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:00:39,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:00:39,915 INFO L87 Difference]: Start difference. First operand 137 states and 183 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-16 11:00:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:00:40,071 INFO L93 Difference]: Finished difference Result 256 states and 345 transitions. [2022-11-16 11:00:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:00:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 116 [2022-11-16 11:00:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:00:40,075 INFO L225 Difference]: With dead ends: 256 [2022-11-16 11:00:40,075 INFO L226 Difference]: Without dead ends: 139 [2022-11-16 11:00:40,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:00:40,078 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 2 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:00:40,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 800 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:00:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-16 11:00:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-11-16 11:00:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 92 states have internal predecessors, (111), 37 states have call successors, (37), 10 states have call predecessors, (37), 11 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2022-11-16 11:00:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 188 transitions. [2022-11-16 11:00:40,091 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 188 transitions. Word has length 116 [2022-11-16 11:00:40,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:00:40,092 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 188 transitions. [2022-11-16 11:00:40,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-16 11:00:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 188 transitions. [2022-11-16 11:00:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-16 11:00:40,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:00:40,094 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:00:40,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:00:40,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:40,317 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:00:40,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:00:40,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1486715478, now seen corresponding path program 1 times [2022-11-16 11:00:40,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:00:40,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582653415] [2022-11-16 11:00:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:00:40,319 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 [2022-11-16 11:00:40,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:00:40,320 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:00:40,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:00:40,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:00:40,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:00:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-16 11:00:40,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:00:40,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:00:40,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582653415] [2022-11-16 11:00:40,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582653415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:00:40,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:00:40,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:00:40,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333449013] [2022-11-16 11:00:40,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:00:40,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:00:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:00:40,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:00:40,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:00:40,857 INFO L87 Difference]: Start difference. First operand 139 states and 188 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 11:00:41,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:00:41,254 INFO L93 Difference]: Finished difference Result 261 states and 356 transitions. [2022-11-16 11:00:41,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:00:41,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 118 [2022-11-16 11:00:41,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:00:41,257 INFO L225 Difference]: With dead ends: 261 [2022-11-16 11:00:41,257 INFO L226 Difference]: Without dead ends: 142 [2022-11-16 11:00:41,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:00:41,259 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 69 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:00:41,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 836 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:00:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-16 11:00:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-11-16 11:00:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 95 states have internal predecessors, (113), 37 states have call successors, (37), 10 states have call predecessors, (37), 12 states have return successors, (42), 36 states have call predecessors, (42), 36 states have call successors, (42) [2022-11-16 11:00:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 192 transitions. [2022-11-16 11:00:41,281 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 192 transitions. Word has length 118 [2022-11-16 11:00:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:00:41,281 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 192 transitions. [2022-11-16 11:00:41,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 11:00:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 192 transitions. [2022-11-16 11:00:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-16 11:00:41,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:00:41,284 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:00:41,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 11:00:41,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:41,501 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:00:41,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:00:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1084644541, now seen corresponding path program 1 times [2022-11-16 11:00:41,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:00:41,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554844596] [2022-11-16 11:00:41,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:00:41,503 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 [2022-11-16 11:00:41,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:00:41,504 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:00:41,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:00:41,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 11:00:41,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:00:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-16 11:00:42,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:00:42,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:00:42,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554844596] [2022-11-16 11:00:42,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554844596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:00:42,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:00:42,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:00:42,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56192699] [2022-11-16 11:00:42,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:00:42,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:00:42,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:00:42,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:00:42,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:00:42,007 INFO L87 Difference]: Start difference. First operand 142 states and 192 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 11:00:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:00:42,514 INFO L93 Difference]: Finished difference Result 276 states and 381 transitions. [2022-11-16 11:00:42,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:00:42,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 120 [2022-11-16 11:00:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:00:42,518 INFO L225 Difference]: With dead ends: 276 [2022-11-16 11:00:42,518 INFO L226 Difference]: Without dead ends: 154 [2022-11-16 11:00:42,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:00:42,520 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 99 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:00:42,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 978 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:00:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-16 11:00:42,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2022-11-16 11:00:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 94 states have (on average 1.2340425531914894) internal successors, (116), 97 states have internal predecessors, (116), 37 states have call successors, (37), 10 states have call predecessors, (37), 12 states have return successors, (42), 36 states have call predecessors, (42), 36 states have call successors, (42) [2022-11-16 11:00:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 195 transitions. [2022-11-16 11:00:42,542 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 195 transitions. Word has length 120 [2022-11-16 11:00:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:00:42,542 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 195 transitions. [2022-11-16 11:00:42,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 11:00:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 195 transitions. [2022-11-16 11:00:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-16 11:00:42,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:00:42,545 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:00:42,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 11:00:42,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:42,758 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:00:42,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:00:42,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1096826829, now seen corresponding path program 1 times [2022-11-16 11:00:42,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:00:42,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279042699] [2022-11-16 11:00:42,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:00:42,766 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 [2022-11-16 11:00:42,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:00:42,768 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:00:42,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:00:43,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 11:00:43,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:00:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-16 11:00:43,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:00:43,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:00:43,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279042699] [2022-11-16 11:00:43,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279042699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:00:43,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:00:43,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:00:43,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049138064] [2022-11-16 11:00:43,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:00:43,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:00:43,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:00:43,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:00:43,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:00:43,205 INFO L87 Difference]: Start difference. First operand 144 states and 195 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 11:00:43,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:00:43,551 INFO L93 Difference]: Finished difference Result 277 states and 385 transitions. [2022-11-16 11:00:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:00:43,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 121 [2022-11-16 11:00:43,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:00:43,554 INFO L225 Difference]: With dead ends: 277 [2022-11-16 11:00:43,554 INFO L226 Difference]: Without dead ends: 153 [2022-11-16 11:00:43,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:00:43,555 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 84 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:00:43,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 683 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:00:43,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-16 11:00:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2022-11-16 11:00:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 95 states have (on average 1.231578947368421) internal successors, (117), 98 states have internal predecessors, (117), 37 states have call successors, (37), 10 states have call predecessors, (37), 12 states have return successors, (42), 36 states have call predecessors, (42), 36 states have call successors, (42) [2022-11-16 11:00:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 196 transitions. [2022-11-16 11:00:43,574 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 196 transitions. Word has length 121 [2022-11-16 11:00:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:00:43,575 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 196 transitions. [2022-11-16 11:00:43,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 11:00:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 196 transitions. [2022-11-16 11:00:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-16 11:00:43,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:00:43,577 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:00:43,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 11:00:43,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:43,794 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:00:43,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:00:43,794 INFO L85 PathProgramCache]: Analyzing trace with hash 546558767, now seen corresponding path program 1 times [2022-11-16 11:00:43,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:00:43,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682510929] [2022-11-16 11:00:43,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:00:43,795 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 [2022-11-16 11:00:43,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:00:43,796 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:00:43,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:00:44,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:00:44,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:00:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-16 11:00:44,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:00:44,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:00:44,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682510929] [2022-11-16 11:00:44,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682510929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:00:44,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:00:44,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:00:44,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314396766] [2022-11-16 11:00:44,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:00:44,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:00:44,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:00:44,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:00:44,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:00:44,136 INFO L87 Difference]: Start difference. First operand 145 states and 196 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-16 11:00:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:00:44,328 INFO L93 Difference]: Finished difference Result 276 states and 376 transitions. [2022-11-16 11:00:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:00:44,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2022-11-16 11:00:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:00:44,331 INFO L225 Difference]: With dead ends: 276 [2022-11-16 11:00:44,331 INFO L226 Difference]: Without dead ends: 151 [2022-11-16 11:00:44,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:00:44,333 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 4 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:00:44,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 981 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:00:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-16 11:00:44,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2022-11-16 11:00:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 99 states have internal predecessors, (118), 37 states have call successors, (37), 10 states have call predecessors, (37), 12 states have return successors, (42), 36 states have call predecessors, (42), 36 states have call successors, (42) [2022-11-16 11:00:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 197 transitions. [2022-11-16 11:00:44,356 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 197 transitions. Word has length 129 [2022-11-16 11:00:44,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:00:44,356 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 197 transitions. [2022-11-16 11:00:44,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-16 11:00:44,357 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 197 transitions. [2022-11-16 11:00:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-16 11:00:44,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:00:44,359 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:00:44,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:44,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:44,572 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:00:44,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:00:44,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1662855644, now seen corresponding path program 1 times [2022-11-16 11:00:44,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:00:44,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456860293] [2022-11-16 11:00:44,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:00:44,573 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 [2022-11-16 11:00:44,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:00:44,574 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:00:44,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:00:44,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 11:00:44,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:00:47,400 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|))))) is different from true [2022-11-16 11:00:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-16 11:00:47,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:00:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-16 11:00:48,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:00:48,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456860293] [2022-11-16 11:00:48,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456860293] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:00:48,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:00:48,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2022-11-16 11:00:48,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937492151] [2022-11-16 11:00:48,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:00:48,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:00:48,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:00:48,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:00:48,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2022-11-16 11:00:48,137 INFO L87 Difference]: Start difference. First operand 146 states and 197 transitions. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 4 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2022-11-16 11:00:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:00:50,528 INFO L93 Difference]: Finished difference Result 325 states and 464 transitions. [2022-11-16 11:00:50,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:00:50,529 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 4 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 131 [2022-11-16 11:00:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:00:50,531 INFO L225 Difference]: With dead ends: 325 [2022-11-16 11:00:50,531 INFO L226 Difference]: Without dead ends: 199 [2022-11-16 11:00:50,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=100, Invalid=323, Unknown=1, NotChecked=38, Total=462 [2022-11-16 11:00:50,532 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 108 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:00:50,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1563 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 552 Invalid, 0 Unknown, 249 Unchecked, 1.8s Time] [2022-11-16 11:00:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-16 11:00:50,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 155. [2022-11-16 11:00:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 103 states have (on average 1.233009708737864) internal successors, (127), 106 states have internal predecessors, (127), 38 states have call successors, (38), 11 states have call predecessors, (38), 13 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2022-11-16 11:00:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 209 transitions. [2022-11-16 11:00:50,555 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 209 transitions. Word has length 131 [2022-11-16 11:00:50,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:00:50,556 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 209 transitions. [2022-11-16 11:00:50,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 4 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2022-11-16 11:00:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 209 transitions. [2022-11-16 11:00:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-16 11:00:50,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:00:50,558 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:00:50,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 11:00:50,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:50,772 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:00:50,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:00:50,772 INFO L85 PathProgramCache]: Analyzing trace with hash 369986644, now seen corresponding path program 1 times [2022-11-16 11:00:50,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:00:50,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144674059] [2022-11-16 11:00:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:00:50,773 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 [2022-11-16 11:00:50,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:00:50,774 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:00:50,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:00:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:00:51,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 11:00:51,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:00:53,593 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_8| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_8|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_8| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_8|) (_ bv0 64)) (_ bv16 64))))) is different from true [2022-11-16 11:00:55,797 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_9| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_9|) (_ bv0 64)) (_ bv16 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_9| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_9|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_9|)))) is different from true [2022-11-16 11:00:57,984 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10|) (_ bv0 64)) (_ bv16 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| (_ BitVec 64))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10|) (_ bv0 64)))))) is different from true [2022-11-16 11:01:06,176 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:01:14,560 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:01:22,836 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:01:31,324 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:01:39,667 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:01:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 137 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 14 not checked. [2022-11-16 11:01:39,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:01:45,862 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 11:01:45,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-11-16 11:01:45,883 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-16 11:01:45,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2022-11-16 11:01:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-11-16 11:01:45,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:01:45,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144674059] [2022-11-16 11:01:45,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144674059] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:01:45,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:01:45,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2022-11-16 11:01:45,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265181994] [2022-11-16 11:01:45,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:01:45,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 11:01:45,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:01:45,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 11:01:45,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=573, Unknown=4, NotChecked=150, Total=812 [2022-11-16 11:01:45,912 INFO L87 Difference]: Start difference. First operand 155 states and 209 transitions. Second operand has 29 states, 27 states have (on average 4.62962962962963) internal successors, (125), 25 states have internal predecessors, (125), 11 states have call successors, (33), 5 states have call predecessors, (33), 11 states have return successors, (32), 13 states have call predecessors, (32), 11 states have call successors, (32) [2022-11-16 11:02:01,830 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:02:12,063 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:02:24,215 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:02:34,377 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:02:46,598 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:02:56,859 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:03:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:03:07,318 INFO L93 Difference]: Finished difference Result 314 states and 429 transitions. [2022-11-16 11:03:07,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 11:03:07,320 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 4.62962962962963) internal successors, (125), 25 states have internal predecessors, (125), 11 states have call successors, (33), 5 states have call predecessors, (33), 11 states have return successors, (32), 13 states have call predecessors, (32), 11 states have call successors, (32) Word has length 132 [2022-11-16 11:03:07,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:03:07,321 INFO L225 Difference]: With dead ends: 314 [2022-11-16 11:03:07,321 INFO L226 Difference]: Without dead ends: 179 [2022-11-16 11:03:07,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 235 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 127.2s TimeCoverageRelationStatistics Valid=168, Invalid=1312, Unknown=14, NotChecked=228, Total=1722 [2022-11-16 11:03:07,323 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 71 mSDsluCounter, 2049 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1093 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:03:07,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 2204 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1144 Invalid, 0 Unknown, 1093 Unchecked, 6.2s Time] [2022-11-16 11:03:07,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-16 11:03:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2022-11-16 11:03:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 114 states have internal predecessors, (136), 39 states have call successors, (39), 13 states have call predecessors, (39), 15 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-11-16 11:03:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 220 transitions. [2022-11-16 11:03:07,348 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 220 transitions. Word has length 132 [2022-11-16 11:03:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:03:07,349 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 220 transitions. [2022-11-16 11:03:07,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 4.62962962962963) internal successors, (125), 25 states have internal predecessors, (125), 11 states have call successors, (33), 5 states have call predecessors, (33), 11 states have return successors, (32), 13 states have call predecessors, (32), 11 states have call successors, (32) [2022-11-16 11:03:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 220 transitions. [2022-11-16 11:03:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-16 11:03:07,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:03:07,351 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:07,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:03:07,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:03:07,576 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:03:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:07,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1832237475, now seen corresponding path program 2 times [2022-11-16 11:03:07,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:03:07,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639234626] [2022-11-16 11:03:07,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:03:07,578 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 [2022-11-16 11:03:07,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:03:07,579 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:03:07,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:03:07,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:03:07,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:03:07,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 11:03:07,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:03:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 111 proven. 8 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-16 11:03:08,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:03:09,506 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 11:03:09,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-16 11:03:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-11-16 11:03:09,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:03:09,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639234626] [2022-11-16 11:03:09,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639234626] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:03:09,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:03:09,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2022-11-16 11:03:09,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113111377] [2022-11-16 11:03:09,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:03:09,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 11:03:09,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:03:09,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 11:03:09,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2022-11-16 11:03:09,739 INFO L87 Difference]: Start difference. First operand 166 states and 220 transitions. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 15 states have internal predecessors, (97), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 5 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-16 11:03:13,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:03:13,440 INFO L93 Difference]: Finished difference Result 369 states and 542 transitions. [2022-11-16 11:03:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 11:03:13,441 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 15 states have internal predecessors, (97), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 5 states have call predecessors, (25), 4 states have call successors, (25) Word has length 142 [2022-11-16 11:03:13,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:03:13,444 INFO L225 Difference]: With dead ends: 369 [2022-11-16 11:03:13,444 INFO L226 Difference]: Without dead ends: 232 [2022-11-16 11:03:13,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=170, Invalid=881, Unknown=5, NotChecked=0, Total=1056 [2022-11-16 11:03:13,445 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 160 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:03:13,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1631 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 646 Invalid, 0 Unknown, 21 Unchecked, 2.2s Time] [2022-11-16 11:03:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-16 11:03:13,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 171. [2022-11-16 11:03:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 118 states have internal predecessors, (141), 39 states have call successors, (39), 13 states have call predecessors, (39), 16 states have return successors, (49), 39 states have call predecessors, (49), 38 states have call successors, (49) [2022-11-16 11:03:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 229 transitions. [2022-11-16 11:03:13,496 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 229 transitions. Word has length 142 [2022-11-16 11:03:13,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:03:13,497 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 229 transitions. [2022-11-16 11:03:13,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 15 states have internal predecessors, (97), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 5 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-16 11:03:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 229 transitions. [2022-11-16 11:03:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-16 11:03:13,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:03:13,499 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:13,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 11:03:13,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:03:13,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:03:13,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:13,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1100270049, now seen corresponding path program 1 times [2022-11-16 11:03:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:03:13,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647790155] [2022-11-16 11:03:13,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:13,717 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 [2022-11-16 11:03:13,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:03:13,718 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:03:13,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 11:03:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:13,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:03:13,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:03:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-16 11:03:14,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:03:14,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:03:14,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647790155] [2022-11-16 11:03:14,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647790155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:14,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:14,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:03:14,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781375487] [2022-11-16 11:03:14,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:14,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:03:14,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:03:14,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:03:14,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:03:14,003 INFO L87 Difference]: Start difference. First operand 171 states and 229 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-16 11:03:14,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:03:14,060 INFO L93 Difference]: Finished difference Result 313 states and 432 transitions. [2022-11-16 11:03:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:03:14,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 142 [2022-11-16 11:03:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:03:14,063 INFO L225 Difference]: With dead ends: 313 [2022-11-16 11:03:14,063 INFO L226 Difference]: Without dead ends: 171 [2022-11-16 11:03:14,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:03:14,065 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:03:14,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 711 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:03:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-16 11:03:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2022-11-16 11:03:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 114 states have (on average 1.2105263157894737) internal successors, (138), 117 states have internal predecessors, (138), 39 states have call successors, (39), 13 states have call predecessors, (39), 16 states have return successors, (49), 39 states have call predecessors, (49), 38 states have call successors, (49) [2022-11-16 11:03:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 226 transitions. [2022-11-16 11:03:14,087 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 226 transitions. Word has length 142 [2022-11-16 11:03:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:03:14,088 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 226 transitions. [2022-11-16 11:03:14,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-16 11:03:14,088 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 226 transitions. [2022-11-16 11:03:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-16 11:03:14,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:03:14,090 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:14,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:03:14,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:03:14,304 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:03:14,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:14,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1325856109, now seen corresponding path program 2 times [2022-11-16 11:03:14,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:03:14,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158376356] [2022-11-16 11:03:14,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:03:14,305 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 [2022-11-16 11:03:14,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:03:14,306 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:03:14,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 11:03:14,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:03:14,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:03:14,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-16 11:03:14,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:03:16,844 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6|))))) is different from true [2022-11-16 11:03:19,017 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) (_ bv0 64)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|))))) is different from true [2022-11-16 11:03:21,221 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_15| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_12| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_15|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_12|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_15| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_12| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_15|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_12|))))) is different from true [2022-11-16 11:03:23,382 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_1| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_1|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_1| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_1|))))) is different from true [2022-11-16 11:03:25,572 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_2| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_2|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_2| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_2|))))) is different from true [2022-11-16 11:03:27,736 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_3| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_3|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_3| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_3|))))) is different from true [2022-11-16 11:03:29,918 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_4| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_4|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_4| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_4|))))) is different from true [2022-11-16 11:03:32,053 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_5| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_5|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_5| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_5|))))) is different from true [2022-11-16 11:03:40,253 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:03:48,518 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:03:56,807 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:04:03,027 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:04:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 95 proven. 7 refuted. 0 times theorem prover too weak. 53 trivial. 52 not checked. [2022-11-16 11:04:03,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:04:06,367 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 11:04:06,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-16 11:04:06,384 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-16 11:04:06,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-11-16 11:04:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-11-16 11:04:06,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:04:06,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158376356] [2022-11-16 11:04:06,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158376356] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:04:06,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:04:06,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 26 [2022-11-16 11:04:06,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321078757] [2022-11-16 11:04:06,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:04:06,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 11:04:06,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:04:06,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 11:04:06,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=255, Unknown=12, NotChecked=312, Total=650 [2022-11-16 11:04:06,467 INFO L87 Difference]: Start difference. First operand 170 states and 226 transitions. Second operand has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 24 states have internal predecessors, (116), 6 states have call successors, (25), 10 states have call predecessors, (25), 11 states have return successors, (24), 6 states have call predecessors, (24), 5 states have call successors, (24) [2022-11-16 11:04:19,472 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6|))))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) (_ bv0 64)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|)))))) is different from true [2022-11-16 11:04:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:04:21,304 INFO L93 Difference]: Finished difference Result 376 states and 495 transitions. [2022-11-16 11:04:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 11:04:21,305 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 24 states have internal predecessors, (116), 6 states have call successors, (25), 10 states have call predecessors, (25), 11 states have return successors, (24), 6 states have call predecessors, (24), 5 states have call successors, (24) Word has length 143 [2022-11-16 11:04:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:04:21,307 INFO L225 Difference]: With dead ends: 376 [2022-11-16 11:04:21,307 INFO L226 Difference]: Without dead ends: 238 [2022-11-16 11:04:21,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 254 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 63.1s TimeCoverageRelationStatistics Valid=149, Invalid=519, Unknown=18, NotChecked=504, Total=1190 [2022-11-16 11:04:21,309 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 109 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2114 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:04:21,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1470 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 480 Invalid, 0 Unknown, 2114 Unchecked, 1.7s Time] [2022-11-16 11:04:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-16 11:04:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 211. [2022-11-16 11:04:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 147 states have (on average 1.1904761904761905) internal successors, (175), 150 states have internal predecessors, (175), 40 states have call successors, (40), 20 states have call predecessors, (40), 23 states have return successors, (53), 40 states have call predecessors, (53), 39 states have call successors, (53) [2022-11-16 11:04:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 268 transitions. [2022-11-16 11:04:21,338 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 268 transitions. Word has length 143 [2022-11-16 11:04:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:04:21,339 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 268 transitions. [2022-11-16 11:04:21,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 24 states have internal predecessors, (116), 6 states have call successors, (25), 10 states have call predecessors, (25), 11 states have return successors, (24), 6 states have call predecessors, (24), 5 states have call successors, (24) [2022-11-16 11:04:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 268 transitions. [2022-11-16 11:04:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-16 11:04:21,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:04:21,341 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:04:21,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:04:21,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:04:21,560 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:04:21,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:04:21,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2143032953, now seen corresponding path program 1 times [2022-11-16 11:04:21,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:04:21,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312174065] [2022-11-16 11:04:21,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:04:21,561 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 [2022-11-16 11:04:21,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:04:21,562 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:04:21,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-16 11:04:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:04:21,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 11:04:21,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:04:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 133 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-16 11:04:24,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:04:27,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:04:27,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-11-16 11:04:27,860 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 11:04:27,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2022-11-16 11:04:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-11-16 11:04:27,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:04:27,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312174065] [2022-11-16 11:04:27,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312174065] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:04:27,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:04:27,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2022-11-16 11:04:27,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717953286] [2022-11-16 11:04:27,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:04:27,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 11:04:27,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:04:27,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 11:04:27,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:04:27,956 INFO L87 Difference]: Start difference. First operand 211 states and 268 transitions. Second operand has 20 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 9 states have call successors, (31), 4 states have call predecessors, (31), 7 states have return successors, (30), 7 states have call predecessors, (30), 9 states have call successors, (30) [2022-11-16 11:04:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:04:31,044 INFO L93 Difference]: Finished difference Result 435 states and 558 transitions. [2022-11-16 11:04:31,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 11:04:31,045 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 9 states have call successors, (31), 4 states have call predecessors, (31), 7 states have return successors, (30), 7 states have call predecessors, (30), 9 states have call successors, (30) Word has length 143 [2022-11-16 11:04:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:04:31,048 INFO L225 Difference]: With dead ends: 435 [2022-11-16 11:04:31,048 INFO L226 Difference]: Without dead ends: 263 [2022-11-16 11:04:31,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 264 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-11-16 11:04:31,051 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 98 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1970 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:04:31,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1970 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 369 Invalid, 0 Unknown, 251 Unchecked, 1.8s Time] [2022-11-16 11:04:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-16 11:04:31,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 238. [2022-11-16 11:04:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 171 states have (on average 1.1988304093567252) internal successors, (205), 176 states have internal predecessors, (205), 40 states have call successors, (40), 21 states have call predecessors, (40), 26 states have return successors, (54), 40 states have call predecessors, (54), 39 states have call successors, (54) [2022-11-16 11:04:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 299 transitions. [2022-11-16 11:04:31,113 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 299 transitions. Word has length 143 [2022-11-16 11:04:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:04:31,114 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 299 transitions. [2022-11-16 11:04:31,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 9 states have call successors, (31), 4 states have call predecessors, (31), 7 states have return successors, (30), 7 states have call predecessors, (30), 9 states have call successors, (30) [2022-11-16 11:04:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 299 transitions. [2022-11-16 11:04:31,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-16 11:04:31,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:04:31,117 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:04:31,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:04:31,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:04:31,332 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:04:31,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:04:31,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1903787849, now seen corresponding path program 1 times [2022-11-16 11:04:31,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:04:31,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594536343] [2022-11-16 11:04:31,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:04:31,333 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 [2022-11-16 11:04:31,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:04:31,334 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:04:31,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-16 11:04:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:04:31,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 11:04:31,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:04:31,819 INFO L350 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 11 treesize of output 14 [2022-11-16 11:04:31,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:04:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-16 11:04:33,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:04:33,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:04:33,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594536343] [2022-11-16 11:04:33,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594536343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:04:33,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:04:33,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 11:04:33,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103118207] [2022-11-16 11:04:33,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:04:33,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:04:33,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:04:33,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:04:33,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:04:33,885 INFO L87 Difference]: Start difference. First operand 238 states and 299 transitions. Second operand has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-16 11:04:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:04:34,885 INFO L93 Difference]: Finished difference Result 577 states and 734 transitions. [2022-11-16 11:04:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:04:34,886 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 143 [2022-11-16 11:04:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:04:34,889 INFO L225 Difference]: With dead ends: 577 [2022-11-16 11:04:34,889 INFO L226 Difference]: Without dead ends: 377 [2022-11-16 11:04:34,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 121 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:04:34,891 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 48 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:04:34,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1935 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 273 Unchecked, 0.7s Time] [2022-11-16 11:04:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-16 11:04:34,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 341. [2022-11-16 11:04:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 252 states have (on average 1.1944444444444444) internal successors, (301), 259 states have internal predecessors, (301), 51 states have call successors, (51), 30 states have call predecessors, (51), 37 states have return successors, (70), 51 states have call predecessors, (70), 50 states have call successors, (70) [2022-11-16 11:04:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 422 transitions. [2022-11-16 11:04:34,941 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 422 transitions. Word has length 143 [2022-11-16 11:04:34,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:04:34,942 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 422 transitions. [2022-11-16 11:04:34,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-16 11:04:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 422 transitions. [2022-11-16 11:04:34,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-16 11:04:34,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:04:34,945 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:04:34,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-11-16 11:04:35,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:04:35,152 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:04:35,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:04:35,152 INFO L85 PathProgramCache]: Analyzing trace with hash 341791605, now seen corresponding path program 1 times [2022-11-16 11:04:35,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:04:35,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416574635] [2022-11-16 11:04:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:04:35,153 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 [2022-11-16 11:04:35,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:04:35,155 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:04:35,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-16 11:04:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:04:35,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 11:04:35,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:04:35,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-16 11:04:35,602 INFO L350 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 6 treesize of output 5 [2022-11-16 11:04:35,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-16 11:04:35,624 INFO L350 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 6 treesize of output 5 [2022-11-16 11:04:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 146 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-16 11:04:40,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:04:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-11-16 11:04:43,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:04:43,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416574635] [2022-11-16 11:04:43,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416574635] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:04:43,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:04:43,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2022-11-16 11:04:43,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981974787] [2022-11-16 11:04:43,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:04:43,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 11:04:43,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:04:43,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 11:04:43,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2022-11-16 11:04:43,247 INFO L87 Difference]: Start difference. First operand 341 states and 422 transitions. Second operand has 29 states, 27 states have (on average 4.925925925925926) internal successors, (133), 27 states have internal predecessors, (133), 12 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 10 states have call predecessors, (31), 12 states have call successors, (31) [2022-11-16 11:04:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:04:50,076 INFO L93 Difference]: Finished difference Result 607 states and 795 transitions. [2022-11-16 11:04:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 11:04:50,078 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 4.925925925925926) internal successors, (133), 27 states have internal predecessors, (133), 12 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 10 states have call predecessors, (31), 12 states have call successors, (31) Word has length 143 [2022-11-16 11:04:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:04:50,081 INFO L225 Difference]: With dead ends: 607 [2022-11-16 11:04:50,081 INFO L226 Difference]: Without dead ends: 420 [2022-11-16 11:04:50,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 248 SyntacticMatches, 13 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=197, Invalid=1443, Unknown=0, NotChecked=0, Total=1640 [2022-11-16 11:04:50,083 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 269 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:04:50,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 2290 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 980 Invalid, 0 Unknown, 214 Unchecked, 4.9s Time] [2022-11-16 11:04:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-11-16 11:04:50,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 353. [2022-11-16 11:04:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 259 states have (on average 1.1814671814671815) internal successors, (306), 267 states have internal predecessors, (306), 55 states have call successors, (55), 30 states have call predecessors, (55), 38 states have return successors, (80), 55 states have call predecessors, (80), 54 states have call successors, (80) [2022-11-16 11:04:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 441 transitions. [2022-11-16 11:04:50,149 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 441 transitions. Word has length 143 [2022-11-16 11:04:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:04:50,150 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 441 transitions. [2022-11-16 11:04:50,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 4.925925925925926) internal successors, (133), 27 states have internal predecessors, (133), 12 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 10 states have call predecessors, (31), 12 states have call successors, (31) [2022-11-16 11:04:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 441 transitions. [2022-11-16 11:04:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-16 11:04:50,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:04:50,152 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:04:50,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:04:50,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:04:50,370 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:04:50,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:04:50,370 INFO L85 PathProgramCache]: Analyzing trace with hash -154533799, now seen corresponding path program 1 times [2022-11-16 11:04:50,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:04:50,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866214318] [2022-11-16 11:04:50,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:04:50,371 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 [2022-11-16 11:04:50,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:04:50,372 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:04:50,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-16 11:04:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:04:50,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 11:04:50,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:04:50,963 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-16 11:04:50,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-11-16 11:04:50,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-16 11:04:50,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-16 11:04:51,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:04:51,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 13 [2022-11-16 11:04:51,023 INFO L350 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 13 treesize of output 9 [2022-11-16 11:04:51,331 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) is different from true [2022-11-16 11:04:51,888 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse2))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3))))))) is different from true [2022-11-16 11:04:52,151 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse2))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3)))))) (let ((.cse6 (bvadd (_ bv24 64) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) .cse6))) (or (and (= |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base| .cse4) (not (= (_ bv0 64) .cse4))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select v_DerPreprocessor_3 .cse6))) (and (not (= (_ bv0 64) .cse5)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base| v_DerPreprocessor_3) .cse5 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base| v_DerPreprocessor_3) .cse5) (select |c_#memory_$Pointer$.base| .cse5)) (= .cse5 .cse4)))))))) is different from true [2022-11-16 11:04:52,696 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse2))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse5)))))) is different from true [2022-11-16 11:04:53,362 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|) (_ bv24 64)))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= .cse2 .cse3) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))) (and (not (= (_ bv0 64) .cse3)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse3)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse4))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse5 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse5 (_ bv0 64))) (= .cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse5) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse5 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse5)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse6) (select |c_#memory_$Pointer$.base| .cse6))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse7))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset|)) is different from true [2022-11-16 11:04:53,474 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse2))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse5))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6)) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse7)))))) is different from true [2022-11-16 11:04:53,883 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|) (_ bv24 64)))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= .cse2 .cse3) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))) (and (not (= (_ bv0 64) .cse3)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse3)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse4))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse5 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse5 (_ bv0 64))) (= .cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse5) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse5 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse5)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse6) (select |c_#memory_$Pointer$.base| .cse6))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse7))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset|) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse8 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse8 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse8) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse8)) (= .cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse9)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse9)))))) is different from true [2022-11-16 11:04:54,159 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse2))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse5))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6)) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse7))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| .cse8) (not (= (_ bv0 64) .cse8))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= .cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse9) (select |c_#memory_$Pointer$.base| .cse9))))))) is different from true [2022-11-16 11:04:58,584 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|) (_ bv24 64)))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= .cse2 .cse3) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))) (and (not (= (_ bv0 64) .cse3)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse3)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse4))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse5 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse5 (_ bv0 64))) (= .cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse5) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse5 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse5)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse6) (select |c_#memory_$Pointer$.base| .cse6))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse7))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset|) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse8 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse8 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse8) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse8)) (= .cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse9)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse9))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| .cse10) (not (= (_ bv0 64) .cse10))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse11 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse11 (_ bv0 64))) (= .cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse11 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse11) (select |c_#memory_$Pointer$.base| .cse11))))))) is different from true [2022-11-16 11:04:58,747 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse2))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse5))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6)) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse7))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse8 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse8 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse8) (select |c_#memory_$Pointer$.base| .cse8)) (= .cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| .cse9) (not (= (_ bv0 64) .cse9)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| .cse10) (not (= (_ bv0 64) .cse10))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse11 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse11 (_ bv0 64))) (= .cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse11 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse11) (select |c_#memory_$Pointer$.base| .cse11))))))) is different from true [2022-11-16 11:04:59,371 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|) (_ bv24 64)))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= .cse2 .cse3) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))) (and (not (= (_ bv0 64) .cse3)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse3)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse4))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse5 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse5 (_ bv0 64))) (= .cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse5) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse5 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse5)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse6) (select |c_#memory_$Pointer$.base| .cse6))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse7))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset|) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse8 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse8 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse8) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse8)) (= .cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse9)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse9))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse10 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse10 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= .cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| .cse11) (not (= (_ bv0 64) .cse11)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| .cse12) (not (= (_ bv0 64) .cse12))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse13 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse13 (_ bv0 64))) (= .cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse13) (select |c_#memory_$Pointer$.base| .cse13))))))) is different from true [2022-11-16 11:05:07,239 WARN L233 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 131 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:05:07,405 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse2))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse5))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6)) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse7))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (_ bv24 64)))) (and (= .cse8 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (not (= (_ bv0 64) .cse8))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= .cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_3) .cse9) (select |c_#memory_$Pointer$.base| .cse9)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse10 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse10 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= .cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| .cse11) (not (= (_ bv0 64) .cse11)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| .cse12) (not (= (_ bv0 64) .cse12))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse13 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse13 (_ bv0 64))) (= .cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse13) (select |c_#memory_$Pointer$.base| .cse13))))))) is different from true [2022-11-16 11:05:07,693 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_is_valid_#in~list#1.offset| |c_aws_linked_list_is_valid_~list#1.offset|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse2))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse5))))) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_~list#1.base|) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6)) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse7))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (_ bv24 64)))) (and (= .cse8 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (not (= (_ bv0 64) .cse8))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= .cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_3) .cse9) (select |c_#memory_$Pointer$.base| .cse9)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse10 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse10 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= .cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| .cse11) (not (= (_ bv0 64) .cse11)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| .cse12) (not (= (_ bv0 64) .cse12))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse13 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse13 (_ bv0 64))) (= .cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse13) (select |c_#memory_$Pointer$.base| .cse13))))))) is different from true [2022-11-16 11:05:08,845 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (or |c_aws_linked_list_is_valid_#t~short301#1| (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (bvadd |c_aws_linked_list_is_valid_#in~list#1.offset| (_ bv24 64))) (_ bv0 64))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse2))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse5))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6)) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse7))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (_ bv24 64)))) (and (= .cse8 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (not (= (_ bv0 64) .cse8))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= .cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_3) .cse9) (select |c_#memory_$Pointer$.base| .cse9)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse10 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse10 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= .cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| .cse11) (not (= (_ bv0 64) .cse11)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| .cse12) (not (= (_ bv0 64) .cse12))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse13 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse13 (_ bv0 64))) (= .cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse13) (select |c_#memory_$Pointer$.base| .cse13))))))) is different from true [2022-11-16 11:05:27,114 WARN L233 SmtUtils]: Spent 17.90s on a formula simplification that was a NOOP. DAG size: 138 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:05:27,426 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse2))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3)))))) (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (bvadd |c_aws_linked_list_is_valid_#in~list#1.offset| (_ bv24 64))) (_ bv0 64)) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse5))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6)) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse7))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (_ bv24 64)))) (and (= .cse8 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (not (= (_ bv0 64) .cse8))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= .cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_3) .cse9) (select |c_#memory_$Pointer$.base| .cse9)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse10 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse10 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= .cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| .cse11) (not (= (_ bv0 64) .cse11)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| .cse12) (not (= (_ bv0 64) .cse12))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse13 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse13 (_ bv0 64))) (= .cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse13) (select |c_#memory_$Pointer$.base| .cse13))))))) is different from true [2022-11-16 11:05:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 56 not checked. [2022-11-16 11:05:28,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:05:29,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:05:29,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 255 [2022-11-16 11:05:29,683 INFO L350 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 282 treesize of output 266 [2022-11-16 11:05:29,693 INFO L350 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 266 treesize of output 258 [2022-11-16 11:05:29,816 INFO L350 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 8 treesize of output 4 [2022-11-16 11:05:29,841 INFO L350 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 22 treesize of output 18 [2022-11-16 11:05:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-11-16 11:05:30,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:05:30,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866214318] [2022-11-16 11:05:30,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866214318] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:05:30,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:05:30,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11] total 33 [2022-11-16 11:05:30,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209182322] [2022-11-16 11:05:30,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:05:30,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 11:05:30,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:05:30,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 11:05:30,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=256, Unknown=33, NotChecked=690, Total=1056 [2022-11-16 11:05:30,246 INFO L87 Difference]: Start difference. First operand 353 states and 441 transitions. Second operand has 33 states, 27 states have (on average 5.185185185185185) internal successors, (140), 27 states have internal predecessors, (140), 17 states have call successors, (33), 9 states have call predecessors, (33), 10 states have return successors, (32), 15 states have call predecessors, (32), 17 states have call successors, (32) [2022-11-16 11:05:31,866 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (let ((.cse3 (select .cse4 (_ bv24 64)))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= .cse2 .cse3) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))) (and (not (= (_ bv0 64) .cse3)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse3)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse5 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse5))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse6)))))) (not (= (_ bv0 64) (select .cse4 (bvadd |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset| (_ bv24 64))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse7 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse7 (_ bv0 64))) (= .cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse7) (select |c_#memory_$Pointer$.base| .cse7))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse8)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse8))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset|))) is different from true [2022-11-16 11:05:31,888 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (let ((.cse3 (select .cse4 (_ bv24 64)))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= .cse2 .cse3) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))) (and (not (= (_ bv0 64) .cse3)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse3)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse5 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse5))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse6)))))) (not (= (_ bv0 64) (select .cse4 (bvadd |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset| (_ bv24 64))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse7 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse7 (_ bv0 64))) (= .cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse7) (select |c_#memory_$Pointer$.base| .cse7))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse8)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse8))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset|) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse9) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse9)) (= .cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse10)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse10))))))) is different from true [2022-11-16 11:05:31,915 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse2))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3)))))) (or (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_~list#1.base|) (bvadd (_ bv24 64) |c_aws_linked_list_is_valid_~list#1.offset|)))) (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (bvadd |c_aws_linked_list_is_valid_#in~list#1.offset| (_ bv24 64))) (_ bv0 64))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse5))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6)) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse7))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| .cse8) (not (= (_ bv0 64) .cse8))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= .cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse9) (select |c_#memory_$Pointer$.base| .cse9))))))) is different from true [2022-11-16 11:05:31,945 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (or |c_aws_linked_list_is_valid_#t~short301#1| (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (bvadd |c_aws_linked_list_is_valid_#in~list#1.offset| (_ bv24 64))) (_ bv0 64))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse2))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse5))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6)) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse7))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| .cse8) (not (= (_ bv0 64) .cse8))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= .cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse9) (select |c_#memory_$Pointer$.base| .cse9))))))) is different from true [2022-11-16 11:05:31,974 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse2))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse5))))) (or |c_aws_linked_list_is_valid_#t~short303#1| (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (bvadd |c_aws_linked_list_is_valid_#in~list#1.offset| (_ bv24 64))) (_ bv0 64))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6)) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse7))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| .cse8) (not (= (_ bv0 64) .cse8))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= .cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse9) (select |c_#memory_$Pointer$.base| .cse9))))))) is different from true [2022-11-16 11:05:32,041 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (let ((.cse3 (select .cse4 (_ bv24 64)))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= .cse2 .cse3) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))) (and (not (= (_ bv0 64) .cse3)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse3)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse5 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse5))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse6)))))) (not (= (_ bv0 64) (select .cse4 (bvadd |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset| (_ bv24 64))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse7 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse7 (_ bv0 64))) (= .cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse7) (select |c_#memory_$Pointer$.base| .cse7))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse8)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse8))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset|) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse9) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse9)) (= .cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse10)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse10))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| .cse11) (not (= (_ bv0 64) .cse11))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse12 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse12 (_ bv0 64))) (= .cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse12 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse12) (select |c_#memory_$Pointer$.base| .cse12)))))))) is different from true [2022-11-16 11:05:32,088 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (let ((.cse3 (select .cse4 (_ bv24 64)))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= .cse2 .cse3) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))) (and (not (= (_ bv0 64) .cse3)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse3)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse5 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse5))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse6)))))) (not (= (_ bv0 64) (select .cse4 (bvadd |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset| (_ bv24 64))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse7 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse7 (_ bv0 64))) (= .cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse7) (select |c_#memory_$Pointer$.base| .cse7))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse8)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse8))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset|) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse9) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse9)) (= .cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse10)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse10))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse11 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse11 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse11 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse11) (select |c_#memory_$Pointer$.base| .cse11)) (= .cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| .cse12) (not (= (_ bv0 64) .cse12)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| .cse13) (not (= (_ bv0 64) .cse13))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse14 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse14 (_ bv0 64))) (= .cse14 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse14 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse14 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse14) (select |c_#memory_$Pointer$.base| .cse14)))))))) is different from true [2022-11-16 11:05:32,302 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_is_valid_#in~list#1.offset| |c_aws_linked_list_is_valid_~list#1.offset|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| (_ BitVec 64))) (let ((.cse1 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse1 (_ bv0 64))) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_25| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (not (= (_ bv0 64) .cse2))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_3) .cse3)))))) (or (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_~list#1.base|) (bvadd (_ bv24 64) |c_aws_linked_list_is_valid_~list#1.offset|)))) (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (bvadd |c_aws_linked_list_is_valid_#in~list#1.offset| (_ bv24 64))) (_ bv0 64))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_31| .cse5))))) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_~list#1.base|) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| v_DerPreprocessor_3) .cse6)) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_32| .cse7))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (_ bv24 64)))) (and (= .cse8 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (not (= (_ bv0 64) .cse8))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= .cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_3) .cse9) (select |c_#memory_$Pointer$.base| .cse9)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse10 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse10 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_3) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= .cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| (_ BitVec 64))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_34| .cse11) (not (= (_ bv0 64) .cse11)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| .cse12) (not (= (_ bv0 64) .cse12))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse13 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse13 (_ bv0 64))) (= .cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_3) .cse13) (select |c_#memory_$Pointer$.base| .cse13))))))) is different from true [2022-11-16 11:05:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:05:34,338 INFO L93 Difference]: Finished difference Result 690 states and 892 transitions. [2022-11-16 11:05:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 11:05:34,339 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 5.185185185185185) internal successors, (140), 27 states have internal predecessors, (140), 17 states have call successors, (33), 9 states have call predecessors, (33), 10 states have return successors, (32), 15 states have call predecessors, (32), 17 states have call successors, (32) Word has length 145 [2022-11-16 11:05:34,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:05:34,342 INFO L225 Difference]: With dead ends: 690 [2022-11-16 11:05:34,342 INFO L226 Difference]: Without dead ends: 484 [2022-11-16 11:05:34,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=48, NotChecked=1426, Total=1980 [2022-11-16 11:05:34,345 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 82 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 6481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5905 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:05:34,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 2074 Invalid, 6481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 524 Invalid, 0 Unknown, 5905 Unchecked, 2.4s Time] [2022-11-16 11:05:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-11-16 11:05:34,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 439. [2022-11-16 11:05:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 328 states have (on average 1.1829268292682926) internal successors, (388), 337 states have internal predecessors, (388), 63 states have call successors, (63), 38 states have call predecessors, (63), 47 states have return successors, (101), 63 states have call predecessors, (101), 62 states have call successors, (101) [2022-11-16 11:05:34,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 552 transitions. [2022-11-16 11:05:34,449 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 552 transitions. Word has length 145 [2022-11-16 11:05:34,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:05:34,450 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 552 transitions. [2022-11-16 11:05:34,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 5.185185185185185) internal successors, (140), 27 states have internal predecessors, (140), 17 states have call successors, (33), 9 states have call predecessors, (33), 10 states have return successors, (32), 15 states have call predecessors, (32), 17 states have call successors, (32) [2022-11-16 11:05:34,450 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 552 transitions. [2022-11-16 11:05:34,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-16 11:05:34,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:05:34,453 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:34,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-11-16 11:05:34,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:05:34,671 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:05:34,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1170886933, now seen corresponding path program 1 times [2022-11-16 11:05:34,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:05:34,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402560549] [2022-11-16 11:05:34,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:34,673 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 [2022-11-16 11:05:34,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:05:34,673 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:05:34,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-16 11:05:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:34,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:05:34,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-16 11:05:35,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:05:35,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:05:35,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402560549] [2022-11-16 11:05:35,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402560549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:35,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:35,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:05:35,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833750712] [2022-11-16 11:05:35,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:35,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:05:35,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:05:35,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:05:35,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:05:35,086 INFO L87 Difference]: Start difference. First operand 439 states and 552 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-16 11:05:35,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:05:35,291 INFO L93 Difference]: Finished difference Result 744 states and 965 transitions. [2022-11-16 11:05:35,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:05:35,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 145 [2022-11-16 11:05:35,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:05:35,294 INFO L225 Difference]: With dead ends: 744 [2022-11-16 11:05:35,295 INFO L226 Difference]: Without dead ends: 437 [2022-11-16 11:05:35,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:05:35,298 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 10 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:05:35,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 699 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:05:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-16 11:05:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 429. [2022-11-16 11:05:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 320 states have (on average 1.1625) internal successors, (372), 327 states have internal predecessors, (372), 63 states have call successors, (63), 38 states have call predecessors, (63), 45 states have return successors, (95), 63 states have call predecessors, (95), 62 states have call successors, (95) [2022-11-16 11:05:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 530 transitions. [2022-11-16 11:05:35,401 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 530 transitions. Word has length 145 [2022-11-16 11:05:35,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:05:35,401 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 530 transitions. [2022-11-16 11:05:35,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-16 11:05:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 530 transitions. [2022-11-16 11:05:35,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-16 11:05:35,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:05:35,403 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:35,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:35,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:05:35,621 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:05:35,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:35,622 INFO L85 PathProgramCache]: Analyzing trace with hash -85740943, now seen corresponding path program 1 times [2022-11-16 11:05:35,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:05:35,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775463030] [2022-11-16 11:05:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:35,622 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 [2022-11-16 11:05:35,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:05:35,623 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:05:35,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 (19)] Waiting until timeout for monitored process [2022-11-16 11:05:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:35,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 11:05:35,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-16 11:05:36,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:05:36,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:05:36,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775463030] [2022-11-16 11:05:36,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775463030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:36,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:36,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:05:36,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389683853] [2022-11-16 11:05:36,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:36,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:05:36,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:05:36,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:05:36,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:05:36,044 INFO L87 Difference]: Start difference. First operand 429 states and 530 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-16 11:05:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:05:36,357 INFO L93 Difference]: Finished difference Result 771 states and 980 transitions. [2022-11-16 11:05:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:05:36,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 143 [2022-11-16 11:05:36,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:05:36,360 INFO L225 Difference]: With dead ends: 771 [2022-11-16 11:05:36,361 INFO L226 Difference]: Without dead ends: 374 [2022-11-16 11:05:36,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:05:36,363 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 89 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:05:36,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 781 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:05:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-11-16 11:05:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 357. [2022-11-16 11:05:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 260 states have (on average 1.1423076923076922) internal successors, (297), 265 states have internal predecessors, (297), 56 states have call successors, (56), 35 states have call predecessors, (56), 40 states have return successors, (71), 56 states have call predecessors, (71), 55 states have call successors, (71) [2022-11-16 11:05:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 424 transitions. [2022-11-16 11:05:36,431 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 424 transitions. Word has length 143 [2022-11-16 11:05:36,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:05:36,431 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 424 transitions. [2022-11-16 11:05:36,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-16 11:05:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 424 transitions. [2022-11-16 11:05:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-16 11:05:36,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:05:36,433 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:36,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 (19)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:36,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:05:36,648 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:05:36,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:36,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1077553845, now seen corresponding path program 1 times [2022-11-16 11:05:36,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:05:36,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402635805] [2022-11-16 11:05:36,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:36,650 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 [2022-11-16 11:05:36,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:05:36,651 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:05:36,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-16 11:05:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:37,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:05:37,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-16 11:05:37,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:05:37,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:05:37,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402635805] [2022-11-16 11:05:37,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402635805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:05:37,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:05:37,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:05:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568842902] [2022-11-16 11:05:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:05:37,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:05:37,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:05:37,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:05:37,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:05:37,178 INFO L87 Difference]: Start difference. First operand 357 states and 424 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-16 11:05:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:05:37,683 INFO L93 Difference]: Finished difference Result 522 states and 632 transitions. [2022-11-16 11:05:37,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:05:37,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 145 [2022-11-16 11:05:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:05:37,686 INFO L225 Difference]: With dead ends: 522 [2022-11-16 11:05:37,686 INFO L226 Difference]: Without dead ends: 351 [2022-11-16 11:05:37,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:05:37,688 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 82 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:05:37,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 938 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:05:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-16 11:05:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 340. [2022-11-16 11:05:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 245 states have (on average 1.1346938775510205) internal successors, (278), 249 states have internal predecessors, (278), 56 states have call successors, (56), 34 states have call predecessors, (56), 38 states have return successors, (68), 56 states have call predecessors, (68), 55 states have call successors, (68) [2022-11-16 11:05:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 402 transitions. [2022-11-16 11:05:37,782 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 402 transitions. Word has length 145 [2022-11-16 11:05:37,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:05:37,783 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 402 transitions. [2022-11-16 11:05:37,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-16 11:05:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 402 transitions. [2022-11-16 11:05:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-16 11:05:37,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:05:37,785 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:05:37,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:38,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:05:38,001 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:05:38,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:38,001 INFO L85 PathProgramCache]: Analyzing trace with hash 755399844, now seen corresponding path program 1 times [2022-11-16 11:05:38,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:05:38,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868300861] [2022-11-16 11:05:38,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:05:38,002 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 [2022-11-16 11:05:38,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:05:38,003 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:05:38,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 (21)] Waiting until timeout for monitored process [2022-11-16 11:05:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:05:38,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-16 11:05:38,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:06:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 148 proven. 21 refuted. 7 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-16 11:06:45,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:07:11,148 INFO L321 Elim1Store]: treesize reduction 17, result has 82.8 percent of original size [2022-11-16 11:07:11,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 125 [2022-11-16 11:07:11,918 INFO L321 Elim1Store]: treesize reduction 8, result has 88.1 percent of original size [2022-11-16 11:07:11,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 132 [2022-11-16 11:07:17,404 INFO L321 Elim1Store]: treesize reduction 21, result has 78.8 percent of original size [2022-11-16 11:07:17,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 121 [2022-11-16 11:07:17,796 INFO L321 Elim1Store]: treesize reduction 15, result has 77.6 percent of original size [2022-11-16 11:07:17,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 125 [2022-11-16 11:07:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 7 proven. 59 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-11-16 11:07:20,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:07:20,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868300861] [2022-11-16 11:07:20,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868300861] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:07:20,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:07:20,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 39 [2022-11-16 11:07:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780475755] [2022-11-16 11:07:20,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:07:20,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 11:07:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:07:20,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 11:07:20,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1323, Unknown=28, NotChecked=0, Total=1482 [2022-11-16 11:07:20,424 INFO L87 Difference]: Start difference. First operand 340 states and 402 transitions. Second operand has 39 states, 37 states have (on average 4.081081081081081) internal successors, (151), 32 states have internal predecessors, (151), 12 states have call successors, (34), 5 states have call predecessors, (34), 12 states have return successors, (34), 12 states have call predecessors, (34), 12 states have call successors, (34) [2022-11-16 11:08:23,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:08:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:08:27,475 INFO L93 Difference]: Finished difference Result 626 states and 773 transitions. [2022-11-16 11:08:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 11:08:27,477 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 4.081081081081081) internal successors, (151), 32 states have internal predecessors, (151), 12 states have call successors, (34), 5 states have call predecessors, (34), 12 states have return successors, (34), 12 states have call predecessors, (34), 12 states have call successors, (34) Word has length 156 [2022-11-16 11:08:27,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:08:27,480 INFO L225 Difference]: With dead ends: 626 [2022-11-16 11:08:27,480 INFO L226 Difference]: Without dead ends: 447 [2022-11-16 11:08:27,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 275 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 141.5s TimeCoverageRelationStatistics Valid=333, Invalid=3278, Unknown=49, NotChecked=0, Total=3660 [2022-11-16 11:08:27,483 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 136 mSDsluCounter, 3263 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 3458 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 814 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:08:27,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 3458 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1131 Invalid, 1 Unknown, 814 Unchecked, 8.7s Time] [2022-11-16 11:08:27,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-11-16 11:08:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 400. [2022-11-16 11:08:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 296 states have (on average 1.125) internal successors, (333), 300 states have internal predecessors, (333), 60 states have call successors, (60), 38 states have call predecessors, (60), 43 states have return successors, (75), 61 states have call predecessors, (75), 59 states have call successors, (75) [2022-11-16 11:08:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 468 transitions. [2022-11-16 11:08:27,610 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 468 transitions. Word has length 156 [2022-11-16 11:08:27,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:08:27,610 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 468 transitions. [2022-11-16 11:08:27,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 4.081081081081081) internal successors, (151), 32 states have internal predecessors, (151), 12 states have call successors, (34), 5 states have call predecessors, (34), 12 states have return successors, (34), 12 states have call predecessors, (34), 12 states have call successors, (34) [2022-11-16 11:08:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 468 transitions. [2022-11-16 11:08:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-16 11:08:27,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:08:27,612 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:08:27,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 (21)] Forceful destruction successful, exit code 0 [2022-11-16 11:08:27,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 [2022-11-16 11:08:27,827 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:08:27,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:08:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1611294750, now seen corresponding path program 1 times [2022-11-16 11:08:27,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:08:27,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690165584] [2022-11-16 11:08:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:08:27,828 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 [2022-11-16 11:08:27,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:08:27,829 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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) [2022-11-16 11:08:27,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05c07925-9a99-4339-a97b-52eaef2fb368/bin/uautomizer-tPACEb0tL8/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 (22)] Waiting until timeout for monitored process [2022-11-16 11:08:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:28,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 11:08:28,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:08:30,449 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24|))))) is different from true [2022-11-16 11:08:32,604 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25|))))) is different from true [2022-11-16 11:08:34,829 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_45| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_45|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_45| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_45|))))) is different from true [2022-11-16 11:08:37,020 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_22| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_20| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_22|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_20|) (_ bv0 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_22| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_20| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_22|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_20|))))) is different from true [2022-11-16 11:08:45,205 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:08:51,623 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:08:57,828 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:09:04,121 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:09:09,687 WARN L233 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:09:15,999 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)