./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5bb1e95e9d6379d31cbb3e207d6fe85ddf495edebf9b764e927537f63dbf829e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:52:38,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:52:38,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:52:38,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:52:38,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:52:38,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:52:38,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:52:38,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:52:38,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:52:38,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:52:39,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:52:39,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:52:39,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:52:39,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:52:39,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:52:39,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:52:39,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:52:39,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:52:39,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:52:39,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:52:39,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:52:39,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:52:39,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:52:39,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:52:39,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:52:39,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:52:39,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:52:39,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:52:39,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:52:39,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:52:39,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:52:39,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:52:39,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:52:39,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:52:39,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:52:39,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:52:39,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:52:39,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:52:39,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:52:39,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:52:39,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:52:39,055 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 12:52:39,102 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:52:39,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:52:39,103 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:52:39,103 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:52:39,104 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:52:39,104 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:52:39,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:52:39,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:52:39,105 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:52:39,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:52:39,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:52:39,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:52:39,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:52:39,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:52:39,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:52:39,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:52:39,108 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:52:39,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:52:39,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:52:39,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:52:39,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:52:39,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:52:39,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:52:39,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:52:39,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:52:39,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:52:39,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:52:39,112 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:52:39,112 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:52:39,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:52:39,112 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_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bb1e95e9d6379d31cbb3e207d6fe85ddf495edebf9b764e927537f63dbf829e [2022-11-16 12:52:39,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:52:39,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:52:39,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:52:39,470 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:52:39,471 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:52:39,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i [2022-11-16 12:52:39,568 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/data/12d174226/ef0d0174c2014d8e946022b1c1990073/FLAG6cb2d12ca [2022-11-16 12:52:40,390 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:52:40,390 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i [2022-11-16 12:52:40,441 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/data/12d174226/ef0d0174c2014d8e946022b1c1990073/FLAG6cb2d12ca [2022-11-16 12:52:40,936 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/data/12d174226/ef0d0174c2014d8e946022b1c1990073 [2022-11-16 12:52:40,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:52:40,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:52:40,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:52:40,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:52:40,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:52:40,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:52:40" (1/1) ... [2022-11-16 12:52:40,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0ae33a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:52:40, skipping insertion in model container [2022-11-16 12:52:40,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:52:40" (1/1) ... [2022-11-16 12:52:40,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:52:41,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:52:41,419 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4494,4507] [2022-11-16 12:52:41,426 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4554,4567] [2022-11-16 12:52:42,334 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:42,335 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:42,336 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:42,337 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:42,338 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:42,365 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:42,366 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:42,370 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:42,374 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:42,379 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:42,380 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:42,381 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:42,381 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:42,795 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 12:52:42,797 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 12:52:42,798 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 12:52:42,800 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 12:52:42,801 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 12:52:42,802 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 12:52:42,803 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 12:52:42,804 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 12:52:42,805 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 12:52:42,806 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 12:52:42,960 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 12:52:43,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:52:43,019 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:52:43,036 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4494,4507] [2022-11-16 12:52:43,036 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4554,4567] [2022-11-16 12:52:43,095 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:43,096 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:43,096 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:43,097 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:43,098 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:43,118 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:43,132 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:43,133 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:43,134 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:43,135 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:43,142 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:43,143 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:43,143 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:52:43,195 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 12:52:43,196 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 12:52:43,197 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 12:52:43,198 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 12:52:43,199 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 12:52:43,199 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 12:52:43,200 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 12:52:43,201 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 12:52:43,201 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 12:52:43,202 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 12:52:43,227 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 12:52:43,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:52:43,535 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:52:43,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:52:43 WrapperNode [2022-11-16 12:52:43,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:52:43,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:52:43,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:52:43,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:52:43,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:52:43" (1/1) ... [2022-11-16 12:52:43,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:52:43" (1/1) ... [2022-11-16 12:52:43,672 INFO L138 Inliner]: procedures = 679, calls = 1039, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 58 [2022-11-16 12:52:43,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:52:43,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:52:43,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:52:43,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:52:43,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:52:43" (1/1) ... [2022-11-16 12:52:43,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:52:43" (1/1) ... [2022-11-16 12:52:43,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:52:43" (1/1) ... [2022-11-16 12:52:43,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:52:43" (1/1) ... [2022-11-16 12:52:43,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:52:43" (1/1) ... [2022-11-16 12:52:43,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:52:43" (1/1) ... [2022-11-16 12:52:43,704 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:52:43" (1/1) ... [2022-11-16 12:52:43,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:52:43" (1/1) ... [2022-11-16 12:52:43,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:52:43,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:52:43,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:52:43,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:52:43,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:52:43" (1/1) ... [2022-11-16 12:52:43,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:52:43,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:52:43,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:52:43,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:52:43,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:52:43,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 12:52:43,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 12:52:43,849 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-16 12:52:43,849 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-16 12:52:43,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:52:43,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:52:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:52:43,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:52:43,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 12:52:43,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 12:52:43,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:52:43,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:52:43,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:52:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-16 12:52:43,855 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-16 12:52:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:52:44,206 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:52:44,211 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:52:44,441 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:52:44,457 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:52:44,457 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:52:44,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:52:44 BoogieIcfgContainer [2022-11-16 12:52:44,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:52:44,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:52:44,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:52:44,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:52:44,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:52:40" (1/3) ... [2022-11-16 12:52:44,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b9d189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:52:44, skipping insertion in model container [2022-11-16 12:52:44,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:52:43" (2/3) ... [2022-11-16 12:52:44,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b9d189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:52:44, skipping insertion in model container [2022-11-16 12:52:44,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:52:44" (3/3) ... [2022-11-16 12:52:44,473 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_next_harness.i [2022-11-16 12:52:44,495 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:52:44,496 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:52:44,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:52:44,611 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;@773838e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:52:44,612 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:52:44,619 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-16 12:52:44,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 12:52:44,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:52:44,633 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-16 12:52:44,633 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:52:44,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:52:44,644 INFO L85 PathProgramCache]: Analyzing trace with hash 829036907, now seen corresponding path program 1 times [2022-11-16 12:52:44,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:52:44,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919858011] [2022-11-16 12:52:44,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:44,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:52:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:45,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:52:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:45,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:52:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:45,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:52:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:45,150 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-16 12:52:45,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:52:45,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919858011] [2022-11-16 12:52:45,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919858011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:52:45,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:52:45,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:52:45,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392098780] [2022-11-16 12:52:45,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:52:45,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:52:45,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:52:45,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:52:45,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:52:45,199 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-16 12:52:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:52:45,234 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2022-11-16 12:52:45,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:52:45,237 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-16 12:52:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:52:45,247 INFO L225 Difference]: With dead ends: 94 [2022-11-16 12:52:45,247 INFO L226 Difference]: Without dead ends: 45 [2022-11-16 12:52:45,251 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-16 12:52:45,255 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-16 12:52:45,256 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-16 12:52:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-16 12:52:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-16 12:52:45,301 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-16 12:52:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-11-16 12:52:45,305 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 28 [2022-11-16 12:52:45,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:52:45,307 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-11-16 12:52:45,307 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-16 12:52:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-11-16 12:52:45,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 12:52:45,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:52:45,310 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-16 12:52:45,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:52:45,310 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:52:45,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:52:45,312 INFO L85 PathProgramCache]: Analyzing trace with hash -192031447, now seen corresponding path program 1 times [2022-11-16 12:52:45,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:52:45,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914758784] [2022-11-16 12:52:45,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:45,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:52:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:52:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:46,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:52:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:46,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:52:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:47,213 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-16 12:52:47,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:52:47,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914758784] [2022-11-16 12:52:47,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914758784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:52:47,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:52:47,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:52:47,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911012033] [2022-11-16 12:52:47,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:52:47,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:52:47,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:52:47,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:52:47,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:52:47,218 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 9 states, 8 states have (on average 2.625) 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-16 12:52:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:52:47,665 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-11-16 12:52:47,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:52:47,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) 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-16 12:52:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:52:47,672 INFO L225 Difference]: With dead ends: 56 [2022-11-16 12:52:47,673 INFO L226 Difference]: Without dead ends: 54 [2022-11-16 12:52:47,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:52:47,675 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:52:47,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 262 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:52:47,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-16 12:52:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-11-16 12:52:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-16 12:52:47,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-11-16 12:52:47,711 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 28 [2022-11-16 12:52:47,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:52:47,712 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-11-16 12:52:47,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) 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-16 12:52:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-11-16 12:52:47,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 12:52:47,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:52:47,714 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-16 12:52:47,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:52:47,714 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:52:47,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:52:47,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1001378073, now seen corresponding path program 1 times [2022-11-16 12:52:47,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:52:47,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649874978] [2022-11-16 12:52:47,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:47,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:52:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:48,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:52:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:48,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:52:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:48,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:52:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:52:48,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:52:48,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649874978] [2022-11-16 12:52:48,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649874978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:52:48,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168540271] [2022-11-16 12:52:48,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:48,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:52:48,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:52:48,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:52:48,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:52:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:48,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-16 12:52:48,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:52:48,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 12:52:48,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:52:48,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:52:48,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 12:52:49,362 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-16 12:52:49,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 23 [2022-11-16 12:52:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:52:49,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:52:50,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-16 12:52:50,520 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 12:52:50,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-16 12:52:50,593 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-16 12:52:50,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168540271] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:52:50,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:52:50,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 12] total 31 [2022-11-16 12:52:50,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740322228] [2022-11-16 12:52:50,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:52:50,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-16 12:52:50,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:52:50,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-16 12:52:50,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2022-11-16 12:52:50,599 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 30 states have internal predecessors, (49), 7 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (9), 4 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-16 12:52:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:52:52,158 INFO L93 Difference]: Finished difference Result 189 states and 255 transitions. [2022-11-16 12:52:52,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 12:52:52,159 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 30 states have internal predecessors, (49), 7 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (9), 4 states have call predecessors, (9), 6 states have call successors, (9) Word has length 28 [2022-11-16 12:52:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:52:52,167 INFO L225 Difference]: With dead ends: 189 [2022-11-16 12:52:52,169 INFO L226 Difference]: Without dead ends: 136 [2022-11-16 12:52:52,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=218, Invalid=1504, Unknown=0, NotChecked=0, Total=1722 [2022-11-16 12:52:52,172 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 80 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:52:52,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1246 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 753 Invalid, 0 Unknown, 336 Unchecked, 0.8s Time] [2022-11-16 12:52:52,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-16 12:52:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 89. [2022-11-16 12:52:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.180327868852459) internal successors, (72), 66 states have internal predecessors, (72), 15 states have call successors, (15), 8 states have call predecessors, (15), 12 states have return successors, (22), 14 states have call predecessors, (22), 14 states have call successors, (22) [2022-11-16 12:52:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2022-11-16 12:52:52,210 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 28 [2022-11-16 12:52:52,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:52:52,216 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2022-11-16 12:52:52,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 30 states have internal predecessors, (49), 7 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (9), 4 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-16 12:52:52,216 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2022-11-16 12:52:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 12:52:52,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:52:52,219 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-16 12:52:52,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:52:52,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-16 12:52:52,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:52:52,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:52:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1394405083, now seen corresponding path program 1 times [2022-11-16 12:52:52,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:52:52,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990987362] [2022-11-16 12:52:52,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:52,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:52:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:52,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:52:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:52,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:52:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:52,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:52:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:52,701 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-16 12:52:52,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:52:52,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990987362] [2022-11-16 12:52:52,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990987362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:52:52,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:52:52,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:52:52,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863602549] [2022-11-16 12:52:52,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:52:52,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:52:52,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:52:52,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:52:52,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:52:52,704 INFO L87 Difference]: Start difference. First operand 89 states and 109 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-16 12:52:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:52:52,747 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2022-11-16 12:52:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:52:52,747 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-16 12:52:52,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:52:52,749 INFO L225 Difference]: With dead ends: 139 [2022-11-16 12:52:52,749 INFO L226 Difference]: Without dead ends: 71 [2022-11-16 12:52:52,750 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-16 12:52:52,751 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 12 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:52:52,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 186 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:52:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-16 12:52:52,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2022-11-16 12:52:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 46 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-16 12:52:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-11-16 12:52:52,763 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 28 [2022-11-16 12:52:52,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:52:52,764 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-11-16 12:52:52,764 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-16 12:52:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-11-16 12:52:52,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:52:52,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:52:52,765 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-16 12:52:52,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:52:52,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:52:52,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:52:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash 854159971, now seen corresponding path program 1 times [2022-11-16 12:52:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:52:52,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101892344] [2022-11-16 12:52:52,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:52,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:52:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:54,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:52:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:54,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:52:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:54,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:52:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:54,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:52:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:54,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 12:52:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:54,560 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-16 12:52:54,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:52:54,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101892344] [2022-11-16 12:52:54,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101892344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:52:54,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:52:54,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:52:54,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274171995] [2022-11-16 12:52:54,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:52:54,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:52:54,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:52:54,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:52:54,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:52:54,563 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 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-16 12:52:55,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:52:55,013 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-11-16 12:52:55,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:52:55,014 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 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-16 12:52:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:52:55,016 INFO L225 Difference]: With dead ends: 76 [2022-11-16 12:52:55,016 INFO L226 Difference]: Without dead ends: 74 [2022-11-16 12:52:55,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:52:55,017 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 35 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:52:55,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 311 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:52:55,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-16 12:52:55,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-11-16 12:52:55,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.14) internal successors, (57), 52 states have internal predecessors, (57), 13 states have call successors, (13), 8 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-16 12:52:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2022-11-16 12:52:55,036 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 42 [2022-11-16 12:52:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:52:55,037 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2022-11-16 12:52:55,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 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-16 12:52:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-11-16 12:52:55,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:52:55,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:52:55,039 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-16 12:52:55,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:52:55,039 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:52:55,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:52:55,040 INFO L85 PathProgramCache]: Analyzing trace with hash 44813345, now seen corresponding path program 1 times [2022-11-16 12:52:55,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:52:55,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997348882] [2022-11-16 12:52:55,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:55,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:52:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:55,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:52:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:55,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:52:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:52:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:55,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:52:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:55,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 12:52:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:55,876 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-16 12:52:55,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:52:55,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997348882] [2022-11-16 12:52:55,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997348882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:52:55,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:52:55,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:52:55,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997553041] [2022-11-16 12:52:55,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:52:55,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:52:55,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:52:55,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:52:55,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:52:55,879 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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-16 12:52:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:52:56,160 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2022-11-16 12:52:56,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:52:56,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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-16 12:52:56,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:52:56,162 INFO L225 Difference]: With dead ends: 119 [2022-11-16 12:52:56,162 INFO L226 Difference]: Without dead ends: 79 [2022-11-16 12:52:56,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:52:56,163 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 31 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:52:56,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 189 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:52:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-16 12:52:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-11-16 12:52:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 57 states have internal predecessors, (62), 13 states have call successors, (13), 8 states have call predecessors, (13), 10 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2022-11-16 12:52:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2022-11-16 12:52:56,188 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 42 [2022-11-16 12:52:56,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:52:56,188 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2022-11-16 12:52:56,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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-16 12:52:56,189 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-11-16 12:52:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:52:56,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:52:56,192 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-16 12:52:56,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:52:56,193 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:52:56,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:52:56,193 INFO L85 PathProgramCache]: Analyzing trace with hash -348213665, now seen corresponding path program 1 times [2022-11-16 12:52:56,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:52:56,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273835817] [2022-11-16 12:52:56,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:56,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:52:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:56,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:52:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:56,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:52:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:56,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:52:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:56,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:52:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:56,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 12:52:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:56,721 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-16 12:52:56,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:52:56,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273835817] [2022-11-16 12:52:56,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273835817] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:52:56,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488883465] [2022-11-16 12:52:56,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:56,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:52:56,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:52:56,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:52:56,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:52:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:56,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 12:52:56,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:52:56,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 12:52:56,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:52:56,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:52:56,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 12:52:57,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-11-16 12:52:57,560 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-16 12:52:57,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:52:57,746 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:52:57,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-11-16 12:52:57,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:52:57,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-16 12:52:57,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 12:52:57,786 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-16 12:52:57,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488883465] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 12:52:57,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:52:57,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 19 [2022-11-16 12:52:57,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148963985] [2022-11-16 12:52:57,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:52:57,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:52:57,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:52:57,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:52:57,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:52:57,789 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-16 12:52:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:52:58,010 INFO L93 Difference]: Finished difference Result 130 states and 152 transitions. [2022-11-16 12:52:58,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:52:58,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-16 12:52:58,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:52:58,012 INFO L225 Difference]: With dead ends: 130 [2022-11-16 12:52:58,013 INFO L226 Difference]: Without dead ends: 80 [2022-11-16 12:52:58,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-11-16 12:52:58,016 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 62 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:52:58,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 134 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:52:58,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-16 12:52:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-11-16 12:52:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 54 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 12:52:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-11-16 12:52:58,047 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 42 [2022-11-16 12:52:58,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:52:58,049 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-11-16 12:52:58,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-16 12:52:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-11-16 12:52:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 12:52:58,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:52:58,055 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-16 12:52:58,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:52:58,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 12:52:58,262 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:52:58,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:52:58,262 INFO L85 PathProgramCache]: Analyzing trace with hash -541770688, now seen corresponding path program 1 times [2022-11-16 12:52:58,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:52:58,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78444788] [2022-11-16 12:52:58,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:58,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:52:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:58,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:52:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:58,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:52:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:58,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:52:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:58,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:52:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:58,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 12:52:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:58,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 12:52:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:58,546 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-16 12:52:58,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:52:58,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78444788] [2022-11-16 12:52:58,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78444788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:52:58,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:52:58,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:52:58,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780030736] [2022-11-16 12:52:58,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:52:58,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:52:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:52:58,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:52:58,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:52:58,549 INFO L87 Difference]: Start difference. First operand 74 states and 85 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-16 12:52:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:52:58,677 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2022-11-16 12:52:58,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:52:58,677 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-16 12:52:58,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:52:58,679 INFO L225 Difference]: With dead ends: 80 [2022-11-16 12:52:58,679 INFO L226 Difference]: Without dead ends: 78 [2022-11-16 12:52:58,679 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-16 12:52:58,680 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 10 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:52:58,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 210 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:52:58,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-16 12:52:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-16 12:52:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 12:52:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2022-11-16 12:52:58,694 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 48 [2022-11-16 12:52:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:52:58,695 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2022-11-16 12:52:58,695 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-16 12:52:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2022-11-16 12:52:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 12:52:58,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:52:58,699 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-16 12:52:58,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:52:58,700 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:52:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:52:58,700 INFO L85 PathProgramCache]: Analyzing trace with hash -266250434, now seen corresponding path program 1 times [2022-11-16 12:52:58,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:52:58,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505105196] [2022-11-16 12:52:58,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:52:58,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:52:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:52:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:59,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:52:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:59,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:52:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:59,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:52:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:59,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 12:52:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:59,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 12:52:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:59,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 12:52:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:52:59,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:52:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:00,160 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-16 12:53:00,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:00,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505105196] [2022-11-16 12:53:00,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505105196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:00,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:00,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:53:00,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801019484] [2022-11-16 12:53:00,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:00,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:53:00,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:00,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:53:00,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:53:00,163 INFO L87 Difference]: Start difference. First operand 78 states and 88 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-16 12:53:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:00,474 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-11-16 12:53:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:53:00,475 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-16 12:53:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:00,476 INFO L225 Difference]: With dead ends: 89 [2022-11-16 12:53:00,476 INFO L226 Difference]: Without dead ends: 87 [2022-11-16 12:53:00,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 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-16 12:53:00,477 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 23 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:00,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 277 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:53:00,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-16 12:53:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-11-16 12:53:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 13 states have call successors, (13), 10 states have call predecessors, (13), 12 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-16 12:53:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-11-16 12:53:00,521 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 63 [2022-11-16 12:53:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:00,524 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-11-16 12:53:00,524 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-16 12:53:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-11-16 12:53:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 12:53:00,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:00,526 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-16 12:53:00,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:53:00,527 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:53:00,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:00,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1075597060, now seen corresponding path program 1 times [2022-11-16 12:53:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:00,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234159764] [2022-11-16 12:53:00,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:00,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:53:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:01,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:53:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:01,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:53:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:01,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:53:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:01,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 12:53:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:01,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 12:53:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:01,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 12:53:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:01,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:53:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 12:53:01,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:01,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234159764] [2022-11-16 12:53:01,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234159764] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:53:01,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18777825] [2022-11-16 12:53:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:01,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:53:01,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:53:01,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:53:01,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:53:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:01,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 12:53:01,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:53:01,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 12:53:01,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 12:53:01,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:53:01,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:53:01,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:53:01,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 12:53:01,948 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:53:01,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:53:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 12:53:02,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:53:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 12:53:03,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18777825] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:53:03,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:53:03,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 12] total 32 [2022-11-16 12:53:03,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388226413] [2022-11-16 12:53:03,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:53:03,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-16 12:53:03,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:03,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-16 12:53:03,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2022-11-16 12:53:03,548 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 32 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 31 states have internal predecessors, (91), 7 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2022-11-16 12:53:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:04,119 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2022-11-16 12:53:04,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:53:04,119 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 31 states have internal predecessors, (91), 7 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 63 [2022-11-16 12:53:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:04,120 INFO L225 Difference]: With dead ends: 128 [2022-11-16 12:53:04,121 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 12:53:04,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 110 SyntacticMatches, 13 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=186, Invalid=1296, Unknown=0, NotChecked=0, Total=1482 [2022-11-16 12:53:04,122 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 46 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:04,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 555 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2022-11-16 12:53:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 12:53:04,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2022-11-16 12:53:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 62 states have internal predecessors, (65), 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-16 12:53:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-11-16 12:53:04,147 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 63 [2022-11-16 12:53:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:04,147 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-11-16 12:53:04,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 31 states have internal predecessors, (91), 7 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2022-11-16 12:53:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-11-16 12:53:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 12:53:04,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:04,148 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-16 12:53:04,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:53:04,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:53:04,349 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:53:04,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1468624070, now seen corresponding path program 1 times [2022-11-16 12:53:04,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:04,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395383057] [2022-11-16 12:53:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:04,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:04,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:53:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:04,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:53:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:04,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:53:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:04,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:53:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:04,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 12:53:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:04,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 12:53:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:04,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 12:53:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:04,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:53:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:04,596 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-16 12:53:04,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:04,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395383057] [2022-11-16 12:53:04,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395383057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:04,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:04,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:53:04,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837310510] [2022-11-16 12:53:04,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:04,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:53:04,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:04,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:53:04,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:53:04,599 INFO L87 Difference]: Start difference. First operand 86 states and 92 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-16 12:53:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:04,624 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-11-16 12:53:04,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:53:04,625 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-16 12:53:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:04,626 INFO L225 Difference]: With dead ends: 109 [2022-11-16 12:53:04,626 INFO L226 Difference]: Without dead ends: 77 [2022-11-16 12:53:04,627 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-16 12:53:04,627 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-16 12:53:04,628 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-16 12:53:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-16 12:53:04,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-11-16 12:53:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 53 states have internal predecessors, (55), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 12:53:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-11-16 12:53:04,641 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 63 [2022-11-16 12:53:04,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:04,641 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-11-16 12:53:04,642 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-16 12:53:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-11-16 12:53:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 12:53:04,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:04,643 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-16 12:53:04,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:53:04,643 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:53:04,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:04,644 INFO L85 PathProgramCache]: Analyzing trace with hash 763050350, now seen corresponding path program 1 times [2022-11-16 12:53:04,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:04,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065944529] [2022-11-16 12:53:04,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:04,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:06,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:53:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:06,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:53:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:06,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:53:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:06,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:53:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:06,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 12:53:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:06,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 12:53:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:06,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 12:53:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:06,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:53:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:06,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:53:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:06,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:53:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:06,403 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-16 12:53:06,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:06,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065944529] [2022-11-16 12:53:06,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065944529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:06,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:06,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 12:53:06,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442809314] [2022-11-16 12:53:06,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:06,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:53:06,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:06,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:53:06,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:53:06,406 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 12:53:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:07,072 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-11-16 12:53:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:53:07,073 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 77 [2022-11-16 12:53:07,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:07,074 INFO L225 Difference]: With dead ends: 86 [2022-11-16 12:53:07,074 INFO L226 Difference]: Without dead ends: 84 [2022-11-16 12:53:07,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:53:07,075 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 33 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:07,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 330 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:53:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-16 12:53:07,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-11-16 12:53:07,085 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, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-11-16 12:53:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-11-16 12:53:07,086 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 77 [2022-11-16 12:53:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:07,086 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-11-16 12:53:07,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 12:53:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-11-16 12:53:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 12:53:07,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:07,088 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-16 12:53:07,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:53:07,088 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:53:07,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:07,089 INFO L85 PathProgramCache]: Analyzing trace with hash -46296276, now seen corresponding path program 1 times [2022-11-16 12:53:07,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:07,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522669404] [2022-11-16 12:53:07,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:07,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:07,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:53:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:08,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:53:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:08,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:53:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:53:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:08,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 12:53:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:08,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 12:53:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:08,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 12:53:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:08,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:53:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:08,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:53:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:08,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:53:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:08,281 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-16 12:53:08,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:08,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522669404] [2022-11-16 12:53:08,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522669404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:08,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:08,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:53:08,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111790666] [2022-11-16 12:53:08,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:08,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:53:08,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:08,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:53:08,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:53:08,284 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 12:53:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:08,676 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-11-16 12:53:08,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:53:08,677 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 77 [2022-11-16 12:53:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:08,680 INFO L225 Difference]: With dead ends: 98 [2022-11-16 12:53:08,680 INFO L226 Difference]: Without dead ends: 86 [2022-11-16 12:53:08,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:53:08,682 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 40 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:08,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 205 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:53:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-16 12:53:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-11-16 12:53:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 61 states have internal predecessors, (62), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-11-16 12:53:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-11-16 12:53:08,697 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 77 [2022-11-16 12:53:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:08,698 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-11-16 12:53:08,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 12:53:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-11-16 12:53:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 12:53:08,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:08,699 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-16 12:53:08,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:53:08,700 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:53:08,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash -439323286, now seen corresponding path program 1 times [2022-11-16 12:53:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:08,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877691276] [2022-11-16 12:53:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:08,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:53:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:53:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:53:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:53:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 12:53:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 12:53:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 12:53:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:53:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:53:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:53:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-16 12:53:09,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:09,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877691276] [2022-11-16 12:53:09,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877691276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:53:09,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956432706] [2022-11-16 12:53:09,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:09,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:53:09,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:53:09,359 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:53:09,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:53:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-16 12:53:09,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:53:09,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:53:09,714 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-16 12:53:09,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:53:09,976 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-16 12:53:09,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956432706] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:53:09,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:53:09,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 15 [2022-11-16 12:53:09,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899604415] [2022-11-16 12:53:09,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:53:09,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:53:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:09,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:53:09,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:53:09,978 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 12:53:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:10,469 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2022-11-16 12:53:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:53:10,469 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 77 [2022-11-16 12:53:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:10,470 INFO L225 Difference]: With dead ends: 105 [2022-11-16 12:53:10,470 INFO L226 Difference]: Without dead ends: 81 [2022-11-16 12:53:10,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:53:10,471 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 41 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:10,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 319 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:53:10,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-16 12:53:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2022-11-16 12:53:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.0) internal successors, (54), 54 states have internal predecessors, (54), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-16 12:53:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-11-16 12:53:10,492 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 77 [2022-11-16 12:53:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:10,493 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-11-16 12:53:10,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 12:53:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-11-16 12:53:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-16 12:53:10,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:10,494 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-16 12:53:10,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:53:10,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:53:10,701 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:53:10,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:10,701 INFO L85 PathProgramCache]: Analyzing trace with hash 958151681, now seen corresponding path program 1 times [2022-11-16 12:53:10,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:10,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115458358] [2022-11-16 12:53:10,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:10,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:11,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:53:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:11,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:53:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:11,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:53:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:11,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:53:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:11,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 12:53:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:11,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 12:53:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:11,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 12:53:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:11,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:53:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:11,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:53:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:11,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:53:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:11,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:53:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:11,754 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-16 12:53:11,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:11,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115458358] [2022-11-16 12:53:11,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115458358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:11,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:11,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:53:11,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267143208] [2022-11-16 12:53:11,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:11,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:53:11,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:11,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:53:11,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:53:11,757 INFO L87 Difference]: Start difference. First operand 77 states and 77 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-16 12:53:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:12,023 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-11-16 12:53:12,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:53:12,023 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-16 12:53:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:12,024 INFO L225 Difference]: With dead ends: 77 [2022-11-16 12:53:12,024 INFO L226 Difference]: Without dead ends: 0 [2022-11-16 12:53:12,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:53:12,025 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 23 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:12,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 219 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:53:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-16 12:53:12,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-16 12:53:12,026 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-16 12:53:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-16 12:53:12,027 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2022-11-16 12:53:12,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:12,027 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-16 12:53:12,027 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-16 12:53:12,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-16 12:53:12,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-16 12:53:12,030 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 12:53:12,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:53:12,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-16 12:53:13,822 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validFINAL(lines 4717 4721) no Hoare annotation was computed. [2022-11-16 12:53:13,822 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2022-11-16 12:53:13,822 INFO L899 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2022-11-16 12:53:13,822 INFO L899 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2022-11-16 12:53:13,822 INFO L899 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2022-11-16 12:53:13,822 INFO L899 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2022-11-16 12:53:13,823 INFO L902 garLoopResultBuilder]: At program point aws_linked_list_node_next_is_validENTRY(lines 4717 4721) the Hoare annotation is: true [2022-11-16 12:53:13,823 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validFINAL(lines 4728 4732) no Hoare annotation was computed. [2022-11-16 12:53:13,823 INFO L899 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2022-11-16 12:53:13,823 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2022-11-16 12:53:13,823 INFO L899 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2022-11-16 12:53:13,823 INFO L899 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2022-11-16 12:53:13,824 INFO L899 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2022-11-16 12:53:13,824 INFO L902 garLoopResultBuilder]: At program point aws_linked_list_node_prev_is_validENTRY(lines 4728 4732) the Hoare annotation is: true [2022-11-16 12:53:13,824 INFO L899 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2022-11-16 12:53:13,824 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-16 12:53:13,824 INFO L895 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-11-16 12:53:13,825 INFO L902 garLoopResultBuilder]: At program point L7393(line 7393) the Hoare annotation is: true [2022-11-16 12:53:13,825 INFO L899 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2022-11-16 12:53:13,825 INFO L895 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_next_harness_#t~ret671#1|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) 0) (<= |ULTIMATE.start_aws_linked_list_next_harness_#t~ret671#1| 1) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-11-16 12:53:13,826 INFO L895 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-11-16 12:53:13,826 INFO L895 garLoopResultBuilder]: At program point L4842(lines 4836 4843) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-11-16 12:53:13,826 INFO L895 garLoopResultBuilder]: At program point L4840-1(line 4840) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= |ULTIMATE.start_aws_linked_list_next_#t~ret330#1| 1) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_next_#t~ret330#1|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2022-11-16 12:53:13,827 INFO L899 garLoopResultBuilder]: For program point L4840-2(line 4840) no Hoare annotation was computed. [2022-11-16 12:53:13,827 INFO L895 garLoopResultBuilder]: At program point L4840(line 4840) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2022-11-16 12:53:13,827 INFO L895 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-11-16 12:53:13,827 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-16 12:53:13,828 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-16 12:53:13,828 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-16 12:53:13,828 INFO L899 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2022-11-16 12:53:13,828 INFO L895 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (<= 1 |ULTIMATE.start_aws_linked_list_next_harness_#t~ret672#1|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (<= |ULTIMATE.start_aws_linked_list_next_harness_#t~ret672#1| 1) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) 0) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2022-11-16 12:53:13,828 INFO L899 garLoopResultBuilder]: For program point L7376(lines 7376 7392) no Hoare annotation was computed. [2022-11-16 12:53:13,829 INFO L895 garLoopResultBuilder]: At program point L4839(line 4839) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2022-11-16 12:53:13,829 INFO L895 garLoopResultBuilder]: At program point L4839-1(line 4839) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= |ULTIMATE.start_aws_linked_list_next_#t~ret329#1| 1) (<= 1 |ULTIMATE.start_aws_linked_list_next_#t~ret329#1|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2022-11-16 12:53:13,829 INFO L895 garLoopResultBuilder]: At program point L4841(line 4841) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_#t~mem331#1.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| |ULTIMATE.start_aws_linked_list_next_#t~mem331#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (< 0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2022-11-16 12:53:13,830 INFO L899 garLoopResultBuilder]: For program point L4841-1(line 4841) no Hoare annotation was computed. [2022-11-16 12:53:13,830 INFO L899 garLoopResultBuilder]: For program point L4837-2(line 4837) no Hoare annotation was computed. [2022-11-16 12:53:13,830 INFO L895 garLoopResultBuilder]: At program point L4837(line 4837) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (< 0 .cse0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) [2022-11-16 12:53:13,830 INFO L899 garLoopResultBuilder]: For program point L4839-2(line 4839) no Hoare annotation was computed. [2022-11-16 12:53:13,830 INFO L895 garLoopResultBuilder]: At program point L4837-1(line 4837) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (< 0 .cse0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (< 0 (+ |#StackHeapBarrier| 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) [2022-11-16 12:53:13,831 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-16 12:53:13,831 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-16 12:53:13,831 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-16 12:53:13,831 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-16 12:53:13,831 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-16 12:53:13,832 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-16 12:53:13,832 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-16 12:53:13,832 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-16 12:53:13,832 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-16 12:53:13,832 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-16 12:53:13,836 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:13,838 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:53:13,850 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,851 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:53:13,852 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:53:13,852 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,852 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:53:13,853 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,853 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,856 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,856 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:53:13,857 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:53:13,857 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,857 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:53:13,858 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,858 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:53:13 BoogieIcfgContainer [2022-11-16 12:53:13,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:53:13,860 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:53:13,861 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:53:13,861 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:53:13,862 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:52:44" (3/4) ... [2022-11-16 12:53:13,865 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 12:53:13,871 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2022-11-16 12:53:13,871 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2022-11-16 12:53:13,872 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-16 12:53:13,872 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-16 12:53:13,876 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-16 12:53:13,876 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-16 12:53:13,876 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-16 12:53:13,877 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 12:53:13,901 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((node == node && node == 0) && #memory_$Pointer$[node][node] == rval) && #memory_$Pointer$[rval][8] == node) && #memory_$Pointer$[rval][8] == 0) && \result == 0) && after == rval) && #memory_$Pointer$[node][node] == after) && !(node == after)) && after == \result) && 0 == #memory_$Pointer$[node][node]) && 0 < rval) && \result == after) && 0 < unknown-#StackHeapBarrier-unknown + 1) && #memory_$Pointer$[rval][8] == node) && !(#memory_$Pointer$[\result][8] == 0) [2022-11-16 12:53:13,914 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:53:13,914 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:53:13,915 INFO L158 Benchmark]: Toolchain (without parser) took 32974.14ms. Allocated memory was 119.5MB in the beginning and 497.0MB in the end (delta: 377.5MB). Free memory was 71.5MB in the beginning and 348.5MB in the end (delta: -277.0MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2022-11-16 12:53:13,915 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 119.5MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:53:13,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2593.24ms. Allocated memory was 119.5MB in the beginning and 155.2MB in the end (delta: 35.7MB). Free memory was 71.4MB in the beginning and 113.3MB in the end (delta: -41.9MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2022-11-16 12:53:13,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 135.70ms. Allocated memory is still 155.2MB. Free memory was 113.3MB in the beginning and 108.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:53:13,916 INFO L158 Benchmark]: Boogie Preprocessor took 37.56ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 106.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:53:13,917 INFO L158 Benchmark]: RCFGBuilder took 751.22ms. Allocated memory is still 155.2MB. Free memory was 106.2MB in the beginning and 86.2MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-16 12:53:13,917 INFO L158 Benchmark]: TraceAbstraction took 29395.12ms. Allocated memory was 155.2MB in the beginning and 497.0MB in the end (delta: 341.8MB). Free memory was 86.2MB in the beginning and 351.7MB in the end (delta: -265.5MB). Peak memory consumption was 271.8MB. Max. memory is 16.1GB. [2022-11-16 12:53:13,917 INFO L158 Benchmark]: Witness Printer took 54.08ms. Allocated memory is still 497.0MB. Free memory was 351.7MB in the beginning and 348.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:53:13,919 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.27ms. Allocated memory is still 119.5MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2593.24ms. Allocated memory was 119.5MB in the beginning and 155.2MB in the end (delta: 35.7MB). Free memory was 71.4MB in the beginning and 113.3MB in the end (delta: -41.9MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 135.70ms. Allocated memory is still 155.2MB. Free memory was 113.3MB in the beginning and 108.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.56ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 106.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 751.22ms. Allocated memory is still 155.2MB. Free memory was 106.2MB in the beginning and 86.2MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 29395.12ms. Allocated memory was 155.2MB in the beginning and 497.0MB in the end (delta: 341.8MB). Free memory was 86.2MB in the beginning and 351.7MB in the end (delta: -265.5MB). Peak memory consumption was 271.8MB. Max. memory is 16.1GB. * Witness Printer took 54.08ms. Allocated memory is still 497.0MB. Free memory was 351.7MB in the beginning and 348.5MB 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$.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$.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$.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$.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 * 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: 29.3s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 554 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 4647 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 436 IncrementalHoareTripleChecker+Unchecked, 3845 mSDsCounter, 225 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2710 IncrementalHoareTripleChecker+Invalid, 3371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 225 mSolverCounterUnsat, 802 mSDtfsCounter, 2710 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 805 GetRequests, 561 SyntacticMatches, 19 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=3, InterpolantAutomatonStates: 143, 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, 78 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 89 PreInvPairs, 102 NumberOfFragments, 1120 HoareAnnotationTreeSize, 89 FomulaSimplifications, 489 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 3165 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 999 NumberOfCodeBlocks, 999 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1186 ConstructedInterpolants, 73 QuantifiedInterpolants, 7597 SizeOfPredicates, 69 NumberOfNonLiveVariables, 1112 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 23 InterpolantComputations, 12 PerfectInterpolantSequences, 584/675 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: 4836]: Loop Invariant [2022-11-16 12:53:13,928 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,928 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:53:13,928 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:53:13,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:53:13,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:53:13,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:53:13,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:53:13,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:53:13,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((node == node && node == 0) && #memory_$Pointer$[node][node] == rval) && #memory_$Pointer$[rval][8] == node) && #memory_$Pointer$[rval][8] == 0) && \result == 0) && after == rval) && #memory_$Pointer$[node][node] == after) && !(node == after)) && after == \result) && 0 == #memory_$Pointer$[node][node]) && 0 < rval) && \result == after) && 0 < unknown-#StackHeapBarrier-unknown + 1) && #memory_$Pointer$[rval][8] == node) && !(#memory_$Pointer$[\result][8] == 0) RESULT: Ultimate proved your program to be correct! [2022-11-16 12:53:13,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6188a641-f659-4d19-8baf-58c4a192f12d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE