./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc --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 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f --- 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-5e519f3 [2022-11-02 20:20:45,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:20:45,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:20:45,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:20:45,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:20:45,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:20:45,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:20:45,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:20:45,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:20:45,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:20:45,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:20:45,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:20:45,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:20:45,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:20:45,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:20:45,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:20:45,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:20:45,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:20:45,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:20:45,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:20:45,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:20:45,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:20:45,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:20:45,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:20:45,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:20:45,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:20:45,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:20:45,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:20:45,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:20:45,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:20:45,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:20:45,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:20:45,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:20:45,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:20:45,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:20:45,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:20:45,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:20:45,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:20:45,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:20:45,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:20:45,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:20:45,896 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:20:45,935 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:20:45,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:20:45,936 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:20:45,936 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:20:45,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:20:45,938 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:20:45,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:20:45,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:20:45,947 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:20:45,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:20:45,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:20:45,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:20:45,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:20:45,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:20:45,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:20:45,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:20:45,949 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:20:45,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:20:45,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:20:45,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:20:45,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:20:45,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:20:45,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:20:45,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:20:45,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:20:45,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:20:45,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:20:45,954 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:20:45,954 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:20:45,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:20:45,954 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_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/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_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc 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 -> 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f [2022-11-02 20:20:46,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:20:46,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:20:46,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:20:46,337 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:20:46,338 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:20:46,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-11-02 20:20:46,451 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/data/a7bb4dc57/08d5c1e58896447eb439ace99fe1524e/FLAG1497bbf9a [2022-11-02 20:20:47,315 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:20:47,316 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-11-02 20:20:47,359 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/data/a7bb4dc57/08d5c1e58896447eb439ace99fe1524e/FLAG1497bbf9a [2022-11-02 20:20:47,426 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/data/a7bb4dc57/08d5c1e58896447eb439ace99fe1524e [2022-11-02 20:20:47,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:20:47,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:20:47,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:20:47,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:20:47,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:20:47,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:20:47" (1/1) ... [2022-11-02 20:20:47,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a397f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:47, skipping insertion in model container [2022-11-02 20:20:47,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:20:47" (1/1) ... [2022-11-02 20:20:47,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:20:47,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:20:47,873 WARN L230 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_e6170b01-a093-44f8-8f8c-c2c566ddb789/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-11-02 20:20:47,881 WARN L230 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_e6170b01-a093-44f8-8f8c-c2c566ddb789/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-11-02 20:20:48,819 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:48,821 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:48,823 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:48,825 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:48,827 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:48,854 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:48,870 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:48,872 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:48,872 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:48,875 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:48,876 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:48,877 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:48,878 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:49,250 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-02 20:20:49,251 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-02 20:20:49,252 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-02 20:20:49,254 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-02 20:20:49,255 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-02 20:20:49,256 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-02 20:20:49,257 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-02 20:20:49,258 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-02 20:20:49,259 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-02 20:20:49,260 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-02 20:20:49,441 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-02 20:20:49,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:20:49,488 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:20:49,516 WARN L230 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_e6170b01-a093-44f8-8f8c-c2c566ddb789/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-11-02 20:20:49,517 WARN L230 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_e6170b01-a093-44f8-8f8c-c2c566ddb789/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-11-02 20:20:49,576 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:49,587 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:49,588 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:49,590 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:49,597 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:49,606 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:49,606 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:49,608 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:49,608 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:49,610 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:49,610 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:49,611 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:49,611 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:20:49,658 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-02 20:20:49,660 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-02 20:20:49,661 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-02 20:20:49,662 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-02 20:20:49,664 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-02 20:20:49,665 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-02 20:20:49,666 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-02 20:20:49,666 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-02 20:20:49,667 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-02 20:20:49,668 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-02 20:20:49,701 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-02 20:20:49,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:20:50,210 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:20:50,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:50 WrapperNode [2022-11-02 20:20:50,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:20:50,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:20:50,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:20:50,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:20:50,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:50" (1/1) ... [2022-11-02 20:20:50,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:50" (1/1) ... [2022-11-02 20:20:50,439 INFO L138 Inliner]: procedures = 679, calls = 1039, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 58 [2022-11-02 20:20:50,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:20:50,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:20:50,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:20:50,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:20:50,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:50" (1/1) ... [2022-11-02 20:20:50,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:50" (1/1) ... [2022-11-02 20:20:50,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:50" (1/1) ... [2022-11-02 20:20:50,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:50" (1/1) ... [2022-11-02 20:20:50,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:50" (1/1) ... [2022-11-02 20:20:50,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:50" (1/1) ... [2022-11-02 20:20:50,512 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:50" (1/1) ... [2022-11-02 20:20:50,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:50" (1/1) ... [2022-11-02 20:20:50,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:20:50,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:20:50,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:20:50,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:20:50,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:50" (1/1) ... [2022-11-02 20:20:50,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:20:50,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:50,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:20:50,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:20:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:20:50,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-02 20:20:50,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-02 20:20:50,638 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-02 20:20:50,639 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-02 20:20:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:20:50,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:20:50,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:20:50,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:20:50,642 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:20:50,644 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:20:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:20:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:20:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:20:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-02 20:20:50,646 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-02 20:20:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:20:51,042 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:20:51,045 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:20:51,331 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:20:51,340 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:20:51,340 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:20:51,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:20:51 BoogieIcfgContainer [2022-11-02 20:20:51,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:20:51,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:20:51,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:20:51,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:20:51,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:20:47" (1/3) ... [2022-11-02 20:20:51,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ac5bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:20:51, skipping insertion in model container [2022-11-02 20:20:51,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:50" (2/3) ... [2022-11-02 20:20:51,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ac5bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:20:51, skipping insertion in model container [2022-11-02 20:20:51,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:20:51" (3/3) ... [2022-11-02 20:20:51,355 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2022-11-02 20:20:51,394 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:20:51,395 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:20:51,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:20:51,506 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;@66390f91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:20:51,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:20:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-02 20:20:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:20:51,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:51,528 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:51,529 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:51,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:51,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1117195627, now seen corresponding path program 1 times [2022-11-02 20:20:51,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:51,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374483859] [2022-11-02 20:20:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:52,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:20:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:20:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:52,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:20:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:20:52,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:52,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374483859] [2022-11-02 20:20:52,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374483859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:52,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:52,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:20:52,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492277112] [2022-11-02 20:20:52,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:52,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:20:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:52,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:20:52,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:20:52,333 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:20:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:52,365 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2022-11-02 20:20:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:20:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-11-02 20:20:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:52,377 INFO L225 Difference]: With dead ends: 94 [2022-11-02 20:20:52,377 INFO L226 Difference]: Without dead ends: 45 [2022-11-02 20:20:52,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:20:52,385 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:52,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:20:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-02 20:20:52,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-02 20:20:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-02 20:20:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-11-02 20:20:52,438 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 28 [2022-11-02 20:20:52,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:52,440 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-11-02 20:20:52,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:20:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-11-02 20:20:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:20:52,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:52,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:52,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:20:52,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:52,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:52,445 INFO L85 PathProgramCache]: Analyzing trace with hash 96127273, now seen corresponding path program 1 times [2022-11-02 20:20:52,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:52,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236340986] [2022-11-02 20:20:52,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:52,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:54,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:20:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:55,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:20:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:55,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:20:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:20:55,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:55,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236340986] [2022-11-02 20:20:55,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236340986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:20:55,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003387981] [2022-11-02 20:20:55,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:55,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:55,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:55,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:20:55,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:20:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:55,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-02 20:20:55,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:56,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:56,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:56,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:20:56,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:56,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:56,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:20:56,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:56,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-02 20:20:56,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-11-02 20:20:56,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-11-02 20:20:56,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-02 20:20:56,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-11-02 20:20:56,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:20:56,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:20:58,086 INFO L356 Elim1Store]: treesize reduction 8, result has 71.4 percent of original size [2022-11-02 20:20:58,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 133 treesize of output 94 [2022-11-02 20:20:58,125 INFO L356 Elim1Store]: treesize reduction 46, result has 6.1 percent of original size [2022-11-02 20:20:58,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 35 [2022-11-02 20:20:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:20:58,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:20:58,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003387981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:58,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:20:58,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 26 [2022-11-02 20:20:58,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760743944] [2022-11-02 20:20:58,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:58,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:20:58,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:58,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:20:58,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:20:58,211 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:20:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:58,346 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2022-11-02 20:20:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:20:58,348 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-11-02 20:20:58,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:58,351 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:20:58,351 INFO L226 Difference]: Without dead ends: 68 [2022-11-02 20:20:58,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:20:58,354 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 14 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:58,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 503 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 104 Unchecked, 0.1s Time] [2022-11-02 20:20:58,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-02 20:20:58,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-11-02 20:20:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 7 states have call predecessors, (15), 8 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-11-02 20:20:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-11-02 20:20:58,371 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 28 [2022-11-02 20:20:58,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:58,371 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-11-02 20:20:58,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:20:58,372 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-11-02 20:20:58,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:20:58,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:58,374 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:58,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:58,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:58,595 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:58,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:58,596 INFO L85 PathProgramCache]: Analyzing trace with hash -713219353, now seen corresponding path program 1 times [2022-11-02 20:20:58,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:58,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187138404] [2022-11-02 20:20:58,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:58,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:59,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:20:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:59,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:20:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:59,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:20:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:20:59,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:59,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187138404] [2022-11-02 20:20:59,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187138404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:59,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:59,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:59,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025423867] [2022-11-02 20:20:59,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:59,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:20:59,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:59,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:20:59,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:20:59,526 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:20:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:59,820 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2022-11-02 20:20:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:20:59,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-11-02 20:20:59,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:59,823 INFO L225 Difference]: With dead ends: 121 [2022-11-02 20:20:59,823 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 20:20:59,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:59,825 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 23 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:59,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 151 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:20:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 20:20:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-11-02 20:20:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.163265306122449) internal successors, (57), 52 states have internal predecessors, (57), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-02 20:20:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2022-11-02 20:20:59,842 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 28 [2022-11-02 20:20:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:59,843 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2022-11-02 20:20:59,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:20:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2022-11-02 20:20:59,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:20:59,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:59,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:59,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:20:59,845 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:59,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:59,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1106246363, now seen corresponding path program 1 times [2022-11-02 20:20:59,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:59,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107062527] [2022-11-02 20:20:59,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:59,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:59,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:20:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:00,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:00,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:21:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:21:00,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:00,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107062527] [2022-11-02 20:21:00,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107062527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:00,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:00,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:21:00,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563147178] [2022-11-02 20:21:00,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:00,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:21:00,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:00,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:21:00,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:00,118 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:21:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:00,166 INFO L93 Difference]: Finished difference Result 143 states and 170 transitions. [2022-11-02 20:21:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:21:00,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-11-02 20:21:00,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:00,169 INFO L225 Difference]: With dead ends: 143 [2022-11-02 20:21:00,169 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 20:21:00,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:00,171 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 13 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:00,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 139 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:21:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 20:21:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2022-11-02 20:21:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-02 20:21:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-11-02 20:21:00,185 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 28 [2022-11-02 20:21:00,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:00,186 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-11-02 20:21:00,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:21:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-11-02 20:21:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:21:00,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:00,188 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:21:00,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:21:00,189 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:00,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:00,190 INFO L85 PathProgramCache]: Analyzing trace with hash 695086179, now seen corresponding path program 1 times [2022-11-02 20:21:00,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:00,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157728250] [2022-11-02 20:21:00,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:00,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:01,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:01,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:01,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:21:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:01,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:21:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:01,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:21:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:21:02,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:02,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157728250] [2022-11-02 20:21:02,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157728250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:02,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:02,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:21:02,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033895157] [2022-11-02 20:21:02,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:02,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:21:02,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:02,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:21:02,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:02,027 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-02 20:21:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:02,447 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-11-02 20:21:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:21:02,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-11-02 20:21:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:02,449 INFO L225 Difference]: With dead ends: 67 [2022-11-02 20:21:02,449 INFO L226 Difference]: Without dead ends: 65 [2022-11-02 20:21:02,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:21:02,451 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 18 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:02,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 312 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:21:02,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-02 20:21:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-11-02 20:21:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.119047619047619) internal successors, (47), 44 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-11-02 20:21:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2022-11-02 20:21:02,475 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 42 [2022-11-02 20:21:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:02,477 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2022-11-02 20:21:02,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-02 20:21:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2022-11-02 20:21:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:21:02,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:02,491 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:21:02,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:21:02,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:02,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:02,492 INFO L85 PathProgramCache]: Analyzing trace with hash -114260447, now seen corresponding path program 1 times [2022-11-02 20:21:02,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:02,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371148060] [2022-11-02 20:21:02,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:02,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:03,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:03,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:03,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:21:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:03,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:21:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:03,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:21:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:21:04,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:04,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371148060] [2022-11-02 20:21:04,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371148060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:04,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431809986] [2022-11-02 20:21:04,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:04,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:04,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:04,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:04,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:21:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:04,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-02 20:21:04,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:04,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:21:04,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:21:04,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 21 treesize of output 25 [2022-11-02 20:21:04,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 16 [2022-11-02 20:21:04,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 9 [2022-11-02 20:21:04,467 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-02 20:21:04,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2022-11-02 20:21:04,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-11-02 20:21:04,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:21:05,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:21:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:06,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:06,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:06,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:06,816 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:06,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 69 treesize of output 63 [2022-11-02 20:21:06,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:06,832 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:21:06,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 111 [2022-11-02 20:21:06,845 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:06,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 58 [2022-11-02 20:21:06,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:06,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2022-11-02 20:21:06,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-02 20:21:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:21:06,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431809986] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:06,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:21:06,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16, 10] total 32 [2022-11-02 20:21:06,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471832504] [2022-11-02 20:21:06,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:06,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:21:06,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:06,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:21:06,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-11-02 20:21:06,922 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:07,473 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2022-11-02 20:21:07,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:21:07,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-11-02 20:21:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:07,475 INFO L225 Difference]: With dead ends: 105 [2022-11-02 20:21:07,475 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 20:21:07,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2022-11-02 20:21:07,477 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 73 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:07,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 137 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:21:07,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 20:21:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-11-02 20:21:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 49 states have internal predecessors, (52), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-02 20:21:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2022-11-02 20:21:07,494 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 42 [2022-11-02 20:21:07,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:07,494 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-11-02 20:21:07,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-11-02 20:21:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:21:07,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:07,496 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:21:07,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:07,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:21:07,719 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:07,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:07,720 INFO L85 PathProgramCache]: Analyzing trace with hash -507287457, now seen corresponding path program 1 times [2022-11-02 20:21:07,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:07,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154228640] [2022-11-02 20:21:07,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:07,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:21:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:21:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:21:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:21:08,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:08,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154228640] [2022-11-02 20:21:08,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154228640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:08,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:08,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:08,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080935240] [2022-11-02 20:21:08,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:08,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:21:08,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:08,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:21:08,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:08,363 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-02 20:21:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:08,504 INFO L93 Difference]: Finished difference Result 116 states and 135 transitions. [2022-11-02 20:21:08,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:21:08,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-11-02 20:21:08,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:08,510 INFO L225 Difference]: With dead ends: 116 [2022-11-02 20:21:08,510 INFO L226 Difference]: Without dead ends: 71 [2022-11-02 20:21:08,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:21:08,514 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:08,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 205 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:21:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-02 20:21:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2022-11-02 20:21:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-02 20:21:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-11-02 20:21:08,547 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 42 [2022-11-02 20:21:08,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:08,550 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-11-02 20:21:08,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-02 20:21:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-11-02 20:21:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:21:08,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:08,553 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-02 20:21:08,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:21:08,554 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:08,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:08,555 INFO L85 PathProgramCache]: Analyzing trace with hash 709260864, now seen corresponding path program 1 times [2022-11-02 20:21:08,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:08,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981401215] [2022-11-02 20:21:08,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:08,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:21:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:21:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:21:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:21:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:21:08,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:08,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981401215] [2022-11-02 20:21:08,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981401215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:08,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:08,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:21:08,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558941081] [2022-11-02 20:21:08,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:08,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:21:08,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:21:08,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:21:08,945 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:21:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:09,087 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-11-02 20:21:09,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:21:09,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-11-02 20:21:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:09,090 INFO L225 Difference]: With dead ends: 71 [2022-11-02 20:21:09,091 INFO L226 Difference]: Without dead ends: 69 [2022-11-02 20:21:09,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:21:09,092 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 9 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:09,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 210 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:21:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-02 20:21:09,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-02 20:21:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-02 20:21:09,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2022-11-02 20:21:09,120 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 48 [2022-11-02 20:21:09,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:09,121 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2022-11-02 20:21:09,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:21:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2022-11-02 20:21:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 20:21:09,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:09,124 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-11-02 20:21:09,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:21:09,125 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:09,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:09,125 INFO L85 PathProgramCache]: Analyzing trace with hash -593356994, now seen corresponding path program 1 times [2022-11-02 20:21:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:09,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574639207] [2022-11-02 20:21:09,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:09,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:10,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:10,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:21:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:10,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:21:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:10,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:21:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:10,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:21:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:10,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:21:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:10,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:21:10,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:10,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574639207] [2022-11-02 20:21:10,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574639207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:10,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:10,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:21:10,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947825010] [2022-11-02 20:21:10,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:10,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:21:10,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:10,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:21:10,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:21:10,900 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:21:11,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:11,293 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-11-02 20:21:11,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:21:11,294 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2022-11-02 20:21:11,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:11,295 INFO L225 Difference]: With dead ends: 80 [2022-11-02 20:21:11,295 INFO L226 Difference]: Without dead ends: 78 [2022-11-02 20:21:11,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:21:11,296 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:11,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 297 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:21:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-02 20:21:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-11-02 20:21:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 55 states have internal predecessors, (58), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-11-02 20:21:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2022-11-02 20:21:11,313 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 63 [2022-11-02 20:21:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:11,313 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2022-11-02 20:21:11,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:21:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2022-11-02 20:21:11,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 20:21:11,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:11,315 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-11-02 20:21:11,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:21:11,315 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:11,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:11,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1402703620, now seen corresponding path program 1 times [2022-11-02 20:21:11,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:11,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222349087] [2022-11-02 20:21:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:11,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:21:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:21:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:21:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:21:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:21:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:21:12,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:12,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222349087] [2022-11-02 20:21:12,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222349087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:12,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:12,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:21:12,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506153109] [2022-11-02 20:21:12,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:12,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:21:12,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:12,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:21:12,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:21:12,318 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:21:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:12,513 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-11-02 20:21:12,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:21:12,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2022-11-02 20:21:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:12,515 INFO L225 Difference]: With dead ends: 107 [2022-11-02 20:21:12,515 INFO L226 Difference]: Without dead ends: 80 [2022-11-02 20:21:12,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:12,516 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:12,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 151 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:21:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-02 20:21:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-11-02 20:21:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-11-02 20:21:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-11-02 20:21:12,533 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 63 [2022-11-02 20:21:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:12,534 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-11-02 20:21:12,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:21:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-11-02 20:21:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 20:21:12,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:12,536 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-11-02 20:21:12,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:21:12,536 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:12,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1795730630, now seen corresponding path program 1 times [2022-11-02 20:21:12,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:12,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019650324] [2022-11-02 20:21:12,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:12,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:21:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:21:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:21:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:21:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:21:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:21:12,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:12,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019650324] [2022-11-02 20:21:12,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019650324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:12,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:12,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:21:12,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406147017] [2022-11-02 20:21:12,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:12,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:21:12,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:12,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:21:12,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:12,816 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-02 20:21:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:12,845 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-11-02 20:21:12,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:21:12,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2022-11-02 20:21:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:12,849 INFO L225 Difference]: With dead ends: 110 [2022-11-02 20:21:12,849 INFO L226 Difference]: Without dead ends: 73 [2022-11-02 20:21:12,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:12,850 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:12,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 143 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:21:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-02 20:21:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-02 20:21:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-02 20:21:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-02 20:21:12,865 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 63 [2022-11-02 20:21:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:12,865 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-02 20:21:12,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-02 20:21:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-02 20:21:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:21:12,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:12,867 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:12,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:21:12,868 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:12,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:12,868 INFO L85 PathProgramCache]: Analyzing trace with hash 180273006, now seen corresponding path program 1 times [2022-11-02 20:21:12,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:12,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657658561] [2022-11-02 20:21:12,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:12,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:14,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:14,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:14,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:21:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:14,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:21:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:14,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:21:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:14,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:21:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:14,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:21:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:15,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:21:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:15,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:21:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-02 20:21:15,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:15,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657658561] [2022-11-02 20:21:15,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657658561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:15,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:15,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-02 20:21:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122093072] [2022-11-02 20:21:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:15,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:21:15,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:15,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:21:15,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:21:15,287 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-02 20:21:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:16,120 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-11-02 20:21:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:21:16,121 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 77 [2022-11-02 20:21:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:16,122 INFO L225 Difference]: With dead ends: 84 [2022-11-02 20:21:16,122 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 20:21:16,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:21:16,123 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 33 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:16,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 349 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:21:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 20:21:16,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-11-02 20:21:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 58 states have internal predecessors, (59), 13 states have call successors, (13), 10 states have call predecessors, (13), 12 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-11-02 20:21:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2022-11-02 20:21:16,138 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 77 [2022-11-02 20:21:16,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:16,138 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2022-11-02 20:21:16,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-02 20:21:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-11-02 20:21:16,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:21:16,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:16,140 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2022-11-02 20:21:16,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:21:16,140 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:16,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:16,141 INFO L85 PathProgramCache]: Analyzing trace with hash -629073620, now seen corresponding path program 1 times [2022-11-02 20:21:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:16,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190888080] [2022-11-02 20:21:16,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:16,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:16,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:21:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:16,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:21:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:21:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:16,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:21:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:16,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:21:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:16,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:16,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:21:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:16,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:21:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-02 20:21:17,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:17,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190888080] [2022-11-02 20:21:17,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190888080] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:17,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384682270] [2022-11-02 20:21:17,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:17,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:17,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:17,031 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:17,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:21:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 20:21:17,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:18,713 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_7|) 0)))) is different from true [2022-11-02 20:21:20,046 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_8|) 0)))) is different from true [2022-11-02 20:21:21,319 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2022-11-02 20:21:22,631 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 0)))) is different from true [2022-11-02 20:21:23,811 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 0)))) is different from true [2022-11-02 20:21:42,280 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 12 not checked. [2022-11-02 20:21:42,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:42,761 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 20:21:42,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:21:42,774 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-02 20:21:42,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:21:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-02 20:21:42,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384682270] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:21:42,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:21:42,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 13] total 26 [2022-11-02 20:21:42,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435428613] [2022-11-02 20:21:42,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:21:42,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 20:21:42,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:42,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 20:21:42,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=358, Unknown=9, NotChecked=210, Total=650 [2022-11-02 20:21:42,809 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-02 20:21:54,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:54,890 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2022-11-02 20:21:54,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:21:54,891 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 77 [2022-11-02 20:21:54,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:54,892 INFO L225 Difference]: With dead ends: 105 [2022-11-02 20:21:54,892 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 20:21:54,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 156 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=190, Invalid=803, Unknown=19, NotChecked=320, Total=1332 [2022-11-02 20:21:54,894 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 53 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 544 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:54,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 399 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 265 Invalid, 0 Unknown, 544 Unchecked, 0.3s Time] [2022-11-02 20:21:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 20:21:54,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-11-02 20:21:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 59 states have internal predecessors, (60), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-11-02 20:21:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-11-02 20:21:54,910 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 77 [2022-11-02 20:21:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:54,911 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-11-02 20:21:54,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-02 20:21:54,911 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-11-02 20:21:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:21:54,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:54,912 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2022-11-02 20:21:54,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:55,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:21:55,113 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:55,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1022100630, now seen corresponding path program 1 times [2022-11-02 20:21:55,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:55,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959326541] [2022-11-02 20:21:55,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:55,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:55,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:55,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:55,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:21:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:55,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:21:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:55,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:21:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:55,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:21:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:55,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:21:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:55,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:55,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:21:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:55,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:21:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-02 20:21:55,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:55,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959326541] [2022-11-02 20:21:55,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959326541] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:55,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945967227] [2022-11-02 20:21:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:55,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:55,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:55,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:55,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:21:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:55,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-02 20:21:55,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-02 20:21:56,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-02 20:21:56,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945967227] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:21:56,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:21:56,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 12 [2022-11-02 20:21:56,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489786865] [2022-11-02 20:21:56,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:21:56,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:21:56,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:56,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:21:56,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:21:56,572 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 20:21:56,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:56,841 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2022-11-02 20:21:56,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:21:56,842 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 77 [2022-11-02 20:21:56,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:56,843 INFO L225 Difference]: With dead ends: 96 [2022-11-02 20:21:56,843 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 20:21:56,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 165 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:21:56,844 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 17 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:56,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 308 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:21:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 20:21:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-11-02 20:21:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.0) internal successors, (48), 48 states have internal predecessors, (48), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-02 20:21:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-11-02 20:21:56,859 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 77 [2022-11-02 20:21:56,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:56,860 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-11-02 20:21:56,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 20:21:56,860 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-11-02 20:21:56,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:21:56,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:56,861 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:56,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:57,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:21:57,075 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:57,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:57,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1529037313, now seen corresponding path program 1 times [2022-11-02 20:21:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:57,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045842471] [2022-11-02 20:21:57,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:57,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:21:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:21:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:21:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:21:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:21:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:21:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:21:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:21:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-02 20:21:58,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:58,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045842471] [2022-11-02 20:21:58,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045842471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:58,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:58,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:21:58,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566764555] [2022-11-02 20:21:58,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:58,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:21:58,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:58,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:21:58,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:58,227 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-02 20:21:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:58,601 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-11-02 20:21:58,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:21:58,601 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 83 [2022-11-02 20:21:58,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:58,602 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:21:58,602 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:21:58,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:21:58,603 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 26 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:58,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 254 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:21:58,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:21:58,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:21:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:58,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:21:58,604 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2022-11-02 20:21:58,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:58,605 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:21:58,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-02 20:21:58,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:21:58,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:21:58,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:21:58,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:21:58,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:22:00,429 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validFINAL(lines 4717 4721) no Hoare annotation was computed. [2022-11-02 20:22:00,429 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2022-11-02 20:22:00,430 INFO L899 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2022-11-02 20:22:00,430 INFO L899 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2022-11-02 20:22:00,430 INFO L899 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2022-11-02 20:22:00,430 INFO L899 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2022-11-02 20:22:00,430 INFO L902 garLoopResultBuilder]: At program point aws_linked_list_node_next_is_validENTRY(lines 4717 4721) the Hoare annotation is: true [2022-11-02 20:22:00,430 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validFINAL(lines 4728 4732) no Hoare annotation was computed. [2022-11-02 20:22:00,430 INFO L899 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2022-11-02 20:22:00,430 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2022-11-02 20:22:00,431 INFO L899 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2022-11-02 20:22:00,431 INFO L899 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2022-11-02 20:22:00,431 INFO L899 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2022-11-02 20:22:00,431 INFO L902 garLoopResultBuilder]: At program point aws_linked_list_node_prev_is_validENTRY(lines 4728 4732) the Hoare annotation is: true [2022-11-02 20:22:00,431 INFO L899 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2022-11-02 20:22:00,434 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:22:00,435 INFO L895 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (< 0 (+ |#StackHeapBarrier| 1)) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2022-11-02 20:22:00,435 INFO L902 garLoopResultBuilder]: At program point L7393(line 7393) the Hoare annotation is: true [2022-11-02 20:22:00,435 INFO L899 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2022-11-02 20:22:00,436 INFO L895 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret675#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret675#1|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (< 0 (+ |#StackHeapBarrier| 1)) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2022-11-02 20:22:00,436 INFO L895 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (< 0 (+ |#StackHeapBarrier| 1)) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2022-11-02 20:22:00,437 INFO L895 garLoopResultBuilder]: At program point L4854(lines 4848 4855) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (< 0 (+ |#StackHeapBarrier| 1)) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0))) [2022-11-02 20:22:00,437 INFO L895 garLoopResultBuilder]: At program point L4852-1(line 4852) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_#t~ret337#1|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (< 0 (+ |#StackHeapBarrier| 1)) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (<= |ULTIMATE.start_aws_linked_list_prev_#t~ret337#1| 1))) [2022-11-02 20:22:00,437 INFO L899 garLoopResultBuilder]: For program point L4852-2(line 4852) no Hoare annotation was computed. [2022-11-02 20:22:00,438 INFO L895 garLoopResultBuilder]: At program point L4852(line 4852) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (<= (select (select |#memory_$Pointer$.base| .cse0) .cse2) 0)) (= (select (select |#memory_$Pointer$.base| .cse1) .cse3) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| .cse2) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (< 0 (+ |#StackHeapBarrier| 1)) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0))))) [2022-11-02 20:22:00,438 INFO L895 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (< 0 (+ |#StackHeapBarrier| 1)) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2022-11-02 20:22:00,438 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:22:00,439 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:22:00,439 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:22:00,439 INFO L899 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2022-11-02 20:22:00,439 INFO L895 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret676#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (<= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret676#1| 1) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (< 0 (+ |#StackHeapBarrier| 1)) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2022-11-02 20:22:00,440 INFO L895 garLoopResultBuilder]: At program point L4851(line 4851) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse6 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse2 (select .cse4 .cse6))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (<= (select (select |#memory_$Pointer$.base| .cse0) .cse2) 0)) (= (select (select |#memory_$Pointer$.base| .cse1) .cse3) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3))) (= (select .cse4 8) 0) (not (= (select .cse5 8) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| .cse2) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (< 0 (+ |#StackHeapBarrier| 1)) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0))))) [2022-11-02 20:22:00,440 INFO L895 garLoopResultBuilder]: At program point L4851-1(line 4851) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (<= |ULTIMATE.start_aws_linked_list_prev_#t~ret336#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (<= (select (select |#memory_$Pointer$.base| .cse0) .cse2) 0)) (= (select (select |#memory_$Pointer$.base| .cse1) .cse3) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| .cse2) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (< 0 (+ |#StackHeapBarrier| 1)) (<= 1 |ULTIMATE.start_aws_linked_list_prev_#t~ret336#1|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0))))) [2022-11-02 20:22:00,440 INFO L895 garLoopResultBuilder]: At program point L4853(line 4853) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| |ULTIMATE.start_aws_linked_list_prev_#t~mem338#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_#t~mem338#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (< 0 (+ |#StackHeapBarrier| 1)) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2022-11-02 20:22:00,441 INFO L899 garLoopResultBuilder]: For program point L4853-1(line 4853) no Hoare annotation was computed. [2022-11-02 20:22:00,441 INFO L899 garLoopResultBuilder]: For program point L4849-2(line 4849) no Hoare annotation was computed. [2022-11-02 20:22:00,442 INFO L895 garLoopResultBuilder]: At program point L4849(line 4849) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse6 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select .cse4 .cse6)) (.cse2 (select .cse5 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (<= (select (select |#memory_$Pointer$.base| .cse0) .cse1) 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| .cse1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (let ((.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)))) (= (select .cse4 8) 0) (not (= .cse2 0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (< 0 (+ |#StackHeapBarrier| 1))))) [2022-11-02 20:22:00,443 INFO L899 garLoopResultBuilder]: For program point L4851-2(line 4851) no Hoare annotation was computed. [2022-11-02 20:22:00,443 INFO L899 garLoopResultBuilder]: For program point L7376(lines 7376 7392) no Hoare annotation was computed. [2022-11-02 20:22:00,443 INFO L895 garLoopResultBuilder]: At program point L4849-1(line 4849) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse6 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select .cse4 .cse6)) (.cse2 (select .cse5 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (<= (select (select |#memory_$Pointer$.base| .cse0) .cse1) 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| .cse1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (let ((.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)))) (= (select .cse4 8) 0) (not (= .cse2 0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_#t~ret334#1| 1) (< 0 (+ |#StackHeapBarrier| 1))))) [2022-11-02 20:22:00,443 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-02 20:22:00,444 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-02 20:22:00,444 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-02 20:22:00,444 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-02 20:22:00,444 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-02 20:22:00,445 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-02 20:22:00,445 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-02 20:22:00,446 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-02 20:22:00,446 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-02 20:22:00,447 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-02 20:22:00,450 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:00,453 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:22:00,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:22:00 BoogieIcfgContainer [2022-11-02 20:22:00,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:22:00,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:22:00,511 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:22:00,511 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:22:00,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:20:51" (3/4) ... [2022-11-02 20:22:00,516 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:22:00,527 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2022-11-02 20:22:00,527 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2022-11-02 20:22:00,528 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-02 20:22:00,528 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-02 20:22:00,536 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-02 20:22:00,537 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-02 20:22:00,537 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:22:00,537 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:22:00,571 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((node == node && #memory_$Pointer$[node][node + 8] == before) && before == \result) && 0 < #memory_$Pointer$[rval][rval]) && node == node) && #memory_$Pointer$[rval][rval] == node) && #memory_$Pointer$[#memory_$Pointer$[rval][rval]][node + 8] == rval) && !(before == node)) && node == #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][#memory_$Pointer$[node][node + 8]]) && before == \result) && rval == #memory_$Pointer$[node][node + 8]) && before == rval) && 0 < unknown-#StackHeapBarrier-unknown + 1) && !(rval == 0)) && #memory_$Pointer$[\result][\result] == 0 [2022-11-02 20:22:00,600 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:22:00,600 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:22:00,602 INFO L158 Benchmark]: Toolchain (without parser) took 73168.06ms. Allocated memory was 121.6MB in the beginning and 371.2MB in the end (delta: 249.6MB). Free memory was 77.2MB in the beginning and 254.9MB in the end (delta: -177.7MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2022-11-02 20:22:00,605 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 121.6MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:22:00,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2772.36ms. Allocated memory was 121.6MB in the beginning and 161.5MB in the end (delta: 39.8MB). Free memory was 76.9MB in the beginning and 103.7MB in the end (delta: -26.8MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2022-11-02 20:22:00,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 227.00ms. Allocated memory is still 161.5MB. Free memory was 103.7MB in the beginning and 98.3MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:22:00,606 INFO L158 Benchmark]: Boogie Preprocessor took 79.24ms. Allocated memory is still 161.5MB. Free memory was 98.3MB in the beginning and 95.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:22:00,606 INFO L158 Benchmark]: RCFGBuilder took 822.14ms. Allocated memory is still 161.5MB. Free memory was 95.4MB in the beginning and 76.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-02 20:22:00,607 INFO L158 Benchmark]: TraceAbstraction took 69164.47ms. Allocated memory was 161.5MB in the beginning and 371.2MB in the end (delta: 209.7MB). Free memory was 75.2MB in the beginning and 258.0MB in the end (delta: -182.8MB). Peak memory consumption was 178.2MB. Max. memory is 16.1GB. [2022-11-02 20:22:00,607 INFO L158 Benchmark]: Witness Printer took 89.61ms. Allocated memory is still 371.2MB. Free memory was 258.0MB in the beginning and 254.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:22:00,617 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.34ms. Allocated memory is still 121.6MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2772.36ms. Allocated memory was 121.6MB in the beginning and 161.5MB in the end (delta: 39.8MB). Free memory was 76.9MB in the beginning and 103.7MB in the end (delta: -26.8MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 227.00ms. Allocated memory is still 161.5MB. Free memory was 103.7MB in the beginning and 98.3MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.24ms. Allocated memory is still 161.5MB. Free memory was 98.3MB in the beginning and 95.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 822.14ms. Allocated memory is still 161.5MB. Free memory was 95.4MB in the beginning and 76.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 69164.47ms. Allocated memory was 161.5MB in the beginning and 371.2MB in the end (delta: 209.7MB). Free memory was 75.2MB in the beginning and 258.0MB in the end (delta: -182.8MB). Peak memory consumption was 178.2MB. Max. memory is 16.1GB. * Witness Printer took 89.61ms. Allocated memory is still 371.2MB. Free memory was 258.0MB in the beginning and 254.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.0s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 424 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 357 mSDsluCounter, 3619 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 648 IncrementalHoareTripleChecker+Unchecked, 2849 mSDsCounter, 194 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1805 IncrementalHoareTripleChecker+Invalid, 2647 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 194 mSolverCounterUnsat, 770 mSDtfsCounter, 1805 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 794 GetRequests, 571 SyntacticMatches, 20 SemanticMatches, 203 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 42.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=13, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 26 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 90 PreInvPairs, 103 NumberOfFragments, 1380 HoareAnnotationTreeSize, 90 FomulaSimplifications, 293 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 2533 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 47.8s InterpolantComputationTime, 1013 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1187 ConstructedInterpolants, 77 QuantifiedInterpolants, 9933 SizeOfPredicates, 80 NumberOfNonLiveVariables, 1169 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 648/710 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7393]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4848]: Loop Invariant [2022-11-02 20:22:00,631 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,635 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,635 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,636 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,636 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,636 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,637 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,637 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,637 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,646 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,652 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,652 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,652 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,653 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,653 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:00,653 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,653 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:22:00,654 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((node == node && #memory_$Pointer$[node][node + 8] == before) && before == \result) && 0 < #memory_$Pointer$[rval][rval]) && node == node) && #memory_$Pointer$[rval][rval] == node) && #memory_$Pointer$[#memory_$Pointer$[rval][rval]][node + 8] == rval) && !(before == node)) && node == #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][#memory_$Pointer$[node][node + 8]]) && before == \result) && rval == #memory_$Pointer$[node][node + 8]) && before == rval) && 0 < unknown-#StackHeapBarrier-unknown + 1) && !(rval == 0)) && #memory_$Pointer$[\result][\result] == 0 RESULT: Ultimate proved your program to be correct! [2022-11-02 20:22:00,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6170b01-a093-44f8-8f8c-c2c566ddb789/bin/uautomizer-Dbtcem3rbc/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 Writing output log to file Ultimate.log Result: TRUE