./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro --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 f57bc64edf303a057c8eafb48480d4e5b764bd411481261d53eb2a101eb82ae8 --- 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-8393723 [2022-11-18 20:01:36,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:01:36,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:01:36,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:01:36,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:01:36,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:01:36,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:01:36,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:01:36,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:01:36,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:01:36,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:01:36,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:01:36,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:01:36,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:01:36,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:01:36,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:01:36,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:01:36,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:01:36,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:01:36,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:01:36,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:01:36,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:01:36,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:01:36,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:01:36,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:01:36,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:01:36,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:01:36,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:01:36,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:01:36,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:01:36,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:01:36,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:01:36,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:01:36,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:01:36,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:01:36,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:01:36,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:01:36,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:01:36,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:01:36,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:01:36,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:01:36,581 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 20:01:36,637 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:01:36,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:01:36,639 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:01:36,639 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:01:36,640 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:01:36,641 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:01:36,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:01:36,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:01:36,642 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:01:36,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:01:36,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:01:36,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:01:36,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:01:36,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:01:36,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:01:36,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:01:36,646 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:01:36,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:01:36,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:01:36,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:01:36,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:01:36,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:01:36,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:01:36,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:01:36,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:01:36,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:01:36,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:01:36,651 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:01:36,651 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:01:36,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:01:36,652 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_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/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_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro 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 -> f57bc64edf303a057c8eafb48480d4e5b764bd411481261d53eb2a101eb82ae8 [2022-11-18 20:01:37,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:01:37,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:01:37,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:01:37,104 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:01:37,105 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:01:37,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2022-11-18 20:01:37,209 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/data/83a4d4d88/daaa1796fd5c432abde3c202bb28d559/FLAGcdfa304c9 [2022-11-18 20:01:38,094 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:01:38,095 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2022-11-18 20:01:38,159 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/data/83a4d4d88/daaa1796fd5c432abde3c202bb28d559/FLAGcdfa304c9 [2022-11-18 20:01:38,667 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/data/83a4d4d88/daaa1796fd5c432abde3c202bb28d559 [2022-11-18 20:01:38,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:01:38,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:01:38,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:01:38,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:01:38,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:01:38,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:01:38" (1/1) ... [2022-11-18 20:01:38,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e29b1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:38, skipping insertion in model container [2022-11-18 20:01:38,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:01:38" (1/1) ... [2022-11-18 20:01:38,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:01:38,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:01:39,212 WARN L234 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_11f920ca-d8ae-45a5-9bac-d189bcf3299c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4494,4507] [2022-11-18 20:01:39,222 WARN L234 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_11f920ca-d8ae-45a5-9bac-d189bcf3299c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4554,4567] [2022-11-18 20:01:40,210 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:40,217 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:40,218 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:40,219 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:40,221 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:40,238 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:40,246 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:40,249 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:40,250 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:40,253 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:40,259 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:40,260 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:40,261 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:40,822 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:01:40,824 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:01:40,828 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:01:40,830 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:01:40,833 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:01:40,835 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:01:40,836 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:01:40,837 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:01:40,838 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:01:40,840 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:01:41,036 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:01:41,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:01:41,095 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:01:41,112 WARN L234 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_11f920ca-d8ae-45a5-9bac-d189bcf3299c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4494,4507] [2022-11-18 20:01:41,113 WARN L234 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_11f920ca-d8ae-45a5-9bac-d189bcf3299c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4554,4567] [2022-11-18 20:01:41,157 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:41,158 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:41,159 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:41,159 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:41,160 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:41,169 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:41,170 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:41,171 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:41,172 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:41,173 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:41,174 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:41,175 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:41,175 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:01:41,220 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:01:41,221 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:01:41,222 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:01:41,224 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:01:41,225 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:01:41,226 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:01:41,226 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:01:41,227 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:01:41,228 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:01:41,228 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:01:41,259 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:01:41,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:01:41,524 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:01:41,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:41 WrapperNode [2022-11-18 20:01:41,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:01:41,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:01:41,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:01:41,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:01:41,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:41" (1/1) ... [2022-11-18 20:01:41,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:41" (1/1) ... [2022-11-18 20:01:41,734 INFO L138 Inliner]: procedures = 679, calls = 1044, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 133 [2022-11-18 20:01:41,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:01:41,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:01:41,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:01:41,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:01:41,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:41" (1/1) ... [2022-11-18 20:01:41,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:41" (1/1) ... [2022-11-18 20:01:41,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:41" (1/1) ... [2022-11-18 20:01:41,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:41" (1/1) ... [2022-11-18 20:01:41,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:41" (1/1) ... [2022-11-18 20:01:41,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:41" (1/1) ... [2022-11-18 20:01:41,827 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:41" (1/1) ... [2022-11-18 20:01:41,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:41" (1/1) ... [2022-11-18 20:01:41,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:01:41,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:01:41,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:01:41,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:01:41,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:41" (1/1) ... [2022-11-18 20:01:41,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:01:41,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:41,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:01:41,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:01:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2022-11-18 20:01:41,966 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2022-11-18 20:01:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:01:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-18 20:01:41,967 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-18 20:01:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-18 20:01:41,968 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-18 20:01:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:01:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-18 20:01:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-18 20:01:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:01:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:01:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:01:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:01:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-11-18 20:01:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-11-18 20:01:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:01:41,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:01:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:01:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:01:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:01:41,975 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-18 20:01:41,975 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-18 20:01:41,976 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-18 20:01:41,976 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-18 20:01:41,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:01:42,357 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:01:42,361 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:01:42,785 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:01:42,806 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:01:42,806 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:01:42,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:01:42 BoogieIcfgContainer [2022-11-18 20:01:42,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:01:42,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:01:42,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:01:42,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:01:42,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:01:38" (1/3) ... [2022-11-18 20:01:42,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3291791c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:01:42, skipping insertion in model container [2022-11-18 20:01:42,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:41" (2/3) ... [2022-11-18 20:01:42,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3291791c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:01:42, skipping insertion in model container [2022-11-18 20:01:42,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:01:42" (3/3) ... [2022-11-18 20:01:42,828 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness.i [2022-11-18 20:01:42,852 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:01:42,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:01:42,939 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:01:42,947 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;@1372cb11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:01:42,947 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:01:42,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-18 20:01:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-18 20:01:42,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:42,980 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:01:42,983 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:42,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:42,990 INFO L85 PathProgramCache]: Analyzing trace with hash 464723229, now seen corresponding path program 1 times [2022-11-18 20:01:43,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:43,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739657554] [2022-11-18 20:01:43,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:43,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:43,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:43,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:01:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:43,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:01:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:43,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:43,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:01:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:43,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:01:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:43,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:01:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:43,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:01:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:43,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:43,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:01:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:43,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:01:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-18 20:01:43,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:43,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739657554] [2022-11-18 20:01:43,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739657554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:43,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:43,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:01:43,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809311556] [2022-11-18 20:01:43,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:43,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:01:43,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:43,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:01:43,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:01:43,936 INFO L87 Difference]: Start difference. First operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-18 20:01:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:44,031 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2022-11-18 20:01:44,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:01:44,034 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2022-11-18 20:01:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:44,050 INFO L225 Difference]: With dead ends: 188 [2022-11-18 20:01:44,050 INFO L226 Difference]: Without dead ends: 93 [2022-11-18 20:01:44,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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-18 20:01:44,066 INFO L413 NwaCegarLoop]: 127 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, 127 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-18 20:01:44,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:01:44,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-18 20:01:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-18 20:01:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-18 20:01:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-11-18 20:01:44,159 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 84 [2022-11-18 20:01:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:44,160 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-11-18 20:01:44,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-18 20:01:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-11-18 20:01:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-18 20:01:44,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:44,169 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:01:44,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:01:44,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:44,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:44,179 INFO L85 PathProgramCache]: Analyzing trace with hash 463621205, now seen corresponding path program 1 times [2022-11-18 20:01:44,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:44,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780895606] [2022-11-18 20:01:44,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:44,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:44,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:44,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:01:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:01:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:44,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:44,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:01:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:44,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:01:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:44,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:01:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:45,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:01:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:45,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:45,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:01:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:45,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:01:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-18 20:01:45,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:45,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780895606] [2022-11-18 20:01:45,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780895606] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:45,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925319984] [2022-11-18 20:01:45,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:45,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:45,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:45,194 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:45,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:01:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:45,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-18 20:01:45,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:45,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-18 20:01:45,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-18 20:01:45,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:45,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:45,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-18 20:01:45,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:45,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:01:45,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-18 20:01:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-18 20:01:47,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:01:47,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925319984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:47,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:01:47,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2022-11-18 20:01:47,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085306393] [2022-11-18 20:01:47,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:47,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:01:47,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:47,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:01:47,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:01:47,615 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-18 20:01:47,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:47,833 INFO L93 Difference]: Finished difference Result 201 states and 273 transitions. [2022-11-18 20:01:47,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:01:47,833 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 84 [2022-11-18 20:01:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:47,848 INFO L225 Difference]: With dead ends: 201 [2022-11-18 20:01:47,848 INFO L226 Difference]: Without dead ends: 142 [2022-11-18 20:01:47,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 12 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:01:47,851 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 37 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:47,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 539 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 76 Unchecked, 0.1s Time] [2022-11-18 20:01:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-18 20:01:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 131. [2022-11-18 20:01:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 88 states have internal predecessors, (107), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (35), 30 states have call predecessors, (35), 32 states have call successors, (35) [2022-11-18 20:01:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 175 transitions. [2022-11-18 20:01:47,879 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 175 transitions. Word has length 84 [2022-11-18 20:01:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:47,880 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 175 transitions. [2022-11-18 20:01:47,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-18 20:01:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 175 transitions. [2022-11-18 20:01:47,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-18 20:01:47,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:47,884 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:01:47,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 20:01:48,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:48,094 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:48,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash -345725421, now seen corresponding path program 1 times [2022-11-18 20:01:48,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:48,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087447635] [2022-11-18 20:01:48,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:48,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:01:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:01:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:01:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:01:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:01:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:01:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:01:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:01:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-18 20:01:48,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:48,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087447635] [2022-11-18 20:01:48,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087447635] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:48,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694829336] [2022-11-18 20:01:48,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:48,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:48,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:48,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:48,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:01:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:48,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:01:48,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:48,977 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:01:48,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-18 20:01:48,997 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:01:48,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-18 20:01:51,277 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 24)) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 24)) 0)))) is different from true [2022-11-18 20:01:53,338 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 24)) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 24)) 0)))) (let ((.cse0 (+ c_aws_linked_list_back_~list.offset 24))) (or (not (= (select (select |c_#memory_$Pointer$.base| c_aws_linked_list_back_~list.base) .cse0) 0)) (not (= (select (select |c_#memory_$Pointer$.offset| c_aws_linked_list_back_~list.base) .cse0) 0))))) is different from true [2022-11-18 20:01:55,385 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 24)) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_6 24)) 0)))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_7 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_7 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_7 24)) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_7 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_7 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_7 24)) 0))))) is different from true [2022-11-18 20:01:57,675 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_8 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_8 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_8 24)) 0))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_8 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_8 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_8 24)) 0)))) is different from true [2022-11-18 20:01:59,796 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_9 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_9 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_9) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_9 24)) 0))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_9 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_9 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_9) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_9 24)) 0)))) is different from true [2022-11-18 20:02:07,879 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:02:16,068 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:02:24,237 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:02:30,344 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:02:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 12 not checked. [2022-11-18 20:02:30,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:02:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-18 20:02:33,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694829336] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:02:33,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:02:33,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17, 11] total 28 [2022-11-18 20:02:33,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141866267] [2022-11-18 20:02:33,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:02:33,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 20:02:33,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:33,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:02:33,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=439, Unknown=9, NotChecked=230, Total=756 [2022-11-18 20:02:33,359 INFO L87 Difference]: Start difference. First operand 131 states and 175 transitions. Second operand has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 26 states have internal predecessors, (96), 7 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-18 20:03:14,440 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:03:22,506 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:03:31,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:31,085 INFO L93 Difference]: Finished difference Result 270 states and 364 transitions. [2022-11-18 20:03:31,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-18 20:03:31,087 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 26 states have internal predecessors, (96), 7 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 84 [2022-11-18 20:03:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:31,090 INFO L225 Difference]: With dead ends: 270 [2022-11-18 20:03:31,091 INFO L226 Difference]: Without dead ends: 153 [2022-11-18 20:03:31,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 167 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 99.9s TimeCoverageRelationStatistics Valid=226, Invalid=1174, Unknown=26, NotChecked=380, Total=1806 [2022-11-18 20:03:31,094 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 159 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 825 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:31,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1120 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 545 Invalid, 0 Unknown, 825 Unchecked, 0.7s Time] [2022-11-18 20:03:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-18 20:03:31,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2022-11-18 20:03:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 104 states have internal predecessors, (128), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-11-18 20:03:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2022-11-18 20:03:31,148 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 84 [2022-11-18 20:03:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:31,148 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2022-11-18 20:03:31,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 26 states have internal predecessors, (96), 7 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-18 20:03:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2022-11-18 20:03:31,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-18 20:03:31,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:31,151 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:31,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:31,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-18 20:03:31,353 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:31,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash 718708879, now seen corresponding path program 1 times [2022-11-18 20:03:31,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:31,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687443617] [2022-11-18 20:03:31,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:31,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:31,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:31,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:03:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:31,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:03:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:31,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:31,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:03:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:31,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:03:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:31,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:03:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:31,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:03:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:31,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:31,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-18 20:03:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:31,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 20:03:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:31,928 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-18 20:03:31,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:31,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687443617] [2022-11-18 20:03:31,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687443617] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:31,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624826510] [2022-11-18 20:03:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:31,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:31,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:31,931 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:31,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:03:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:32,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:03:32,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-18 20:03:32,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:32,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624826510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:32,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:03:32,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-11-18 20:03:32,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800882929] [2022-11-18 20:03:32,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:32,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:03:32,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:32,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:03:32,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:03:32,390 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-18 20:03:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:32,828 INFO L93 Difference]: Finished difference Result 241 states and 320 transitions. [2022-11-18 20:03:32,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:03:32,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2022-11-18 20:03:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:32,840 INFO L225 Difference]: With dead ends: 241 [2022-11-18 20:03:32,841 INFO L226 Difference]: Without dead ends: 146 [2022-11-18 20:03:32,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:03:32,847 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 147 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:32,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 522 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:03:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-18 20:03:32,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-11-18 20:03:32,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 104 states have internal predecessors, (127), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-11-18 20:03:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2022-11-18 20:03:32,896 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 88 [2022-11-18 20:03:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:32,899 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2022-11-18 20:03:32,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-18 20:03:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2022-11-18 20:03:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-18 20:03:32,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:32,904 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:32,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-18 20:03:33,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:33,107 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash -619251908, now seen corresponding path program 1 times [2022-11-18 20:03:33,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:33,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447877988] [2022-11-18 20:03:33,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:33,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:33,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:33,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:03:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:33,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:03:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:33,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:33,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:03:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:33,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:03:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:33,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:03:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:33,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-18 20:03:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:33,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:33,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:03:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:33,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 20:03:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-18 20:03:33,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:33,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447877988] [2022-11-18 20:03:33,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447877988] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:33,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195591155] [2022-11-18 20:03:33,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:33,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:33,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:33,620 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:33,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:03:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:33,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 20:03:33,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-18 20:03:34,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:34,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195591155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:34,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:03:34,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2022-11-18 20:03:34,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24934468] [2022-11-18 20:03:34,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:34,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:03:34,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:34,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:03:34,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:03:34,060 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-18 20:03:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:34,576 INFO L93 Difference]: Finished difference Result 250 states and 334 transitions. [2022-11-18 20:03:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:03:34,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 90 [2022-11-18 20:03:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:34,579 INFO L225 Difference]: With dead ends: 250 [2022-11-18 20:03:34,579 INFO L226 Difference]: Without dead ends: 154 [2022-11-18 20:03:34,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:03:34,581 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 186 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:34,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 577 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:03:34,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-18 20:03:34,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 147. [2022-11-18 20:03:34,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 105 states have internal predecessors, (128), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-11-18 20:03:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2022-11-18 20:03:34,605 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 90 [2022-11-18 20:03:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:34,606 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2022-11-18 20:03:34,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-18 20:03:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2022-11-18 20:03:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-18 20:03:34,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:34,608 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:34,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-18 20:03:34,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:34,816 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:34,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:34,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1442434984, now seen corresponding path program 1 times [2022-11-18 20:03:34,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:34,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515158373] [2022-11-18 20:03:34,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:34,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:35,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:35,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:03:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:35,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:03:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:35,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:35,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:03:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:35,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:03:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:35,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:03:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:35,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-18 20:03:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:35,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:35,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:03:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:35,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:03:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-18 20:03:35,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:35,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515158373] [2022-11-18 20:03:35,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515158373] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:35,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25699983] [2022-11-18 20:03:35,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:35,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:35,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:35,328 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:35,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:03:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:35,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:03:35,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-18 20:03:35,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:35,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25699983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:35,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:03:35,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-18 20:03:35,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108925690] [2022-11-18 20:03:35,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:35,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:35,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:35,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:35,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:03:35,612 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-18 20:03:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:35,652 INFO L93 Difference]: Finished difference Result 246 states and 330 transitions. [2022-11-18 20:03:35,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:35,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2022-11-18 20:03:35,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:35,657 INFO L225 Difference]: With dead ends: 246 [2022-11-18 20:03:35,657 INFO L226 Difference]: Without dead ends: 153 [2022-11-18 20:03:35,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:03:35,660 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:35,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 236 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:03:35,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-18 20:03:35,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2022-11-18 20:03:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 106 states have internal predecessors, (129), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-11-18 20:03:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2022-11-18 20:03:35,714 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 89 [2022-11-18 20:03:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:35,715 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2022-11-18 20:03:35,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-18 20:03:35,715 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2022-11-18 20:03:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-18 20:03:35,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:35,719 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:35,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:35,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:35,936 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:35,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:35,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1174325196, now seen corresponding path program 1 times [2022-11-18 20:03:35,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:35,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505341091] [2022-11-18 20:03:35,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:35,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:03:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:03:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:03:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:03:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:03:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 20:03:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:03:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:03:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:03:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-18 20:03:36,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:36,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505341091] [2022-11-18 20:03:36,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505341091] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:36,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600421278] [2022-11-18 20:03:36,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:36,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:36,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:36,517 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:36,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:03:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:36,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-18 20:03:36,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:36,846 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:03:36,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-18 20:03:36,867 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:03:36,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-18 20:03:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-18 20:03:38,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:03:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-18 20:03:38,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600421278] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:03:38,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:03:38,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 21 [2022-11-18 20:03:38,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068611102] [2022-11-18 20:03:38,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:03:38,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 20:03:38,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:38,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:03:38,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:03:38,782 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand has 21 states, 20 states have (on average 5.75) internal successors, (115), 20 states have internal predecessors, (115), 7 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-11-18 20:03:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:39,864 INFO L93 Difference]: Finished difference Result 261 states and 341 transitions. [2022-11-18 20:03:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:03:39,866 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.75) internal successors, (115), 20 states have internal predecessors, (115), 7 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 99 [2022-11-18 20:03:39,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:39,870 INFO L225 Difference]: With dead ends: 261 [2022-11-18 20:03:39,870 INFO L226 Difference]: Without dead ends: 167 [2022-11-18 20:03:39,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 200 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2022-11-18 20:03:39,873 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 120 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:39,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1384 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 480 Invalid, 0 Unknown, 67 Unchecked, 0.6s Time] [2022-11-18 20:03:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-18 20:03:39,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2022-11-18 20:03:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 115 states have internal predecessors, (139), 30 states have call successors, (30), 16 states have call predecessors, (30), 16 states have return successors, (33), 27 states have call predecessors, (33), 29 states have call successors, (33) [2022-11-18 20:03:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 202 transitions. [2022-11-18 20:03:39,899 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 202 transitions. Word has length 99 [2022-11-18 20:03:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:39,900 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 202 transitions. [2022-11-18 20:03:39,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.75) internal successors, (115), 20 states have internal predecessors, (115), 7 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-11-18 20:03:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-11-18 20:03:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-18 20:03:39,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:39,902 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:39,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:40,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-18 20:03:40,110 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:40,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:40,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2061009099, now seen corresponding path program 1 times [2022-11-18 20:03:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:40,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467185726] [2022-11-18 20:03:40,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:40,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:40,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:40,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:03:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:40,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:03:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:40,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:40,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:03:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:03:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:40,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:03:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:40,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:03:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:40,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:03:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:40,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:40,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:03:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:40,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:03:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-18 20:03:40,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:40,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467185726] [2022-11-18 20:03:40,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467185726] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:40,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461448671] [2022-11-18 20:03:40,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:40,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:40,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:40,990 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:41,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:03:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:41,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:03:41,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:41,365 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:03:41,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-18 20:03:41,385 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:03:41,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-18 20:03:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 47 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-18 20:03:42,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:03:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-18 20:03:43,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461448671] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:03:43,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:03:43,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 11] total 26 [2022-11-18 20:03:43,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989964695] [2022-11-18 20:03:43,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:03:43,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-18 20:03:43,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:43,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-18 20:03:43,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2022-11-18 20:03:43,634 INFO L87 Difference]: Start difference. First operand 159 states and 202 transitions. Second operand has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 7 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-11-18 20:03:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:46,409 INFO L93 Difference]: Finished difference Result 397 states and 543 transitions. [2022-11-18 20:03:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-18 20:03:46,420 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 7 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 101 [2022-11-18 20:03:46,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:46,427 INFO L225 Difference]: With dead ends: 397 [2022-11-18 20:03:46,427 INFO L226 Difference]: Without dead ends: 292 [2022-11-18 20:03:46,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 213 SyntacticMatches, 13 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=442, Invalid=1910, Unknown=0, NotChecked=0, Total=2352 [2022-11-18 20:03:46,430 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 428 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:46,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1627 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 942 Invalid, 0 Unknown, 150 Unchecked, 1.2s Time] [2022-11-18 20:03:46,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-18 20:03:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 243. [2022-11-18 20:03:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 182 states have (on average 1.2747252747252746) internal successors, (232), 187 states have internal predecessors, (232), 38 states have call successors, (38), 20 states have call predecessors, (38), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-11-18 20:03:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 319 transitions. [2022-11-18 20:03:46,483 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 319 transitions. Word has length 101 [2022-11-18 20:03:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:46,484 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 319 transitions. [2022-11-18 20:03:46,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 7 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-11-18 20:03:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 319 transitions. [2022-11-18 20:03:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-18 20:03:46,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:46,487 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:46,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:46,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:46,699 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:46,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:46,700 INFO L85 PathProgramCache]: Analyzing trace with hash 158730997, now seen corresponding path program 1 times [2022-11-18 20:03:46,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:46,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919007043] [2022-11-18 20:03:46,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:46,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:46,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:46,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:03:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:46,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:03:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:46,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:46,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:03:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:46,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:03:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:46,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:03:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:46,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:03:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:46,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:03:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:03:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:03:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-18 20:03:47,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:47,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919007043] [2022-11-18 20:03:47,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919007043] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:47,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679953596] [2022-11-18 20:03:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:47,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:47,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:47,048 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:47,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:03:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:03:47,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-18 20:03:47,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:47,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679953596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:47,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:03:47,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-18 20:03:47,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818196656] [2022-11-18 20:03:47,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:47,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:03:47,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:47,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:03:47,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:03:47,359 INFO L87 Difference]: Start difference. First operand 243 states and 319 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:03:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:47,421 INFO L93 Difference]: Finished difference Result 390 states and 520 transitions. [2022-11-18 20:03:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:03:47,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2022-11-18 20:03:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:47,424 INFO L225 Difference]: With dead ends: 390 [2022-11-18 20:03:47,424 INFO L226 Difference]: Without dead ends: 238 [2022-11-18 20:03:47,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:03:47,429 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:47,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 359 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:03:47,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-18 20:03:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2022-11-18 20:03:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 177 states have (on average 1.2485875706214689) internal successors, (221), 182 states have internal predecessors, (221), 38 states have call successors, (38), 20 states have call predecessors, (38), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-11-18 20:03:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 308 transitions. [2022-11-18 20:03:47,473 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 308 transitions. Word has length 101 [2022-11-18 20:03:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:47,475 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 308 transitions. [2022-11-18 20:03:47,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:03:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 308 transitions. [2022-11-18 20:03:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-18 20:03:47,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:47,480 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:47,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:47,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:47,689 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:47,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1346020279, now seen corresponding path program 1 times [2022-11-18 20:03:47,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:47,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682516293] [2022-11-18 20:03:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:47,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:03:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:03:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:03:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:03:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:03:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 20:03:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-18 20:03:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:03:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:03:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-18 20:03:48,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:48,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682516293] [2022-11-18 20:03:48,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682516293] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:48,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353869520] [2022-11-18 20:03:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:48,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:48,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:48,051 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:48,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:03:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:48,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:03:48,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-18 20:03:48,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:48,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353869520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:48,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:03:48,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-18 20:03:48,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215944104] [2022-11-18 20:03:48,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:48,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:03:48,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:48,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:03:48,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:03:48,326 INFO L87 Difference]: Start difference. First operand 238 states and 308 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:03:48,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:48,370 INFO L93 Difference]: Finished difference Result 328 states and 431 transitions. [2022-11-18 20:03:48,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:03:48,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2022-11-18 20:03:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:48,372 INFO L225 Difference]: With dead ends: 328 [2022-11-18 20:03:48,373 INFO L226 Difference]: Without dead ends: 168 [2022-11-18 20:03:48,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:03:48,374 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 3 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:48,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 351 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:03:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-18 20:03:48,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 162. [2022-11-18 20:03:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 117 states have internal predecessors, (135), 31 states have call successors, (31), 16 states have call predecessors, (31), 16 states have return successors, (34), 28 states have call predecessors, (34), 30 states have call successors, (34) [2022-11-18 20:03:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2022-11-18 20:03:48,396 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 200 transitions. Word has length 99 [2022-11-18 20:03:48,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:48,397 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 200 transitions. [2022-11-18 20:03:48,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:03:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2022-11-18 20:03:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-18 20:03:48,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:48,401 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:48,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:48,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 20:03:48,609 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:48,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash -370312569, now seen corresponding path program 1 times [2022-11-18 20:03:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:48,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651049571] [2022-11-18 20:03:48,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:48,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:03:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:03:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:03:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:03:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:03:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:03:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-18 20:03:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 20:03:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:03:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-18 20:03:49,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:49,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651049571] [2022-11-18 20:03:49,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651049571] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:49,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567360656] [2022-11-18 20:03:49,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:49,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:49,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:49,936 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:49,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:03:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:50,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-18 20:03:50,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:50,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:03:50,566 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-18 20:03:50,585 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:03:50,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-18 20:03:50,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:03:50,613 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:03:50,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:03:50,736 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-11-18 20:03:50,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 93 [2022-11-18 20:03:50,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:50,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2022-11-18 20:03:50,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-18 20:03:50,919 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27|))) (let ((.cse1 (select .cse0 0))) (and (= (select .cse0 24) (select v_DerPreprocessor_2 24)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27| .cse1)) (= (select |c_#memory_$Pointer$.base| .cse1) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_2) .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_2) .cse1)))))) is different from true [2022-11-18 20:03:51,168 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_28| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_28|))) (let ((.cse0 (select .cse1 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_28| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_28| v_DerPreprocessor_2) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_28|)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27|))) (let ((.cse3 (select .cse2 0))) (and (= (select v_DerPreprocessor_4 24) (select .cse2 24)) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_4) .cse3 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_4) .cse3)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27| .cse3))))))) is different from true [2022-11-18 20:03:51,959 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_28| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_28|))) (let ((.cse0 (select .cse1 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_28| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_28| v_DerPreprocessor_2) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_28|)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35))) (let ((.cse2 (select .cse3 0))) (and (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_5) v_aws_linked_list_back_~list.base_BEFORE_CALL_35 v_DerPreprocessor_6) .cse2 v_DerPreprocessor_5) v_aws_linked_list_back_~list.base_BEFORE_CALL_35 v_DerPreprocessor_6) .cse2)) (not (= .cse2 v_aws_linked_list_back_~list.base_BEFORE_CALL_35)) (= (select .cse3 24) (select v_DerPreprocessor_6 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 24) (select v_DerPreprocessor_8 24)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27| .cse5)) (= (select |c_#memory_$Pointer$.base| .cse5) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_8) .cse5 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_8) .cse5)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|))) (let ((.cse6 (select .cse7 0))) (and (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_4) .cse6 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_4) .cse6)) (not (= .cse6 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|)) (= (select v_DerPreprocessor_4 24) (select .cse7 24))))))) is different from true [2022-11-18 20:03:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 12 not checked. [2022-11-18 20:03:54,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:03:55,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:03:55,608 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 40 treesize of output 33 [2022-11-18 20:03:55,632 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:03:55,632 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 309 treesize of output 287 [2022-11-18 20:03:55,650 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 306 treesize of output 298 [2022-11-18 20:03:55,670 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 298 treesize of output 294 [2022-11-18 20:03:55,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-11-18 20:03:55,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-18 20:03:55,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-18 20:03:55,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:03:55,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 63 [2022-11-18 20:03:56,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567360656] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:56,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:03:56,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 32 [2022-11-18 20:03:56,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170001643] [2022-11-18 20:03:56,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:03:56,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-18 20:03:56,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:56,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-18 20:03:56,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1412, Unknown=34, NotChecked=234, Total=1806 [2022-11-18 20:03:56,369 INFO L87 Difference]: Start difference. First operand 162 states and 200 transitions. Second operand has 32 states, 29 states have (on average 4.241379310344827) internal successors, (123), 29 states have internal predecessors, (123), 13 states have call successors, (26), 8 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 12 states have call successors, (23) [2022-11-18 20:03:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:58,438 INFO L93 Difference]: Finished difference Result 447 states and 601 transitions. [2022-11-18 20:03:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-18 20:03:58,439 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 4.241379310344827) internal successors, (123), 29 states have internal predecessors, (123), 13 states have call successors, (26), 8 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 12 states have call successors, (23) Word has length 102 [2022-11-18 20:03:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:58,442 INFO L225 Difference]: With dead ends: 447 [2022-11-18 20:03:58,442 INFO L226 Difference]: Without dead ends: 323 [2022-11-18 20:03:58,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=185, Invalid=2235, Unknown=42, NotChecked=294, Total=2756 [2022-11-18 20:03:58,445 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 69 mSDsluCounter, 2907 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 2670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1906 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:58,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 3100 Invalid, 2670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 746 Invalid, 0 Unknown, 1906 Unchecked, 0.9s Time] [2022-11-18 20:03:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-18 20:03:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 257. [2022-11-18 20:03:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 177 states have (on average 1.1581920903954803) internal successors, (205), 183 states have internal predecessors, (205), 54 states have call successors, (54), 23 states have call predecessors, (54), 25 states have return successors, (74), 50 states have call predecessors, (74), 53 states have call successors, (74) [2022-11-18 20:03:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 333 transitions. [2022-11-18 20:03:58,494 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 333 transitions. Word has length 102 [2022-11-18 20:03:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:58,494 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 333 transitions. [2022-11-18 20:03:58,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 4.241379310344827) internal successors, (123), 29 states have internal predecessors, (123), 13 states have call successors, (26), 8 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 12 states have call successors, (23) [2022-11-18 20:03:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 333 transitions. [2022-11-18 20:03:58,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-18 20:03:58,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:58,497 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:58,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:58,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-18 20:03:58,705 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:58,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:58,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1396948537, now seen corresponding path program 1 times [2022-11-18 20:03:58,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:58,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394308599] [2022-11-18 20:03:58,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:58,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:03:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:03:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:03:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:03:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:03:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:03:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-18 20:03:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 20:03:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:03:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-18 20:03:59,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:59,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394308599] [2022-11-18 20:03:59,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394308599] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:59,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550937347] [2022-11-18 20:03:59,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:59,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:59,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:59,647 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:59,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:03:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:03:59,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-18 20:04:00,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:04:00,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550937347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:04:00,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:04:00,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2022-11-18 20:04:00,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238080906] [2022-11-18 20:04:00,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:04:00,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:04:00,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:04:00,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:04:00,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:04:00,178 INFO L87 Difference]: Start difference. First operand 257 states and 333 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-18 20:04:00,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:04:00,509 INFO L93 Difference]: Finished difference Result 468 states and 636 transitions. [2022-11-18 20:04:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:04:00,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2022-11-18 20:04:00,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:04:00,513 INFO L225 Difference]: With dead ends: 468 [2022-11-18 20:04:00,513 INFO L226 Difference]: Without dead ends: 248 [2022-11-18 20:04:00,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-11-18 20:04:00,515 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 148 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:04:00,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 506 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:04:00,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-18 20:04:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2022-11-18 20:04:00,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 169 states have (on average 1.136094674556213) internal successors, (192), 174 states have internal predecessors, (192), 54 states have call successors, (54), 23 states have call predecessors, (54), 24 states have return successors, (70), 50 states have call predecessors, (70), 53 states have call successors, (70) [2022-11-18 20:04:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2022-11-18 20:04:00,553 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 102 [2022-11-18 20:04:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:04:00,554 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2022-11-18 20:04:00,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-18 20:04:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2022-11-18 20:04:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-18 20:04:00,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:04:00,557 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:04:00,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:04:00,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:04:00,764 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:04:00,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:04:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash -225472422, now seen corresponding path program 1 times [2022-11-18 20:04:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:04:00,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761647539] [2022-11-18 20:04:00,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:00,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:04:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:01,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:04:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:01,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:04:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:01,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:04:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:01,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:04:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:01,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:04:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:04:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:01,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:04:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:01,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:04:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:01,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-18 20:04:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:01,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:04:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:01,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 20:04:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:01,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:04:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:04:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-18 20:04:01,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:04:01,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761647539] [2022-11-18 20:04:01,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761647539] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:04:01,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209649569] [2022-11-18 20:04:01,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:01,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:04:01,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:04:01,824 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:04:01,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:04:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:02,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-18 20:04:02,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 67 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-18 20:04:02,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:04:02,794 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 19 treesize of output 11 [2022-11-18 20:04:03,037 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 19 treesize of output 11 [2022-11-18 20:04:03,114 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 20:04:03,115 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 16 treesize of output 15 [2022-11-18 20:04:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-18 20:04:03,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209649569] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:04:03,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:04:03,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 28 [2022-11-18 20:04:03,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835156716] [2022-11-18 20:04:03,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:04:03,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 20:04:03,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:04:03,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:04:03,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2022-11-18 20:04:03,338 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand has 28 states, 26 states have (on average 5.115384615384615) internal successors, (133), 23 states have internal predecessors, (133), 8 states have call successors, (27), 4 states have call predecessors, (27), 6 states have return successors, (26), 7 states have call predecessors, (26), 8 states have call successors, (26) [2022-11-18 20:04:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:04:04,445 INFO L93 Difference]: Finished difference Result 428 states and 599 transitions. [2022-11-18 20:04:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:04:04,446 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 5.115384615384615) internal successors, (133), 23 states have internal predecessors, (133), 8 states have call successors, (27), 4 states have call predecessors, (27), 6 states have return successors, (26), 7 states have call predecessors, (26), 8 states have call successors, (26) Word has length 115 [2022-11-18 20:04:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:04:04,449 INFO L225 Difference]: With dead ends: 428 [2022-11-18 20:04:04,450 INFO L226 Difference]: Without dead ends: 279 [2022-11-18 20:04:04,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=1234, Unknown=0, NotChecked=0, Total=1406 [2022-11-18 20:04:04,454 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 135 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:04:04,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1540 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:04:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-18 20:04:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2022-11-18 20:04:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 178 states have (on average 1.1404494382022472) internal successors, (203), 182 states have internal predecessors, (203), 54 states have call successors, (54), 23 states have call predecessors, (54), 25 states have return successors, (72), 52 states have call predecessors, (72), 53 states have call successors, (72) [2022-11-18 20:04:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 329 transitions. [2022-11-18 20:04:04,507 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 329 transitions. Word has length 115 [2022-11-18 20:04:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:04:04,509 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 329 transitions. [2022-11-18 20:04:04,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 5.115384615384615) internal successors, (133), 23 states have internal predecessors, (133), 8 states have call successors, (27), 4 states have call predecessors, (27), 6 states have return successors, (26), 7 states have call predecessors, (26), 8 states have call successors, (26) [2022-11-18 20:04:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 329 transitions. [2022-11-18 20:04:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-18 20:04:04,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:04:04,512 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:04:04,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:04:04,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:04:04,721 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:04:04,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:04:04,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1093753190, now seen corresponding path program 1 times [2022-11-18 20:04:04,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:04:04,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725654046] [2022-11-18 20:04:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:04:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:05,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:04:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:05,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:04:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:05,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:04:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:05,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:04:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:05,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:04:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:05,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:04:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:06,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:04:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:06,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:04:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:06,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:04:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:06,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:04:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:06,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:04:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:06,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 20:04:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:06,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:04:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-18 20:04:06,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:04:06,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725654046] [2022-11-18 20:04:06,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725654046] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:04:06,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964855190] [2022-11-18 20:04:06,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:06,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:04:06,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:04:06,595 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:04:06,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 20:04:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:06,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 131 conjunts are in the unsatisfiable core [2022-11-18 20:04:06,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:07,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-18 20:04:07,119 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-18 20:04:07,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-18 20:04:07,131 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-18 20:04:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 66 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:04:11,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:04:25,671 WARN L233 SmtUtils]: Spent 10.08s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:04:35,908 WARN L233 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:04:38,459 INFO L321 Elim1Store]: treesize reduction 23, result has 86.1 percent of original size [2022-11-18 20:04:38,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 6824 treesize of output 6455 [2022-11-18 20:04:39,042 INFO L321 Elim1Store]: treesize reduction 30, result has 85.8 percent of original size [2022-11-18 20:04:39,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 32922 treesize of output 31096 [2022-11-18 20:04:39,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:04:39,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39626 treesize of output 38056 [2022-11-18 20:04:40,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:04:40,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 37430 treesize of output 36429 [2022-11-18 20:04:42,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:04:42,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 42396 treesize of output 40883 [2022-11-18 20:04:45,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:04:45,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 39988 treesize of output 38599 [2022-11-18 20:05:02,927 INFO L321 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-11-18 20:05:02,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 6304 treesize of output 1 [2022-11-18 20:05:29,647 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-18 20:05:40,213 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-18 20:05:40,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-18 20:05:40,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:05:40,414 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Maybe an infinite loop at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-18 20:05:40,419 INFO L158 Benchmark]: Toolchain (without parser) took 241748.22ms. Allocated memory was 96.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 52.8MB in the beginning and 845.6MB in the end (delta: -792.9MB). Peak memory consumption was 587.5MB. Max. memory is 16.1GB. [2022-11-18 20:05:40,420 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 96.5MB. Free memory was 76.8MB in the beginning and 76.8MB in the end (delta: 50.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:05:40,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2849.99ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 52.5MB in the beginning and 86.8MB in the end (delta: -34.2MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2022-11-18 20:05:40,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 209.76ms. Allocated memory is still 127.9MB. Free memory was 86.8MB in the beginning and 81.2MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 20:05:40,421 INFO L158 Benchmark]: Boogie Preprocessor took 112.71ms. Allocated memory is still 127.9MB. Free memory was 81.2MB in the beginning and 78.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:05:40,421 INFO L158 Benchmark]: RCFGBuilder took 959.82ms. Allocated memory is still 127.9MB. Free memory was 78.5MB in the beginning and 52.5MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-18 20:05:40,422 INFO L158 Benchmark]: TraceAbstraction took 237603.94ms. Allocated memory was 127.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 51.9MB in the beginning and 845.6MB in the end (delta: -793.8MB). Peak memory consumption was 555.3MB. Max. memory is 16.1GB. [2022-11-18 20:05:40,424 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.32ms. Allocated memory is still 96.5MB. Free memory was 76.8MB in the beginning and 76.8MB in the end (delta: 50.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2849.99ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 52.5MB in the beginning and 86.8MB in the end (delta: -34.2MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 209.76ms. Allocated memory is still 127.9MB. Free memory was 86.8MB in the beginning and 81.2MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.71ms. Allocated memory is still 127.9MB. Free memory was 81.2MB in the beginning and 78.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 959.82ms. Allocated memory is still 127.9MB. Free memory was 78.5MB in the beginning and 52.5MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 237603.94ms. Allocated memory was 127.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 51.9MB in the beginning and 845.6MB in the end (delta: -793.8MB). Peak memory consumption was 555.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Maybe an infinite loop de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Maybe an infinite loop: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:130) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-18 20:05:40,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro --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 f57bc64edf303a057c8eafb48480d4e5b764bd411481261d53eb2a101eb82ae8 --- 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-8393723 [2022-11-18 20:05:43,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:05:43,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:05:43,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:05:43,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:05:43,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:05:43,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:05:43,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:05:43,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:05:43,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:05:43,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:05:43,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:05:43,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:05:43,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:05:43,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:05:43,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:05:43,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:05:43,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:05:43,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:05:43,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:05:43,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:05:43,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:05:43,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:05:43,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:05:43,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:05:43,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:05:43,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:05:43,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:05:43,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:05:43,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:05:43,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:05:43,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:05:43,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:05:43,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:05:43,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:05:43,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:05:43,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:05:43,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:05:43,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:05:43,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:05:43,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:05:43,424 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-18 20:05:43,479 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:05:43,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:05:43,482 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:05:43,482 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:05:43,484 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:05:43,484 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:05:43,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:05:43,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:05:43,486 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:05:43,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:05:43,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:05:43,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:05:43,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:05:43,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:05:43,489 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:05:43,489 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:05:43,490 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:05:43,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:05:43,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:05:43,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:05:43,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:05:43,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:05:43,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:05:43,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:05:43,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:05:43,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:05:43,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:05:43,493 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:05:43,493 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:05:43,493 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:05:43,494 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:05:43,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:05:43,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:05:43,495 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/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_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro 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 -> f57bc64edf303a057c8eafb48480d4e5b764bd411481261d53eb2a101eb82ae8 [2022-11-18 20:05:44,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:05:44,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:05:44,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:05:44,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:05:44,073 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:05:44,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2022-11-18 20:05:44,160 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/data/48f807285/7ddaf666f8324deba5b6fe4a03abc625/FLAGd6b742be5 [2022-11-18 20:05:45,158 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:05:45,159 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2022-11-18 20:05:45,197 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/data/48f807285/7ddaf666f8324deba5b6fe4a03abc625/FLAGd6b742be5 [2022-11-18 20:05:45,649 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/data/48f807285/7ddaf666f8324deba5b6fe4a03abc625 [2022-11-18 20:05:45,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:05:45,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:05:45,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:05:45,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:05:45,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:05:45,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:05:45" (1/1) ... [2022-11-18 20:05:45,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba64f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:45, skipping insertion in model container [2022-11-18 20:05:45,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:05:45" (1/1) ... [2022-11-18 20:05:45,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:05:45,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:05:46,247 WARN L234 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_11f920ca-d8ae-45a5-9bac-d189bcf3299c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4494,4507] [2022-11-18 20:05:46,258 WARN L234 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_11f920ca-d8ae-45a5-9bac-d189bcf3299c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4554,4567] [2022-11-18 20:05:47,702 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:47,705 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:47,706 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:47,708 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:47,709 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:47,738 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:47,740 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:47,748 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:47,750 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:47,755 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:47,758 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:47,759 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:47,761 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:48,248 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:05:48,249 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:05:48,250 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:05:48,253 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:05:48,254 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:05:48,256 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:05:48,257 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:05:48,258 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:05:48,259 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:05:48,270 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:05:48,503 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:05:48,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:05:48,559 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-18 20:05:48,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:05:48,624 WARN L234 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_11f920ca-d8ae-45a5-9bac-d189bcf3299c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4494,4507] [2022-11-18 20:05:48,625 WARN L234 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_11f920ca-d8ae-45a5-9bac-d189bcf3299c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4554,4567] [2022-11-18 20:05:48,710 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:48,721 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:48,722 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:48,722 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:48,723 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:48,732 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:48,740 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:48,742 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:48,743 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:48,744 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:48,745 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:48,746 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:48,746 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:48,824 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:05:48,825 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:05:48,826 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:05:48,829 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:05:48,837 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:05:48,837 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:05:48,838 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:05:48,839 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:05:48,839 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:05:48,840 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:05:48,884 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:05:48,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:05:48,925 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:05:48,956 WARN L234 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_11f920ca-d8ae-45a5-9bac-d189bcf3299c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4494,4507] [2022-11-18 20:05:48,957 WARN L234 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_11f920ca-d8ae-45a5-9bac-d189bcf3299c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4554,4567] [2022-11-18 20:05:49,027 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:49,028 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:49,028 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:49,031 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:49,032 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:49,047 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:49,048 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:49,051 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:49,051 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:49,053 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:49,053 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:49,054 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:49,054 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:05:49,091 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:05:49,092 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:05:49,093 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:05:49,094 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:05:49,095 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:05:49,096 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:05:49,097 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:05:49,098 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:05:49,098 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:05:49,099 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:05:49,135 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:05:49,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:05:49,466 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:05:49,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:49 WrapperNode [2022-11-18 20:05:49,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:05:49,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:05:49,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:05:49,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:05:49,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:49" (1/1) ... [2022-11-18 20:05:49,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:49" (1/1) ... [2022-11-18 20:05:49,609 INFO L138 Inliner]: procedures = 698, calls = 1044, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 134 [2022-11-18 20:05:49,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:05:49,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:05:49,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:05:49,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:05:49,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:49" (1/1) ... [2022-11-18 20:05:49,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:49" (1/1) ... [2022-11-18 20:05:49,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:49" (1/1) ... [2022-11-18 20:05:49,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:49" (1/1) ... [2022-11-18 20:05:49,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:49" (1/1) ... [2022-11-18 20:05:49,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:49" (1/1) ... [2022-11-18 20:05:49,662 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:49" (1/1) ... [2022-11-18 20:05:49,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:49" (1/1) ... [2022-11-18 20:05:49,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:05:49,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:05:49,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:05:49,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:05:49,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:49" (1/1) ... [2022-11-18 20:05:49,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:05:49,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:05:49,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:05:49,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:05:49,784 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2022-11-18 20:05:49,784 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2022-11-18 20:05:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:05:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:05:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-18 20:05:49,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-18 20:05:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-18 20:05:49,786 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-18 20:05:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:05:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-18 20:05:49,786 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-18 20:05:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:05:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:05:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:05:49,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:05:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-11-18 20:05:49,787 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-11-18 20:05:49,788 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:05:49,788 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:05:49,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:05:49,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:05:49,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:05:49,789 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-18 20:05:49,789 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-18 20:05:49,789 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-18 20:05:49,789 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-18 20:05:50,139 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:05:50,145 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:05:50,719 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:05:50,728 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:05:50,728 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:05:50,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:05:50 BoogieIcfgContainer [2022-11-18 20:05:50,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:05:50,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:05:50,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:05:50,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:05:50,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:05:45" (1/3) ... [2022-11-18 20:05:50,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6585ee79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:05:50, skipping insertion in model container [2022-11-18 20:05:50,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:05:49" (2/3) ... [2022-11-18 20:05:50,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6585ee79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:05:50, skipping insertion in model container [2022-11-18 20:05:50,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:05:50" (3/3) ... [2022-11-18 20:05:50,742 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness.i [2022-11-18 20:05:50,779 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:05:50,780 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:05:50,841 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:05:50,849 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;@58ccb093, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:05:50,849 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:05:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-18 20:05:50,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-18 20:05:50,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:05:50,869 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:05:50,870 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:05:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:05:50,877 INFO L85 PathProgramCache]: Analyzing trace with hash 464723229, now seen corresponding path program 1 times [2022-11-18 20:05:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:05:50,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899112560] [2022-11-18 20:05:50,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:05:50,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:05:50,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:05:50,902 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:05:50,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-18 20:05:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:05:51,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 20:05:51,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:05:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-18 20:05:51,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:05:51,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:05:51,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899112560] [2022-11-18 20:05:51,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899112560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:05:51,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:05:51,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:05:51,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329959094] [2022-11-18 20:05:51,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:05:51,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:05:51,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:05:51,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:05:51,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:05:51,437 INFO L87 Difference]: Start difference. First operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-18 20:05:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:05:51,487 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2022-11-18 20:05:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:05:51,490 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 84 [2022-11-18 20:05:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:05:51,501 INFO L225 Difference]: With dead ends: 188 [2022-11-18 20:05:51,502 INFO L226 Difference]: Without dead ends: 93 [2022-11-18 20:05:51,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-18 20:05:51,511 INFO L413 NwaCegarLoop]: 127 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, 127 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-18 20:05:51,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:05:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-18 20:05:51,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-18 20:05:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-18 20:05:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-11-18 20:05:51,574 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 84 [2022-11-18 20:05:51,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:05:51,575 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-11-18 20:05:51,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-18 20:05:51,576 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-11-18 20:05:51,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-18 20:05:51,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:05:51,581 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:05:51,611 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-18 20:05:51,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:05:51,802 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:05:51,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:05:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash 463621205, now seen corresponding path program 1 times [2022-11-18 20:05:51,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:05:51,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509679135] [2022-11-18 20:05:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:05:51,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:05:51,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:05:51,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:05:51,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-18 20:05:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:05:52,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:05:52,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:05:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-18 20:05:52,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:05:52,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:05:52,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509679135] [2022-11-18 20:05:52,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509679135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:05:52,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:05:52,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:05:52,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615153686] [2022-11-18 20:05:52,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:05:52,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:05:52,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:05:52,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:05:52,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:05:52,287 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-18 20:05:52,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:05:52,488 INFO L93 Difference]: Finished difference Result 169 states and 224 transitions. [2022-11-18 20:05:52,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:05:52,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 84 [2022-11-18 20:05:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:05:52,498 INFO L225 Difference]: With dead ends: 169 [2022-11-18 20:05:52,498 INFO L226 Difference]: Without dead ends: 95 [2022-11-18 20:05:52,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:05:52,504 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 2 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:05:52,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 558 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:05:52,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-18 20:05:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-18 20:05:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 63 states have internal predecessors, (76), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-18 20:05:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2022-11-18 20:05:52,534 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 84 [2022-11-18 20:05:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:05:52,539 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2022-11-18 20:05:52,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-18 20:05:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2022-11-18 20:05:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-18 20:05:52,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:05:52,543 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:05:52,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:05:52,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:05:52,764 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:05:52,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:05:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash -583798319, now seen corresponding path program 1 times [2022-11-18 20:05:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:05:52,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877155838] [2022-11-18 20:05:52,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:05:52,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:05:52,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:05:52,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:05:52,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-18 20:05:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:05:53,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:05:53,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:05:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:05:53,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:05:53,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:05:53,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877155838] [2022-11-18 20:05:53,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877155838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:05:53,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:05:53,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:05:53,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242689047] [2022-11-18 20:05:53,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:05:53,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:05:53,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:05:53,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:05:53,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:05:53,349 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-18 20:05:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:05:53,809 INFO L93 Difference]: Finished difference Result 174 states and 231 transitions. [2022-11-18 20:05:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:05:53,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 86 [2022-11-18 20:05:53,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:05:53,814 INFO L225 Difference]: With dead ends: 174 [2022-11-18 20:05:53,814 INFO L226 Difference]: Without dead ends: 95 [2022-11-18 20:05:53,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:05:53,820 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 50 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:05:53,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 637 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:05:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-18 20:05:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-18 20:05:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 63 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-18 20:05:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2022-11-18 20:05:53,855 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 86 [2022-11-18 20:05:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:05:53,856 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2022-11-18 20:05:53,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-18 20:05:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2022-11-18 20:05:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-18 20:05:53,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:05:53,861 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:05:53,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:05:54,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:05:54,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:05:54,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:05:54,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1801781246, now seen corresponding path program 1 times [2022-11-18 20:05:54,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:05:54,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725918846] [2022-11-18 20:05:54,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:05:54,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:05:54,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:05:54,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:05:54,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-18 20:05:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:05:54,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:05:54,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:05:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:05:54,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:05:54,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:05:54,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725918846] [2022-11-18 20:05:54,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725918846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:05:54,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:05:54,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:05:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923041329] [2022-11-18 20:05:54,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:05:54,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:05:54,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:05:54,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:05:54,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:05:54,570 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-18 20:05:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:05:55,096 INFO L93 Difference]: Finished difference Result 183 states and 244 transitions. [2022-11-18 20:05:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:05:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2022-11-18 20:05:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:05:55,099 INFO L225 Difference]: With dead ends: 183 [2022-11-18 20:05:55,099 INFO L226 Difference]: Without dead ends: 103 [2022-11-18 20:05:55,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:05:55,101 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 78 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:05:55,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 716 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:05:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-18 20:05:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2022-11-18 20:05:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-18 20:05:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2022-11-18 20:05:55,120 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 88 [2022-11-18 20:05:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:05:55,120 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2022-11-18 20:05:55,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-18 20:05:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2022-11-18 20:05:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-18 20:05:55,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:05:55,123 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:05:55,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:05:55,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:05:55,343 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:05:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:05:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1442434984, now seen corresponding path program 1 times [2022-11-18 20:05:55,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:05:55,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747067592] [2022-11-18 20:05:55,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:05:55,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:05:55,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:05:55,345 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:05:55,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-18 20:05:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:05:55,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:05:55,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:05:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-18 20:05:55,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:05:55,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:05:55,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747067592] [2022-11-18 20:05:55,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747067592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:05:55,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:05:55,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:05:55,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851925845] [2022-11-18 20:05:55,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:05:55,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:05:55,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:05:55,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:05:55,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:05:55,880 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-18 20:05:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:05:56,413 INFO L93 Difference]: Finished difference Result 179 states and 240 transitions. [2022-11-18 20:05:56,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:05:56,415 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 89 [2022-11-18 20:05:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:05:56,433 INFO L225 Difference]: With dead ends: 179 [2022-11-18 20:05:56,433 INFO L226 Difference]: Without dead ends: 102 [2022-11-18 20:05:56,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:05:56,435 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 56 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:05:56,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 624 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:05:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-18 20:05:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-11-18 20:05:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 65 states have internal predecessors, (77), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-18 20:05:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2022-11-18 20:05:56,455 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 89 [2022-11-18 20:05:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:05:56,455 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2022-11-18 20:05:56,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-18 20:05:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2022-11-18 20:05:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-18 20:05:56,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:05:56,458 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:05:56,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:05:56,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:05:56,678 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:05:56,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:05:56,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1734248118, now seen corresponding path program 1 times [2022-11-18 20:05:56,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:05:56,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004902562] [2022-11-18 20:05:56,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:05:56,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:05:56,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:05:56,681 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:05:56,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-18 20:05:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:05:57,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:05:57,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:05:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-18 20:05:57,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:05:57,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:05:57,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004902562] [2022-11-18 20:05:57,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004902562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:05:57,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:05:57,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:05:57,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292067002] [2022-11-18 20:05:57,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:05:57,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:05:57,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:05:57,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:05:57,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:05:57,094 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-18 20:05:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:05:57,241 INFO L93 Difference]: Finished difference Result 178 states and 233 transitions. [2022-11-18 20:05:57,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:05:57,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2022-11-18 20:05:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:05:57,244 INFO L225 Difference]: With dead ends: 178 [2022-11-18 20:05:57,244 INFO L226 Difference]: Without dead ends: 100 [2022-11-18 20:05:57,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:05:57,246 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:05:57,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 673 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:05:57,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-18 20:05:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-11-18 20:05:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.21875) internal successors, (78), 66 states have internal predecessors, (78), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-18 20:05:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2022-11-18 20:05:57,266 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 97 [2022-11-18 20:05:57,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:05:57,267 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2022-11-18 20:05:57,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-18 20:05:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2022-11-18 20:05:57,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-18 20:05:57,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:05:57,269 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:05:57,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:05:57,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:05:57,484 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:05:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:05:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash 26119479, now seen corresponding path program 1 times [2022-11-18 20:05:57,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:05:57,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801420566] [2022-11-18 20:05:57,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:05:57,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:05:57,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:05:57,486 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:05:57,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-18 20:05:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:05:57,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-18 20:05:57,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:00,636 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|))))) is different from true [2022-11-18 20:06:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 50 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-18 20:06:00,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-18 20:06:01,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:06:01,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801420566] [2022-11-18 20:06:01,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801420566] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:06:01,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:06:01,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2022-11-18 20:06:01,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408051975] [2022-11-18 20:06:01,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:06:01,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 20:06:01,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:06:01,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 20:06:01,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2022-11-18 20:06:01,597 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-11-18 20:06:03,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:03,660 INFO L93 Difference]: Finished difference Result 248 states and 342 transitions. [2022-11-18 20:06:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:06:03,664 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 99 [2022-11-18 20:06:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:03,666 INFO L225 Difference]: With dead ends: 248 [2022-11-18 20:06:03,666 INFO L226 Difference]: Without dead ends: 169 [2022-11-18 20:06:03,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=105, Invalid=360, Unknown=1, NotChecked=40, Total=506 [2022-11-18 20:06:03,668 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 177 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:03,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 848 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 328 Invalid, 0 Unknown, 213 Unchecked, 1.3s Time] [2022-11-18 20:06:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-18 20:06:03,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 116. [2022-11-18 20:06:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 80 states have (on average 1.25) internal successors, (100), 82 states have internal predecessors, (100), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2022-11-18 20:06:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 152 transitions. [2022-11-18 20:06:03,717 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 152 transitions. Word has length 99 [2022-11-18 20:06:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:03,718 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 152 transitions. [2022-11-18 20:06:03,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-11-18 20:06:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2022-11-18 20:06:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-18 20:06:03,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:03,720 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:03,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:06:03,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:06:03,935 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:03,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:03,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1987694137, now seen corresponding path program 1 times [2022-11-18 20:06:03,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:06:03,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817182171] [2022-11-18 20:06:03,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:03,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:06:03,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:06:03,938 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:06:03,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-18 20:06:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:04,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:06:04,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-18 20:06:04,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:06:04,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:06:04,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817182171] [2022-11-18 20:06:04,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817182171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:06:04,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:06:04,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:06:04,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455087532] [2022-11-18 20:06:04,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:06:04,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:06:04,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:06:04,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:06:04,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:06:04,320 INFO L87 Difference]: Start difference. First operand 116 states and 152 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:06:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:04,391 INFO L93 Difference]: Finished difference Result 216 states and 290 transitions. [2022-11-18 20:06:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:06:04,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2022-11-18 20:06:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:04,395 INFO L225 Difference]: With dead ends: 216 [2022-11-18 20:06:04,395 INFO L226 Difference]: Without dead ends: 119 [2022-11-18 20:06:04,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:06:04,397 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 8 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:04,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 361 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:06:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-18 20:06:04,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2022-11-18 20:06:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 80 states have (on average 1.2375) internal successors, (99), 82 states have internal predecessors, (99), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2022-11-18 20:06:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 151 transitions. [2022-11-18 20:06:04,432 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 151 transitions. Word has length 99 [2022-11-18 20:06:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:04,434 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 151 transitions. [2022-11-18 20:06:04,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:06:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 151 transitions. [2022-11-18 20:06:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-18 20:06:04,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:04,440 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:04,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:06:04,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:06:04,655 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:04,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1746573381, now seen corresponding path program 1 times [2022-11-18 20:06:04,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:06:04,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943759759] [2022-11-18 20:06:04,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:04,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:06:04,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:06:04,658 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:06:04,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-18 20:06:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:04,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:06:04,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-18 20:06:05,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:06:05,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:06:05,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943759759] [2022-11-18 20:06:05,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943759759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:06:05,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:06:05,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:06:05,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302630556] [2022-11-18 20:06:05,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:06:05,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:06:05,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:06:05,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:06:05,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:06:05,015 INFO L87 Difference]: Start difference. First operand 116 states and 151 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:06:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:05,108 INFO L93 Difference]: Finished difference Result 214 states and 287 transitions. [2022-11-18 20:06:05,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:06:05,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2022-11-18 20:06:05,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:05,111 INFO L225 Difference]: With dead ends: 214 [2022-11-18 20:06:05,111 INFO L226 Difference]: Without dead ends: 117 [2022-11-18 20:06:05,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:06:05,113 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 6 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:05,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 467 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:06:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-18 20:06:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2022-11-18 20:06:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2022-11-18 20:06:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2022-11-18 20:06:05,132 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 99 [2022-11-18 20:06:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:05,133 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2022-11-18 20:06:05,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:06:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2022-11-18 20:06:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-18 20:06:05,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:05,135 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:05,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:06:05,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:06:05,356 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:06:05,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2063472241, now seen corresponding path program 1 times [2022-11-18 20:06:05,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:06:05,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208814144] [2022-11-18 20:06:05,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:05,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:06:05,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:06:05,358 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:06:05,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-18 20:06:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:05,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-18 20:06:05,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:08,435 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_4 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_4) (_ bv0 64)) (_ bv16 64)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_4 (_ BitVec 64))) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_4 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_4) (_ bv0 64)))))) is different from true [2022-11-18 20:06:16,707 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:06:25,153 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:06:33,474 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:06:41,998 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:06:50,439 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:06:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 20:06:50,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:58,243 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 20:06:58,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-11-18 20:06:58,274 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-18 20:06:58,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2022-11-18 20:06:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-18 20:06:58,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:06:58,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208814144] [2022-11-18 20:06:58,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208814144] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:06:58,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:06:58,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2022-11-18 20:06:58,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415802754] [2022-11-18 20:06:58,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:06:58,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:06:58,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:06:58,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:06:58,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=672, Unknown=2, NotChecked=52, Total=812 [2022-11-18 20:06:58,314 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 29 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2022-11-18 20:07:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:07:03,919 INFO L93 Difference]: Finished difference Result 257 states and 332 transitions. [2022-11-18 20:07:03,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-18 20:07:03,921 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) Word has length 100 [2022-11-18 20:07:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:07:03,923 INFO L225 Difference]: With dead ends: 257 [2022-11-18 20:07:03,923 INFO L226 Difference]: Without dead ends: 145 [2022-11-18 20:07:03,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 50.2s TimeCoverageRelationStatistics Valid=115, Invalid=943, Unknown=2, NotChecked=62, Total=1122 [2022-11-18 20:07:03,925 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 82 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:07:03,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1094 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 722 Invalid, 0 Unknown, 428 Unchecked, 4.6s Time] [2022-11-18 20:07:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-18 20:07:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2022-11-18 20:07:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 98 states have internal predecessors, (117), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (29), 25 states have call predecessors, (29), 25 states have call successors, (29) [2022-11-18 20:07:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 172 transitions. [2022-11-18 20:07:03,950 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 172 transitions. Word has length 100 [2022-11-18 20:07:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:07:03,951 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 172 transitions. [2022-11-18 20:07:03,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2022-11-18 20:07:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 172 transitions. [2022-11-18 20:07:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-18 20:07:03,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:07:03,953 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:03,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:07:04,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:07:04,175 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:07:04,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:04,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1234652578, now seen corresponding path program 2 times [2022-11-18 20:07:04,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:07:04,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72205293] [2022-11-18 20:07:04,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:07:04,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:07:04,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:07:04,177 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:07:04,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-18 20:07:04,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:07:04,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:07:04,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-18 20:07:04,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:07:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-18 20:07:07,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:07:11,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:07:11,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-11-18 20:07:11,657 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 20:07:11,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2022-11-18 20:07:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-11-18 20:07:11,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:07:11,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72205293] [2022-11-18 20:07:11,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72205293] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:07:11,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:07:11,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2022-11-18 20:07:11,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227584509] [2022-11-18 20:07:11,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:07:11,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:07:11,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:07:11,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:07:11,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:07:11,760 INFO L87 Difference]: Start difference. First operand 135 states and 172 transitions. Second operand has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-18 20:07:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:07:13,759 INFO L93 Difference]: Finished difference Result 256 states and 324 transitions. [2022-11-18 20:07:13,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:07:13,762 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 110 [2022-11-18 20:07:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:07:13,764 INFO L225 Difference]: With dead ends: 256 [2022-11-18 20:07:13,764 INFO L226 Difference]: Without dead ends: 174 [2022-11-18 20:07:13,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 193 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2022-11-18 20:07:13,766 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 90 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:07:13,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1122 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 286 Invalid, 0 Unknown, 112 Unchecked, 1.2s Time] [2022-11-18 20:07:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-18 20:07:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 162. [2022-11-18 20:07:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 119 states have (on average 1.218487394957983) internal successors, (145), 120 states have internal predecessors, (145), 27 states have call successors, (27), 15 states have call predecessors, (27), 15 states have return successors, (31), 26 states have call predecessors, (31), 26 states have call successors, (31) [2022-11-18 20:07:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 203 transitions. [2022-11-18 20:07:13,794 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 203 transitions. Word has length 110 [2022-11-18 20:07:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:07:13,794 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 203 transitions. [2022-11-18 20:07:13,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-18 20:07:13,795 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 203 transitions. [2022-11-18 20:07:13,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-18 20:07:13,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:07:13,797 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:13,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-11-18 20:07:14,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:07:14,011 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:07:14,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:14,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2043999204, now seen corresponding path program 1 times [2022-11-18 20:07:14,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:07:14,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683127100] [2022-11-18 20:07:14,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:14,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:07:14,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:07:14,015 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:07:14,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-18 20:07:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:14,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-18 20:07:14,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:07:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-18 20:07:15,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:07:16,398 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 20:07:16,398 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-18 20:07:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-18 20:07:16,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:07:16,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683127100] [2022-11-18 20:07:16,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683127100] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:07:16,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:07:16,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2022-11-18 20:07:16,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650877213] [2022-11-18 20:07:16,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:07:16,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:07:16,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:07:16,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:07:16,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2022-11-18 20:07:16,665 INFO L87 Difference]: Start difference. First operand 162 states and 203 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 15 states have internal predecessors, (94), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-18 20:07:20,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:07:20,259 INFO L93 Difference]: Finished difference Result 348 states and 466 transitions. [2022-11-18 20:07:20,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:07:20,261 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 15 states have internal predecessors, (94), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 110 [2022-11-18 20:07:20,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:07:20,263 INFO L225 Difference]: With dead ends: 348 [2022-11-18 20:07:20,263 INFO L226 Difference]: Without dead ends: 235 [2022-11-18 20:07:20,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=170, Invalid=881, Unknown=5, NotChecked=0, Total=1056 [2022-11-18 20:07:20,266 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 145 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:07:20,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1207 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 478 Invalid, 0 Unknown, 14 Unchecked, 1.8s Time] [2022-11-18 20:07:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-18 20:07:20,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 167. [2022-11-18 20:07:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 123 states have (on average 1.2195121951219512) internal successors, (150), 124 states have internal predecessors, (150), 27 states have call successors, (27), 15 states have call predecessors, (27), 16 states have return successors, (34), 27 states have call predecessors, (34), 26 states have call successors, (34) [2022-11-18 20:07:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 211 transitions. [2022-11-18 20:07:20,301 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 211 transitions. Word has length 110 [2022-11-18 20:07:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:07:20,302 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 211 transitions. [2022-11-18 20:07:20,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 15 states have internal predecessors, (94), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-18 20:07:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 211 transitions. [2022-11-18 20:07:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-18 20:07:20,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:07:20,304 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:20,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:07:20,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:07:20,519 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:07:20,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:20,520 INFO L85 PathProgramCache]: Analyzing trace with hash -104837158, now seen corresponding path program 1 times [2022-11-18 20:07:20,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:07:20,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996753375] [2022-11-18 20:07:20,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:20,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:07:20,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:07:20,522 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:07:20,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-18 20:07:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:20,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:07:20,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:07:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-18 20:07:20,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:07:20,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:07:20,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996753375] [2022-11-18 20:07:20,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996753375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:07:20,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:07:20,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:07:20,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774476557] [2022-11-18 20:07:20,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:07:20,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:07:20,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:07:20,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:07:20,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:07:20,879 INFO L87 Difference]: Start difference. First operand 167 states and 211 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-18 20:07:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:07:20,942 INFO L93 Difference]: Finished difference Result 288 states and 373 transitions. [2022-11-18 20:07:20,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:07:20,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2022-11-18 20:07:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:07:20,945 INFO L225 Difference]: With dead ends: 288 [2022-11-18 20:07:20,945 INFO L226 Difference]: Without dead ends: 170 [2022-11-18 20:07:20,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:07:20,947 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:07:20,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 480 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:07:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-18 20:07:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2022-11-18 20:07:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 122 states have (on average 1.2049180327868851) internal successors, (147), 123 states have internal predecessors, (147), 27 states have call successors, (27), 15 states have call predecessors, (27), 16 states have return successors, (33), 27 states have call predecessors, (33), 26 states have call successors, (33) [2022-11-18 20:07:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 207 transitions. [2022-11-18 20:07:20,976 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 207 transitions. Word has length 110 [2022-11-18 20:07:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:07:20,976 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 207 transitions. [2022-11-18 20:07:20,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-18 20:07:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 207 transitions. [2022-11-18 20:07:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-18 20:07:20,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:07:20,979 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:21,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-11-18 20:07:21,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:07:21,199 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:07:21,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash 992920326, now seen corresponding path program 1 times [2022-11-18 20:07:21,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:07:21,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736302513] [2022-11-18 20:07:21,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:21,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:07:21,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:07:21,203 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:07:21,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-18 20:07:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:21,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:07:21,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:07:21,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-18 20:07:21,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:07:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 20:07:24,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:07:24,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:07:24,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736302513] [2022-11-18 20:07:24,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736302513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:07:24,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:07:24,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 20:07:24,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761178491] [2022-11-18 20:07:24,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:07:24,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:07:24,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:07:24,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:07:24,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:07:24,169 INFO L87 Difference]: Start difference. First operand 166 states and 207 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-18 20:07:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:07:25,102 INFO L93 Difference]: Finished difference Result 376 states and 474 transitions. [2022-11-18 20:07:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:07:25,103 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 111 [2022-11-18 20:07:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:07:25,106 INFO L225 Difference]: With dead ends: 376 [2022-11-18 20:07:25,106 INFO L226 Difference]: Without dead ends: 280 [2022-11-18 20:07:25,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 12 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:07:25,108 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 34 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:07:25,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 972 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 212 Unchecked, 0.7s Time] [2022-11-18 20:07:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-18 20:07:25,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 265. [2022-11-18 20:07:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 198 states have (on average 1.196969696969697) internal successors, (237), 200 states have internal predecessors, (237), 40 states have call successors, (40), 25 states have call predecessors, (40), 26 states have return successors, (52), 39 states have call predecessors, (52), 39 states have call successors, (52) [2022-11-18 20:07:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 329 transitions. [2022-11-18 20:07:25,159 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 329 transitions. Word has length 111 [2022-11-18 20:07:25,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:07:25,160 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 329 transitions. [2022-11-18 20:07:25,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-18 20:07:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 329 transitions. [2022-11-18 20:07:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-18 20:07:25,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:07:25,163 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:25,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-11-18 20:07:25,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:07:25,383 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:07:25,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:25,383 INFO L85 PathProgramCache]: Analyzing trace with hash 599893316, now seen corresponding path program 1 times [2022-11-18 20:07:25,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:07:25,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930493805] [2022-11-18 20:07:25,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:25,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:07:25,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:07:25,385 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:07:25,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-18 20:07:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:25,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-18 20:07:25,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:07:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 47 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-18 20:07:29,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:07:33,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:07:33,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-11-18 20:07:33,731 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 20:07:33,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2022-11-18 20:07:33,781 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-18 20:07:33,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:07:33,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930493805] [2022-11-18 20:07:33,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930493805] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:07:33,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:07:33,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 23 [2022-11-18 20:07:33,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252350593] [2022-11-18 20:07:33,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:07:33,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 20:07:33,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:07:33,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:07:33,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-11-18 20:07:33,785 INFO L87 Difference]: Start difference. First operand 265 states and 329 transitions. Second operand has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-18 20:07:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:07:36,825 INFO L93 Difference]: Finished difference Result 380 states and 475 transitions. [2022-11-18 20:07:36,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:07:36,827 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 111 [2022-11-18 20:07:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:07:36,830 INFO L225 Difference]: With dead ends: 380 [2022-11-18 20:07:36,830 INFO L226 Difference]: Without dead ends: 282 [2022-11-18 20:07:36,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 192 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2022-11-18 20:07:36,832 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 145 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:07:36,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1118 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 351 Invalid, 0 Unknown, 135 Unchecked, 1.5s Time] [2022-11-18 20:07:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-18 20:07:36,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 271. [2022-11-18 20:07:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 203 states have (on average 1.1822660098522169) internal successors, (240), 206 states have internal predecessors, (240), 40 states have call successors, (40), 25 states have call predecessors, (40), 27 states have return successors, (54), 39 states have call predecessors, (54), 39 states have call successors, (54) [2022-11-18 20:07:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2022-11-18 20:07:36,902 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 111 [2022-11-18 20:07:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:07:36,903 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2022-11-18 20:07:36,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-18 20:07:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2022-11-18 20:07:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-18 20:07:36,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:07:36,906 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:36,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-18 20:07:37,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:07:37,128 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:07:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:37,128 INFO L85 PathProgramCache]: Analyzing trace with hash 858058754, now seen corresponding path program 1 times [2022-11-18 20:07:37,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:07:37,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113846554] [2022-11-18 20:07:37,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:37,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:07:37,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:07:37,132 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:07:37,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-18 20:07:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:37,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-18 20:07:37,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:07:39,764 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14|))))) is different from true [2022-11-18 20:07:41,925 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15|))))) is different from true [2022-11-18 20:07:44,146 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_30 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_31 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_30) v_aws_linked_list_back_~list.offset_BEFORE_CALL_31)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_30 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_31 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_30) v_aws_linked_list_back_~list.offset_BEFORE_CALL_31))))) is different from true [2022-11-18 20:07:46,280 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_32 (_ BitVec 64)) (v_aws_linked_list_back_~list.base_BEFORE_CALL_31 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_31) v_aws_linked_list_back_~list.offset_BEFORE_CALL_32)))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_32 (_ BitVec 64)) (v_aws_linked_list_back_~list.base_BEFORE_CALL_31 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_31) v_aws_linked_list_back_~list.offset_BEFORE_CALL_32))))) is different from true [2022-11-18 20:07:48,466 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_33 (_ BitVec 64)) (v_aws_linked_list_back_~list.base_BEFORE_CALL_32 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_32) v_aws_linked_list_back_~list.offset_BEFORE_CALL_33)))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_33 (_ BitVec 64)) (v_aws_linked_list_back_~list.base_BEFORE_CALL_32 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_32) v_aws_linked_list_back_~list.offset_BEFORE_CALL_33))))) is different from true [2022-11-18 20:07:50,614 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_34 (_ BitVec 64)) (v_aws_linked_list_back_~list.base_BEFORE_CALL_33 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_33) v_aws_linked_list_back_~list.offset_BEFORE_CALL_34) (_ bv0 64)))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_34 (_ BitVec 64)) (v_aws_linked_list_back_~list.base_BEFORE_CALL_33 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_33) v_aws_linked_list_back_~list.offset_BEFORE_CALL_34))))) is different from true [2022-11-18 20:07:58,800 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:08:07,026 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:08:15,290 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:08:21,507 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:08:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 19 not checked. [2022-11-18 20:08:21,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:08:24,922 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 20:08:24,923 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-18 20:08:24,948 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-18 20:08:24,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-11-18 20:08:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-18 20:08:25,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:08:25,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113846554] [2022-11-18 20:08:25,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113846554] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:08:25,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:08:25,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 23 [2022-11-18 20:08:25,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463517935] [2022-11-18 20:08:25,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:08:25,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 20:08:25,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:08:25,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:08:25,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=221, Unknown=10, NotChecked=210, Total=506 [2022-11-18 20:08:25,049 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand has 23 states, 23 states have (on average 4.0) internal successors, (92), 22 states have internal predecessors, (92), 5 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2022-11-18 20:08:42,220 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14|))))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15|)))))) is different from true [2022-11-18 20:08:56,530 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:09:06,721 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:09:14,953 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:09:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:15,219 INFO L93 Difference]: Finished difference Result 455 states and 552 transitions. [2022-11-18 20:09:15,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:09:15,225 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.0) internal successors, (92), 22 states have internal predecessors, (92), 5 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) Word has length 111 [2022-11-18 20:09:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:15,227 INFO L225 Difference]: With dead ends: 455 [2022-11-18 20:09:15,227 INFO L226 Difference]: Without dead ends: 349 [2022-11-18 20:09:15,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 194 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 95.2s TimeCoverageRelationStatistics Valid=164, Invalid=489, Unknown=25, NotChecked=378, Total=1056 [2022-11-18 20:09:15,229 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 173 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1059 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:15,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 711 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 1059 Unchecked, 0.7s Time] [2022-11-18 20:09:15,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-18 20:09:15,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 305. [2022-11-18 20:09:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 231 states have (on average 1.173160173160173) internal successors, (271), 236 states have internal predecessors, (271), 40 states have call successors, (40), 29 states have call predecessors, (40), 33 states have return successors, (56), 39 states have call predecessors, (56), 39 states have call successors, (56) [2022-11-18 20:09:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 367 transitions. [2022-11-18 20:09:15,296 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 367 transitions. Word has length 111 [2022-11-18 20:09:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:15,297 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 367 transitions. [2022-11-18 20:09:15,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.0) internal successors, (92), 22 states have internal predecessors, (92), 5 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2022-11-18 20:09:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 367 transitions. [2022-11-18 20:09:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-18 20:09:15,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:15,300 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:15,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:15,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:15,520 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:09:15,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:15,521 INFO L85 PathProgramCache]: Analyzing trace with hash -153058496, now seen corresponding path program 1 times [2022-11-18 20:09:15,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:09:15,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182637428] [2022-11-18 20:09:15,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:15,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:15,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:09:15,523 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:09:15,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-18 20:09:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:15,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:09:15,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-18 20:09:15,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:09:15,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:09:15,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182637428] [2022-11-18 20:09:15,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182637428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:15,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:15,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:09:15,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803840868] [2022-11-18 20:09:15,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:15,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:09:15,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:09:15,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:09:15,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:09:15,979 INFO L87 Difference]: Start difference. First operand 305 states and 367 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-18 20:09:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:16,228 INFO L93 Difference]: Finished difference Result 605 states and 744 transitions. [2022-11-18 20:09:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:09:16,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 111 [2022-11-18 20:09:16,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:16,232 INFO L225 Difference]: With dead ends: 605 [2022-11-18 20:09:16,232 INFO L226 Difference]: Without dead ends: 292 [2022-11-18 20:09:16,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:09:16,235 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 50 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:16,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 539 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:09:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-18 20:09:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-11-18 20:09:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 219 states have (on average 1.1461187214611872) internal successors, (251), 223 states have internal predecessors, (251), 40 states have call successors, (40), 29 states have call predecessors, (40), 32 states have return successors, (53), 39 states have call predecessors, (53), 39 states have call successors, (53) [2022-11-18 20:09:16,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 344 transitions. [2022-11-18 20:09:16,297 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 344 transitions. Word has length 111 [2022-11-18 20:09:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:16,298 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 344 transitions. [2022-11-18 20:09:16,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-18 20:09:16,298 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 344 transitions. [2022-11-18 20:09:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-18 20:09:16,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:16,303 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:16,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:16,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:16,515 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:09:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:16,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1033340424, now seen corresponding path program 1 times [2022-11-18 20:09:16,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:09:16,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177820397] [2022-11-18 20:09:16,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:16,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:16,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:09:16,517 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:09:16,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-18 20:09:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:16,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:09:16,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:17,277 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-18 20:09:17,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-11-18 20:09:17,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-18 20:09:17,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-18 20:09:17,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:09:17,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 13 [2022-11-18 20:09:17,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:09:17,666 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse0 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (= .cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (not (= (_ bv0 64) .cse1)))))) is different from true [2022-11-18 20:09:18,292 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse2 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= .cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (not (= (_ bv0 64) .cse3))))))) is different from true [2022-11-18 20:09:18,595 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse2 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= .cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (not (= (_ bv0 64) .cse3)))))) (let ((.cse6 (bvadd |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset| (_ bv24 64)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|) .cse6))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select v_DerPreprocessor_3 .cse6))) (and (= .cse4 .cse5) (not (= (_ bv0 64) .cse5)) (= (select |c_#memory_$Pointer$.base| .cse5) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base| v_DerPreprocessor_3) .cse5 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base| v_DerPreprocessor_3) .cse5))))) (and (= |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base| .cse4) (not (= (_ bv0 64) .cse4)))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset|)) is different from true [2022-11-18 20:09:18,842 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (not (= .cse1 (_ bv0 64))))))) (= (_ bv0 64) |c_aws_linked_list_back_#in~list.offset|) (let ((.cse4 (bvadd (_ bv24 64) |c_aws_linked_list_back_#in~list.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_back_#in~list.base|) .cse4))) (or (and (not (= (_ bv0 64) .cse2)) (= .cse2 |c_aws_linked_list_back_#in~list.base|)) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select v_DerPreprocessor_3 .cse4))) (and (not (= (_ bv0 64) .cse3)) (= .cse2 .cse3) (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |c_aws_linked_list_back_#in~list.base| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |c_aws_linked_list_back_#in~list.base| v_DerPreprocessor_3) .cse3)))))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse5 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse5 (_ bv0 64))) (= .cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse5 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse5) (select |c_#memory_$Pointer$.base| .cse5))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= .cse6 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (not (= (_ bv0 64) .cse6))))))) is different from true [2022-11-18 20:09:19,467 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse2 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= .cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (= .cse3 v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (not (= (_ bv0 64) .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= .cse5 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (not (= (_ bv0 64) .cse5))))))) is different from true [2022-11-18 20:09:23,507 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse2 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= .cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (= .cse3 v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (not (= (_ bv0 64) .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= .cse5 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (not (= (_ bv0 64) .cse5)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse6)) (= .cse6 v_aws_linked_list_back_~list.base_BEFORE_CALL_45)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse7 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse7 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse7 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse7) (select |c_#memory_$Pointer$.base| .cse7)) (= .cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))))))) is different from true [2022-11-18 20:09:23,981 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (not (= .cse1 (_ bv0 64))))))) (= (_ bv0 64) c_aws_linked_list_back_~list.offset) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse2 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= .cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (= .cse3 v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (not (= (_ bv0 64) .cse3)))))) (let ((.cse6 (bvadd (_ bv24 64) c_aws_linked_list_back_~list.offset))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_aws_linked_list_back_~list.base) .cse6))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select v_DerPreprocessor_3 .cse6))) (and (= (select |c_#memory_$Pointer$.base| .cse4) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) c_aws_linked_list_back_~list.base v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) c_aws_linked_list_back_~list.base v_DerPreprocessor_3) .cse4)) (= .cse5 .cse4) (not (= (_ bv0 64) .cse4))))) (and (not (= .cse5 (_ bv0 64))) (= .cse5 c_aws_linked_list_back_~list.base))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse7 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse7 (_ bv0 64))) (= .cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse7) (select |c_#memory_$Pointer$.base| .cse7))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= .cse8 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (not (= (_ bv0 64) .cse8)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse9)) (= .cse9 v_aws_linked_list_back_~list.base_BEFORE_CALL_45)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse10 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse10 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse10 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= .cse10 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))))))) is different from true [2022-11-18 20:09:24,288 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse2 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= .cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (= .cse3 v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (not (= (_ bv0 64) .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= .cse5 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (not (= (_ bv0 64) .cse5)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse6 v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (not (= (_ bv0 64) .cse6))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse7 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse7 (_ bv0 64))) (= .cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_46 v_DerPreprocessor_3) .cse7 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_46 v_DerPreprocessor_3) .cse7) (select |c_#memory_$Pointer$.base| .cse7)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse8)) (= .cse8 v_aws_linked_list_back_~list.base_BEFORE_CALL_45)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse9) (select |c_#memory_$Pointer$.base| .cse9)) (= .cse9 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))))))) is different from true [2022-11-18 20:09:30,918 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (= .cse2 v_aws_linked_list_back_~list.base_BEFORE_CALL_47)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_47 (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_47) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_47 v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_47 v_DerPreprocessor_3) .cse3) (select |c_#memory_$Pointer$.base| .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (= .cse5 v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (not (= (_ bv0 64) .cse5)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= .cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse6) (select |c_#memory_$Pointer$.base| .cse6))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= .cse7 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (not (= (_ bv0 64) .cse7)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse8 v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (not (= (_ bv0 64) .cse8))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= .cse9 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_46 v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_46 v_DerPreprocessor_3) .cse9) (select |c_#memory_$Pointer$.base| .cse9)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse10)) (= .cse10 v_aws_linked_list_back_~list.base_BEFORE_CALL_45)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse11 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse11 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse11 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse11) (select |c_#memory_$Pointer$.base| .cse11)) (= .cse11 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))))))) is different from true [2022-11-18 20:09:31,678 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (= .cse2 v_aws_linked_list_back_~list.base_BEFORE_CALL_47)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_47 (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_47) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_47 v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_47 v_DerPreprocessor_3) .cse3) (select |c_#memory_$Pointer$.base| .cse3)))))) (= (_ bv0 64) c_aws_linked_list_back_~list.offset) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (= .cse5 v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (not (= (_ bv0 64) .cse5)))))) (let ((.cse8 (bvadd (_ bv24 64) c_aws_linked_list_back_~list.offset))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_aws_linked_list_back_~list.base) .cse8))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select v_DerPreprocessor_3 .cse8))) (and (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) c_aws_linked_list_back_~list.base v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) c_aws_linked_list_back_~list.base v_DerPreprocessor_3) .cse6)) (= .cse7 .cse6) (not (= (_ bv0 64) .cse6))))) (and (not (= .cse7 (_ bv0 64))) (= .cse7 c_aws_linked_list_back_~list.base))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse9 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse9 (_ bv0 64))) (= .cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse9) (select |c_#memory_$Pointer$.base| .cse9))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= .cse10 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (not (= (_ bv0 64) .cse10)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse11 v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (not (= (_ bv0 64) .cse11))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse12 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse12 (_ bv0 64))) (= .cse12 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_46 v_DerPreprocessor_3) .cse12 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_46 v_DerPreprocessor_3) .cse12) (select |c_#memory_$Pointer$.base| .cse12)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse13)) (= .cse13 v_aws_linked_list_back_~list.base_BEFORE_CALL_45)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse14 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse14 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse14 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse14 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse14) (select |c_#memory_$Pointer$.base| .cse14)) (= .cse14 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))))))) is different from true [2022-11-18 20:09:32,071 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (= .cse2 v_aws_linked_list_back_~list.base_BEFORE_CALL_47)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_47 (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_47) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_47 v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_47 v_DerPreprocessor_3) .cse3) (select |c_#memory_$Pointer$.base| .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (= .cse5 v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (not (= (_ bv0 64) .cse5)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_48 (_ BitVec 64)) (v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_48 v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_48 v_DerPreprocessor_3) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= .cse6 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_48) (_ bv24 64)) .cse6)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_48 (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_48) (_ bv24 64)))) (and (= .cse7 v_aws_linked_list_back_~list.base_BEFORE_CALL_48) (not (= .cse7 (_ bv0 64))))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse8 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse8 (_ bv0 64))) (= .cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse8) (select |c_#memory_$Pointer$.base| .cse8))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= .cse9 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (not (= (_ bv0 64) .cse9)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse10 v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (not (= (_ bv0 64) .cse10))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse11 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse11 (_ bv0 64))) (= .cse11 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_46 v_DerPreprocessor_3) .cse11 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_46 v_DerPreprocessor_3) .cse11) (select |c_#memory_$Pointer$.base| .cse11)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse12)) (= .cse12 v_aws_linked_list_back_~list.base_BEFORE_CALL_45)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse13 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse13 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse13) (select |c_#memory_$Pointer$.base| .cse13)) (= .cse13 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))))))) is different from true [2022-11-18 20:09:32,376 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_is_valid_#in~list#1.offset| |c_aws_linked_list_is_valid_~list#1.offset|) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (= .cse2 v_aws_linked_list_back_~list.base_BEFORE_CALL_47)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_47 (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_47) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_47 v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_47 v_DerPreprocessor_3) .cse3) (select |c_#memory_$Pointer$.base| .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (= .cse5 v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (not (= (_ bv0 64) .cse5)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_48 (_ BitVec 64)) (v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_48 v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_48 v_DerPreprocessor_3) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= .cse6 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_48) (_ bv24 64)) .cse6)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_48 (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_48) (_ bv24 64)))) (and (= .cse7 v_aws_linked_list_back_~list.base_BEFORE_CALL_48) (not (= .cse7 (_ bv0 64))))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse8 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse8 (_ bv0 64))) (= .cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse8) (select |c_#memory_$Pointer$.base| .cse8))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= .cse9 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (not (= (_ bv0 64) .cse9)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse10 v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (not (= (_ bv0 64) .cse10))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse11 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse11 (_ bv0 64))) (= .cse11 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_46 v_DerPreprocessor_3) .cse11 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_46 v_DerPreprocessor_3) .cse11) (select |c_#memory_$Pointer$.base| .cse11)))))) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_~list#1.base|) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse12)) (= .cse12 v_aws_linked_list_back_~list.base_BEFORE_CALL_45)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse13 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse13 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse13) (select |c_#memory_$Pointer$.base| .cse13)) (= .cse13 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))))))) is different from true [2022-11-18 20:09:40,310 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:09:40,556 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (= .cse2 v_aws_linked_list_back_~list.base_BEFORE_CALL_47)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_47 (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_47) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_47 v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_47 v_DerPreprocessor_3) .cse3) (select |c_#memory_$Pointer$.base| .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (= .cse5 v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (not (= (_ bv0 64) .cse5)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_48 (_ BitVec 64)) (v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_48 v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_48 v_DerPreprocessor_3) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= .cse6 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_48) (_ bv24 64)) .cse6)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_48 (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_48) (_ bv24 64)))) (and (= .cse7 v_aws_linked_list_back_~list.base_BEFORE_CALL_48) (not (= .cse7 (_ bv0 64))))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse8 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse8 (_ bv0 64))) (= .cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse8) (select |c_#memory_$Pointer$.base| .cse8))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= .cse9 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (not (= (_ bv0 64) .cse9)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse10 v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (not (= (_ bv0 64) .cse10))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse11 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse11 (_ bv0 64))) (= .cse11 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_46 v_DerPreprocessor_3) .cse11 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_46 v_DerPreprocessor_3) .cse11) (select |c_#memory_$Pointer$.base| .cse11)))))) (or |c_aws_linked_list_is_valid_#t~short303#1| (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (bvadd |c_aws_linked_list_is_valid_#in~list#1.offset| (_ bv24 64))) (_ bv0 64))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse12)) (= .cse12 v_aws_linked_list_back_~list.base_BEFORE_CALL_45)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse13 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse13 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse13) (select |c_#memory_$Pointer$.base| .cse13)) (= .cse13 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))))))) is different from true [2022-11-18 20:09:40,909 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_36|) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (= .cse2 v_aws_linked_list_back_~list.base_BEFORE_CALL_47)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_47 (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse3 (_ bv0 64))) (= .cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_47) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_47 v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_47 v_DerPreprocessor_3) .cse3) (select |c_#memory_$Pointer$.base| .cse3)))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse4 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (= .cse4 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_44 v_DerPreprocessor_3) .cse4) (select |c_#memory_$Pointer$.base| .cse4))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (= .cse5 v_aws_linked_list_back_~list.base_BEFORE_CALL_44) (not (= (_ bv0 64) .cse5)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_48 (_ BitVec 64)) (v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_48 v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_48 v_DerPreprocessor_3) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= .cse6 (_ bv0 64))) (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_48) (_ bv24 64)) .cse6)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_48 (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_48) (_ bv24 64)))) (and (= .cse7 v_aws_linked_list_back_~list.base_BEFORE_CALL_48) (not (= .cse7 (_ bv0 64))))))) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse8 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse8 (_ bv0 64))) (= .cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_3) .cse8) (select |c_#memory_$Pointer$.base| .cse8))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= .cse9 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_35|) (not (= (_ bv0 64) .cse9)))))) (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (bvadd |c_aws_linked_list_is_valid_#in~list#1.offset| (_ bv24 64))) (_ bv0 64)) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse10 v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (not (= (_ bv0 64) .cse10))))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse11 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse11 (_ bv0 64))) (= .cse11 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_46) (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_46 v_DerPreprocessor_3) .cse11 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_46 v_DerPreprocessor_3) .cse11) (select |c_#memory_$Pointer$.base| .cse11)))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse12)) (= .cse12 v_aws_linked_list_back_~list.base_BEFORE_CALL_45)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_aws_linked_list_back_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse13 (select v_DerPreprocessor_3 (_ bv24 64)))) (and (not (= .cse13 (_ bv0 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_45 v_DerPreprocessor_3) .cse13) (select |c_#memory_$Pointer$.base| .cse13)) (= .cse13 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_45) (_ bv24 64)))))))) is different from true [2022-11-18 20:09:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 56 not checked. [2022-11-18 20:09:41,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:43,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:43,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 255 [2022-11-18 20:09:43,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 266 [2022-11-18 20:09:43,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 258 [2022-11-18 20:09:43,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-18 20:09:43,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-18 20:09:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-18 20:09:43,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:09:43,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177820397] [2022-11-18 20:09:43,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177820397] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:43,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:09:43,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [24] total 33 [2022-11-18 20:09:43,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576580799] [2022-11-18 20:09:43,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:43,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:09:43,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:09:43,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:09:43,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=281, Unknown=36, NotChecked=658, Total=1056 [2022-11-18 20:09:43,856 INFO L87 Difference]: Start difference. First operand 292 states and 344 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-18 20:09:47,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:47,453 INFO L93 Difference]: Finished difference Result 414 states and 505 transitions. [2022-11-18 20:09:47,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:09:47,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 113 [2022-11-18 20:09:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:47,456 INFO L225 Difference]: With dead ends: 414 [2022-11-18 20:09:47,456 INFO L226 Difference]: Without dead ends: 315 [2022-11-18 20:09:47,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=102, Invalid=422, Unknown=38, NotChecked=770, Total=1332 [2022-11-18 20:09:47,458 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 61 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:47,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 944 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-18 20:09:47,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-18 20:09:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 306. [2022-11-18 20:09:47,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 225 states have (on average 1.1422222222222222) internal successors, (257), 230 states have internal predecessors, (257), 46 states have call successors, (46), 29 states have call predecessors, (46), 34 states have return successors, (62), 46 states have call predecessors, (62), 45 states have call successors, (62) [2022-11-18 20:09:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 365 transitions. [2022-11-18 20:09:47,537 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 365 transitions. Word has length 113 [2022-11-18 20:09:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:47,541 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 365 transitions. [2022-11-18 20:09:47,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-18 20:09:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 365 transitions. [2022-11-18 20:09:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-18 20:09:47,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:47,545 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:09:47,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-11-18 20:09:47,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:47,766 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:09:47,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:47,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1425095553, now seen corresponding path program 1 times [2022-11-18 20:09:47,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:09:47,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728195352] [2022-11-18 20:09:47,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:47,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:09:47,768 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:09:47,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-18 20:09:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:48,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-18 20:09:48,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:10:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 72 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:10:24,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:10:52,778 INFO L321 Elim1Store]: treesize reduction 17, result has 82.8 percent of original size [2022-11-18 20:10:52,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 125 [2022-11-18 20:10:53,492 INFO L321 Elim1Store]: treesize reduction 8, result has 88.1 percent of original size [2022-11-18 20:10:53,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 132 [2022-11-18 20:10:59,587 INFO L321 Elim1Store]: treesize reduction 17, result has 82.8 percent of original size [2022-11-18 20:10:59,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 125 [2022-11-18 20:11:00,314 INFO L321 Elim1Store]: treesize reduction 8, result has 88.1 percent of original size [2022-11-18 20:11:00,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 132 [2022-11-18 20:11:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 39 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-18 20:11:01,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:11:01,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728195352] [2022-11-18 20:11:01,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728195352] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:11:01,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:11:01,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 38 [2022-11-18 20:11:01,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352230051] [2022-11-18 20:11:01,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:11:01,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-18 20:11:01,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:11:01,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-18 20:11:01,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1261, Unknown=7, NotChecked=0, Total=1406 [2022-11-18 20:11:01,865 INFO L87 Difference]: Start difference. First operand 306 states and 365 transitions. Second operand has 38 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 32 states have internal predecessors, (128), 12 states have call successors, (28), 5 states have call predecessors, (28), 11 states have return successors, (26), 13 states have call predecessors, (26), 11 states have call successors, (26) [2022-11-18 20:11:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:17,627 INFO L93 Difference]: Finished difference Result 507 states and 623 transitions. [2022-11-18 20:11:17,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-18 20:11:17,630 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 32 states have internal predecessors, (128), 12 states have call successors, (28), 5 states have call predecessors, (28), 11 states have return successors, (26), 13 states have call predecessors, (26), 11 states have call successors, (26) Word has length 124 [2022-11-18 20:11:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:17,632 INFO L225 Difference]: With dead ends: 507 [2022-11-18 20:11:17,633 INFO L226 Difference]: Without dead ends: 379 [2022-11-18 20:11:17,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 209 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 63.6s TimeCoverageRelationStatistics Valid=286, Invalid=2460, Unknown=10, NotChecked=0, Total=2756 [2022-11-18 20:11:17,636 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 106 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 2433 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 444 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:17,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 2433 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 427 Invalid, 0 Unknown, 444 Unchecked, 2.3s Time] [2022-11-18 20:11:17,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-11-18 20:11:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 324. [2022-11-18 20:11:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 239 states have (on average 1.1255230125523012) internal successors, (269), 245 states have internal predecessors, (269), 48 states have call successors, (48), 30 states have call predecessors, (48), 36 states have return successors, (62), 48 states have call predecessors, (62), 47 states have call successors, (62) [2022-11-18 20:11:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 379 transitions. [2022-11-18 20:11:17,741 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 379 transitions. Word has length 124 [2022-11-18 20:11:17,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:17,741 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 379 transitions. [2022-11-18 20:11:17,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 32 states have internal predecessors, (128), 12 states have call successors, (28), 5 states have call predecessors, (28), 11 states have return successors, (26), 13 states have call predecessors, (26), 11 states have call successors, (26) [2022-11-18 20:11:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 379 transitions. [2022-11-18 20:11:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-18 20:11:17,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:17,744 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:11:17,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-18 20:11:17,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:11:17,965 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:11:17,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:17,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1683260991, now seen corresponding path program 1 times [2022-11-18 20:11:17,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:11:17,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930481594] [2022-11-18 20:11:17,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:17,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:11:17,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:11:17,967 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:11:17,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-18 20:11:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:18,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-18 20:11:18,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:11:20,712 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24|))))) is different from true [2022-11-18 20:11:22,860 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25|))))) is different from true [2022-11-18 20:11:25,098 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_63 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_60 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_63) v_aws_linked_list_back_~list.offset_BEFORE_CALL_60)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_63 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_60 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_63) v_aws_linked_list_back_~list.offset_BEFORE_CALL_60))))) is different from true [2022-11-18 20:11:27,238 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_64 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_61 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_64) v_aws_linked_list_back_~list.offset_BEFORE_CALL_61)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_64 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_61 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_64) v_aws_linked_list_back_~list.offset_BEFORE_CALL_61))))) is different from true [2022-11-18 20:11:29,405 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_65 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_62 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_65) v_aws_linked_list_back_~list.offset_BEFORE_CALL_62)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_65 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_62 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_65) v_aws_linked_list_back_~list.offset_BEFORE_CALL_62))))) is different from true [2022-11-18 20:11:31,539 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_66 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_63 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_66) v_aws_linked_list_back_~list.offset_BEFORE_CALL_63)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_66 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_63 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_66) v_aws_linked_list_back_~list.offset_BEFORE_CALL_63))))) is different from true [2022-11-18 20:11:39,693 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:11:46,015 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:11:52,258 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:11:58,534 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:12:04,835 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:12:11,136 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:12:17,339 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:12:23,650 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:12:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 43 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 33 not checked. [2022-11-18 20:12:23,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:29,419 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 20:12:29,419 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-18 20:12:29,439 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-18 20:12:29,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-11-18 20:12:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-11-18 20:12:29,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:12:29,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930481594] [2022-11-18 20:12:29,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930481594] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:12:29,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:12:29,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 31 [2022-11-18 20:12:29,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307135217] [2022-11-18 20:12:29,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:29,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-18 20:12:29,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:12:29,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-18 20:12:29,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=531, Unknown=8, NotChecked=306, Total=930 [2022-11-18 20:12:29,528 INFO L87 Difference]: Start difference. First operand 324 states and 379 transitions. Second operand has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 30 states have internal predecessors, (114), 7 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-11-18 20:12:37,690 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_66 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_63 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_66) v_aws_linked_list_back_~list.offset_BEFORE_CALL_63)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_66 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_63 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_66) v_aws_linked_list_back_~list.offset_BEFORE_CALL_63))))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25|))))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24|)))))) is different from true [2022-11-18 20:12:39,921 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25|))))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24|)))))) is different from true [2022-11-18 20:12:52,424 WARN L233 SmtUtils]: Spent 12.22s on a formula simplification. DAG size of input: 50 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:13:04,822 WARN L233 SmtUtils]: Spent 12.19s on a formula simplification. DAG size of input: 41 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:13:17,270 WARN L233 SmtUtils]: Spent 12.24s on a formula simplification. DAG size of input: 41 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:13:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:27,043 INFO L93 Difference]: Finished difference Result 502 states and 600 transitions. [2022-11-18 20:13:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-18 20:13:27,044 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 30 states have internal predecessors, (114), 7 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 124 [2022-11-18 20:13:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:27,046 INFO L225 Difference]: With dead ends: 502 [2022-11-18 20:13:27,046 INFO L226 Difference]: Without dead ends: 367 [2022-11-18 20:13:27,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 212 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 123.7s TimeCoverageRelationStatistics Valid=198, Invalid=1150, Unknown=16, NotChecked=616, Total=1980 [2022-11-18 20:13:27,048 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 128 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1297 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:27,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1194 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 456 Invalid, 0 Unknown, 1297 Unchecked, 2.0s Time] [2022-11-18 20:13:27,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-11-18 20:13:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 334. [2022-11-18 20:13:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 247 states have (on average 1.1133603238866396) internal successors, (275), 255 states have internal predecessors, (275), 48 states have call successors, (48), 30 states have call predecessors, (48), 38 states have return successors, (62), 48 states have call predecessors, (62), 47 states have call successors, (62) [2022-11-18 20:13:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 385 transitions. [2022-11-18 20:13:27,135 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 385 transitions. Word has length 124 [2022-11-18 20:13:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:27,136 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 385 transitions. [2022-11-18 20:13:27,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 30 states have internal predecessors, (114), 7 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-11-18 20:13:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 385 transitions. [2022-11-18 20:13:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-18 20:13:27,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:27,139 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:13:27,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:27,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:13:27,357 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:13:27,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash 672143741, now seen corresponding path program 1 times [2022-11-18 20:13:27,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:13:27,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015135222] [2022-11-18 20:13:27,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:27,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:13:27,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:13:27,359 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:13:27,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-18 20:13:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:27,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 20:13:27,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-11-18 20:13:27,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:13:27,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:13:27,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015135222] [2022-11-18 20:13:27,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015135222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:27,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:27,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 20:13:27,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262948691] [2022-11-18 20:13:27,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:27,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:13:27,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:13:27,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:13:27,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:13:27,880 INFO L87 Difference]: Start difference. First operand 334 states and 385 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-18 20:13:28,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:28,549 INFO L93 Difference]: Finished difference Result 660 states and 784 transitions. [2022-11-18 20:13:28,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:13:28,550 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2022-11-18 20:13:28,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:28,552 INFO L225 Difference]: With dead ends: 660 [2022-11-18 20:13:28,552 INFO L226 Difference]: Without dead ends: 334 [2022-11-18 20:13:28,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:13:28,554 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 80 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:28,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 849 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:13:28,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-18 20:13:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 291. [2022-11-18 20:13:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 211 states have (on average 1.09478672985782) internal successors, (231), 216 states have internal predecessors, (231), 47 states have call successors, (47), 28 states have call predecessors, (47), 32 states have return successors, (55), 46 states have call predecessors, (55), 46 states have call successors, (55) [2022-11-18 20:13:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 333 transitions. [2022-11-18 20:13:28,622 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 333 transitions. Word has length 124 [2022-11-18 20:13:28,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:28,622 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 333 transitions. [2022-11-18 20:13:28,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-18 20:13:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 333 transitions. [2022-11-18 20:13:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-18 20:13:28,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:28,624 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:28,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-11-18 20:13:28,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:13:28,824 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:13:28,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:28,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1468779738, now seen corresponding path program 1 times [2022-11-18 20:13:28,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:13:28,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074061398] [2022-11-18 20:13:28,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:28,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:13:28,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:13:28,826 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:13:28,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11f920ca-d8ae-45a5-9bac-d189bcf3299c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-18 20:13:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:29,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-18 20:13:29,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:32,695 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_77 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_69 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_77) v_aws_linked_list_back_~list.offset_BEFORE_CALL_69)) (.cse0 (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_77) v_aws_linked_list_back_~list.offset_BEFORE_CALL_69))) (let ((.cse2 (bvadd (select (select |c_#memory_$Pointer$.offset| .cse3) .cse0) (_ bv8 64))) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse3) .cse0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_77 .cse1))))) is different from true [2022-11-18 20:13:35,112 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_78 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_70 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_78) v_aws_linked_list_back_~list.offset_BEFORE_CALL_70)) (.cse2 (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_78) v_aws_linked_list_back_~list.offset_BEFORE_CALL_70))) (let ((.cse1 (bvadd (select (select |c_#memory_$Pointer$.offset| .cse3) .cse2) (_ bv8 64))) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) .cse2))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse2) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse3) (= .cse0 v_aws_linked_list_back_~list.base_BEFORE_CALL_78))))) is different from true [2022-11-18 20:13:37,599 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_79 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_71 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_79) v_aws_linked_list_back_~list.offset_BEFORE_CALL_71)) (.cse1 (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_79) v_aws_linked_list_back_~list.offset_BEFORE_CALL_71))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) .cse1)) (.cse2 (bvadd (_ bv8 64) (select (select |c_#memory_$Pointer$.offset| .cse3) .cse1)))) (and (= .cse0 v_aws_linked_list_back_~list.base_BEFORE_CALL_79) (= .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse2) .cse3))))) is different from true [2022-11-18 20:13:39,979 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_80 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_72 (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_80) v_aws_linked_list_back_~list.offset_BEFORE_CALL_72)) (.cse3 (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_80) v_aws_linked_list_back_~list.offset_BEFORE_CALL_72))) (let ((.cse2 (bvadd (select (select |c_#memory_$Pointer$.offset| .cse0) .cse3) (_ bv8 64))) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse3))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2)) (= .cse3 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) (= .cse1 v_aws_linked_list_back_~list.base_BEFORE_CALL_80))))) is different from true [2022-11-18 20:14:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 73 proven. 35 refuted. 0 times theorem prover too weak. 18 trivial. 27 not checked. [2022-11-18 20:14:24,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:15:21,234 WARN L233 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:15:34,516 WARN L233 SmtUtils]: Spent 11.81s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)