./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_front_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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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 61592663790a1842b8bd7e9befeca1c276604b90aee8701db027349608c78395 --- 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:30:44,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:30:44,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:30:44,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:30:44,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:30:44,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:30:44,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:30:44,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:30:44,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:30:44,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:30:44,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:30:44,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:30:44,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:30:44,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:30:44,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:30:44,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:30:44,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:30:44,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:30:44,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:30:44,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:30:44,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:30:44,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:30:44,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:30:44,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:30:44,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:30:44,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:30:44,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:30:44,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:30:44,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:30:44,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:30:44,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:30:44,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:30:44,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:30:44,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:30:44,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:30:44,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:30:44,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:30:44,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:30:44,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:30:44,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:30:44,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:30:44,275 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 20:30:44,295 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:30:44,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:30:44,296 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:30:44,296 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:30:44,297 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:30:44,297 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:30:44,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:30:44,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:30:44,303 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:30:44,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:30:44,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:30:44,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:30:44,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:30:44,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:30:44,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:30:44,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:30:44,305 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:30:44,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:30:44,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:30:44,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:30:44,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:30:44,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:30:44,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:30:44,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:30:44,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:30:44,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:30:44,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:30:44,308 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:30:44,309 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:30:44,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:30:44,309 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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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 -> 61592663790a1842b8bd7e9befeca1c276604b90aee8701db027349608c78395 [2022-11-18 20:30:44,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:30:44,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:30:44,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:30:44,680 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:30:44,681 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:30:44,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i [2022-11-18 20:30:44,755 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/data/6a99afd6e/9fb50d15407a4057aa89b16d4fe02fcf/FLAGb05b4ff07 [2022-11-18 20:30:45,542 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:30:45,543 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i [2022-11-18 20:30:45,588 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/data/6a99afd6e/9fb50d15407a4057aa89b16d4fe02fcf/FLAGb05b4ff07 [2022-11-18 20:30:46,103 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/data/6a99afd6e/9fb50d15407a4057aa89b16d4fe02fcf [2022-11-18 20:30:46,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:30:46,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:30:46,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:30:46,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:30:46,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:30:46,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:30:46" (1/1) ... [2022-11-18 20:30:46,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473fe754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:46, skipping insertion in model container [2022-11-18 20:30:46,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:30:46" (1/1) ... [2022-11-18 20:30:46,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:30:46,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:30:46,582 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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2022-11-18 20:30:46,589 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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2022-11-18 20:30:47,435 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:47,436 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:47,437 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:47,438 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:47,439 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:47,453 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:47,453 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:47,455 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:47,456 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:47,458 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:47,459 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:47,460 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:47,460 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:47,820 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:30:47,825 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:30:47,826 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:30:47,829 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:30:47,831 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:30:47,835 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:30:47,835 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:30:47,836 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:30:47,838 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:30:47,839 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:30:48,044 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:30:48,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:30:48,117 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:30:48,142 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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2022-11-18 20:30:48,152 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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2022-11-18 20:30:48,219 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:48,221 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:48,221 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:48,222 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:48,223 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:48,234 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:48,234 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:48,236 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:48,236 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:48,239 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:48,241 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:48,242 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:48,242 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:30:48,292 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:30:48,294 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:30:48,295 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:30:48,296 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:30:48,297 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:30:48,297 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:30:48,298 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:30:48,299 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:30:48,299 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:30:48,300 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:30:48,322 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:30:48,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:30:48,567 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:30:48,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48 WrapperNode [2022-11-18 20:30:48,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:30:48,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:30:48,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:30:48,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:30:48,577 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:30:48" (1/1) ... [2022-11-18 20:30:48,657 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:30:48" (1/1) ... [2022-11-18 20:30:48,720 INFO L138 Inliner]: procedures = 679, calls = 1044, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 133 [2022-11-18 20:30:48,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:30:48,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:30:48,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:30:48,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:30:48,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,797 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:30:48,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:30:48,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:30:48,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:30:48,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:30:48,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:30:48,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:30:48,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:30:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:30:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-18 20:30:48,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-18 20:30:48,905 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-18 20:30:48,905 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-18 20:30:48,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:30:48,906 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-18 20:30:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-18 20:30:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:30:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:30:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_front [2022-11-18 20:30:48,908 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_front [2022-11-18 20:30:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:30:48,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:30:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-11-18 20:30:48,909 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-11-18 20:30:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:30:48,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:30:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:30:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:30:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:30:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-18 20:30:48,911 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-18 20:30:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-18 20:30:48,911 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-18 20:30:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:30:49,218 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:30:49,220 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:30:49,569 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:30:49,576 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:30:49,576 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:30:49,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:30:49 BoogieIcfgContainer [2022-11-18 20:30:49,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:30:49,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:30:49,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:30:49,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:30:49,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:30:46" (1/3) ... [2022-11-18 20:30:49,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5cf295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:30:49, skipping insertion in model container [2022-11-18 20:30:49,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (2/3) ... [2022-11-18 20:30:49,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5cf295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:30:49, skipping insertion in model container [2022-11-18 20:30:49,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:30:49" (3/3) ... [2022-11-18 20:30:49,594 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_front_harness.i [2022-11-18 20:30:49,617 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:30:49,618 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:30:49,699 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:30:49,721 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;@15fbe06a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:30:49,721 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:30:49,740 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:30:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-18 20:30:49,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:49,765 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:30:49,766 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:49,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1286081961, now seen corresponding path program 1 times [2022-11-18 20:30:49,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:49,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109986969] [2022-11-18 20:30:49,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:49,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:50,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:30:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:50,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:30:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:50,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:30:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:50,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:30:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:30:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:50,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:30:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:50,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:30:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:50,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:30:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:50,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:30:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:50,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:30:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:50,536 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:30:50,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:50,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109986969] [2022-11-18 20:30:50,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109986969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:50,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:50,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:30:50,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332672962] [2022-11-18 20:30:50,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:50,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:30:50,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:50,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:30:50,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:30:50,577 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:30:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:50,654 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2022-11-18 20:30:50,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:30:50,656 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:30:50,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:50,674 INFO L225 Difference]: With dead ends: 188 [2022-11-18 20:30:50,674 INFO L226 Difference]: Without dead ends: 93 [2022-11-18 20:30:50,681 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:30:50,684 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:30:50,685 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:30:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-18 20:30:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-18 20:30:50,734 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:30:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-11-18 20:30:50,741 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 84 [2022-11-18 20:30:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:50,742 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-11-18 20:30:50,742 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:30:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-11-18 20:30:50,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-18 20:30:50,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:50,751 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:30:50,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:30:50,753 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:50,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:50,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1287183985, now seen corresponding path program 1 times [2022-11-18 20:30:50,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:50,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639514905] [2022-11-18 20:30:50,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:50,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:51,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:30:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:51,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:30:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:51,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:30:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:51,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:30:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:51,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:30:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:51,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:30:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:51,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:51,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:30:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:51,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:30:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:51,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:30:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:51,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:30:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:51,592 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:30:51,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:51,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639514905] [2022-11-18 20:30:51,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639514905] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:30:51,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655134111] [2022-11-18 20:30:51,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:51,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:30:51,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:30:51,601 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:30:51,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:30:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:51,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-18 20:30:51,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:30:52,060 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:30:52,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-18 20:30:52,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:30:52,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:30:52,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-18 20:30:52,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:30:52,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:30:52,222 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:30:53,832 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:30:53,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:30:53,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655134111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:53,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:30:53,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2022-11-18 20:30:53,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415205651] [2022-11-18 20:30:53,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:53,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:30:53,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:53,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:30:53,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:30:53,838 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:30:54,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:54,185 INFO L93 Difference]: Finished difference Result 201 states and 273 transitions. [2022-11-18 20:30:54,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:30:54,186 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:30:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:54,190 INFO L225 Difference]: With dead ends: 201 [2022-11-18 20:30:54,193 INFO L226 Difference]: Without dead ends: 142 [2022-11-18 20:30:54,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 12 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:30:54,197 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 35 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:54,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 545 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2022-11-18 20:30:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-18 20:30:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 131. [2022-11-18 20:30:54,228 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:30:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 175 transitions. [2022-11-18 20:30:54,231 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 175 transitions. Word has length 84 [2022-11-18 20:30:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:54,234 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 175 transitions. [2022-11-18 20:30:54,237 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:30:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 175 transitions. [2022-11-18 20:30:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-18 20:30:54,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:54,248 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:30:54,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:30:54,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:30:54,455 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:54,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:54,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2096530611, now seen corresponding path program 1 times [2022-11-18 20:30:54,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:54,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624423372] [2022-11-18 20:30:54,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:54,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:54,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:30:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:54,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:30:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:54,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:30:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:54,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:30:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:54,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:30:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:54,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:30:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:54,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:30:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:54,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:30:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:54,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:30:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:54,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:30:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:54,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:30:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:54,860 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:30:54,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:54,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624423372] [2022-11-18 20:30:54,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624423372] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:30:54,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253288832] [2022-11-18 20:30:54,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:54,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:30:54,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:30:54,863 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:30:54,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:30:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:55,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:30:55,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:30:55,111 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:30:55,112 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:30:55,128 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:30:55,129 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:30:57,361 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_front_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 24)) 0))) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_front_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 24)) 0)))) is different from true [2022-11-18 20:30:59,515 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 24)) 0))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 24)) 0)))) is different from true [2022-11-18 20:31:01,629 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_8 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 24)) 0))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_8 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 24)) 0)))) is different from true [2022-11-18 20:31:03,716 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_9 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_9) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 24)) 0))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_9 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_9) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 24)) 0)))) is different from true [2022-11-18 20:31:11,788 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:31:19,991 WARN L233 SmtUtils]: Spent 6.06s 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:31:28,153 WARN L233 SmtUtils]: Spent 6.03s 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:31:34,260 WARN L233 SmtUtils]: Spent 6.03s 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:31:34,298 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:31:34,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:31:37,030 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:31:37,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253288832] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:31:37,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:31:37,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16, 11] total 27 [2022-11-18 20:31:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702209268] [2022-11-18 20:31:37,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:31:37,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 20:31:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:31:37,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:31:37,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=438, Unknown=8, NotChecked=180, Total=702 [2022-11-18 20:31:37,036 INFO L87 Difference]: Start difference. First operand 131 states and 175 transitions. Second operand has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 25 states have internal predecessors, (95), 6 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-11-18 20:32:14,089 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:32:22,153 WARN L233 SmtUtils]: Spent 6.02s 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:32:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:30,684 INFO L93 Difference]: Finished difference Result 270 states and 364 transitions. [2022-11-18 20:32:30,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 20:32:30,685 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 25 states have internal predecessors, (95), 6 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 84 [2022-11-18 20:32:30,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:30,688 INFO L225 Difference]: With dead ends: 270 [2022-11-18 20:32:30,688 INFO L226 Difference]: Without dead ends: 153 [2022-11-18 20:32:30,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 166 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 93.8s TimeCoverageRelationStatistics Valid=224, Invalid=1175, Unknown=23, NotChecked=300, Total=1722 [2022-11-18 20:32:30,691 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 111 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 669 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:30,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1271 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 670 Invalid, 0 Unknown, 669 Unchecked, 0.7s Time] [2022-11-18 20:32:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-18 20:32:30,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2022-11-18 20:32:30,709 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:32:30,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2022-11-18 20:32:30,711 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 84 [2022-11-18 20:32:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:30,711 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2022-11-18 20:32:30,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 25 states have internal predecessors, (95), 6 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-11-18 20:32:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2022-11-18 20:32:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-18 20:32:30,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:30,713 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:32:30,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:30,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:30,920 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:30,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1055778647, now seen corresponding path program 1 times [2022-11-18 20:32:30,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:30,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352825250] [2022-11-18 20:32:30,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:30,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:31,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:31,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:32:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:31,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:32:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:31,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:31,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:32:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:31,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:32:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:31,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:32:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:31,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:32:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:31,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:31,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-18 20:32:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:31,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 20:32:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:31,411 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:32:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:31,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352825250] [2022-11-18 20:32:31,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352825250] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:31,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555930077] [2022-11-18 20:32:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:31,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:31,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:31,439 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:31,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:32:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:31,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:32:31,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:31,805 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:32:31,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:32:31,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555930077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:31,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:32:31,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-11-18 20:32:31,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311424143] [2022-11-18 20:32:31,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:31,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:32:31,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:31,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:32:31,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:32:31,808 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:32:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:32,144 INFO L93 Difference]: Finished difference Result 241 states and 320 transitions. [2022-11-18 20:32:32,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:32:32,145 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:32:32,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:32,147 INFO L225 Difference]: With dead ends: 241 [2022-11-18 20:32:32,147 INFO L226 Difference]: Without dead ends: 146 [2022-11-18 20:32:32,148 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:32:32,148 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.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:32,149 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.2s Time] [2022-11-18 20:32:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-18 20:32:32,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-11-18 20:32:32,167 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:32:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2022-11-18 20:32:32,169 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 88 [2022-11-18 20:32:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:32,169 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2022-11-18 20:32:32,170 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:32:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2022-11-18 20:32:32,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-18 20:32:32,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:32,172 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:32:32,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:32,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:32,379 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:32,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:32,379 INFO L85 PathProgramCache]: Analyzing trace with hash 426166840, now seen corresponding path program 1 times [2022-11-18 20:32:32,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:32,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206423588] [2022-11-18 20:32:32,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:32,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:32,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:32,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:32:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:32,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:32:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:32,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:32,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:32:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:32,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:32:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:32,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:32:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:32,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:32:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:32,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:32,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-18 20:32:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:32,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 20:32:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:32,865 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:32:32,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:32,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206423588] [2022-11-18 20:32:32,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206423588] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:32,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971125271] [2022-11-18 20:32:32,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:32,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:32,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:32,871 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:32,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:32:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:33,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 20:32:33,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:33,217 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:32:33,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:32:33,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971125271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:33,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:32:33,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2022-11-18 20:32:33,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501199769] [2022-11-18 20:32:33,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:33,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:32:33,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:33,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:32:33,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:32:33,220 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:32:33,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:33,628 INFO L93 Difference]: Finished difference Result 250 states and 334 transitions. [2022-11-18 20:32:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:32:33,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:32:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:33,630 INFO L225 Difference]: With dead ends: 250 [2022-11-18 20:32:33,630 INFO L226 Difference]: Without dead ends: 154 [2022-11-18 20:32:33,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:32:33,632 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 188 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 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.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:33,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 577 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:32:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-18 20:32:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 147. [2022-11-18 20:32:33,650 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:32:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2022-11-18 20:32:33,652 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 88 [2022-11-18 20:32:33,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:33,653 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2022-11-18 20:32:33,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:32:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2022-11-18 20:32:33,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-18 20:32:33,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:33,655 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] [2022-11-18 20:32:33,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:33,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:33,862 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:33,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:33,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1868931672, now seen corresponding path program 1 times [2022-11-18 20:32:33,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:33,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171468916] [2022-11-18 20:32:33,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:33,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:34,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:34,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:32:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:34,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:32:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:34,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:34,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:32:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:34,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:32:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:34,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-18 20:32:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:34,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 20:32:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:34,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:34,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:32:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:34,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 20:32:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:34,369 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:32:34,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:34,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171468916] [2022-11-18 20:32:34,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171468916] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:34,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812927799] [2022-11-18 20:32:34,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:34,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:34,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:34,375 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:34,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:32:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:34,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:32:34,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-18 20:32:34,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:32:34,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812927799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:34,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:32:34,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-18 20:32:34,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48554173] [2022-11-18 20:32:34,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:34,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:32:34,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:34,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:32:34,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:32:34,600 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:32:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:34,630 INFO L93 Difference]: Finished difference Result 246 states and 330 transitions. [2022-11-18 20:32:34,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:32:34,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 91 [2022-11-18 20:32:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:34,634 INFO L225 Difference]: With dead ends: 246 [2022-11-18 20:32:34,634 INFO L226 Difference]: Without dead ends: 153 [2022-11-18 20:32:34,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 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:32:34,639 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:32:34,639 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:32:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-18 20:32:34,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2022-11-18 20:32:34,697 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:32:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2022-11-18 20:32:34,699 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 91 [2022-11-18 20:32:34,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:34,701 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2022-11-18 20:32:34,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:32:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2022-11-18 20:32:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-18 20:32:34,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:34,704 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:32:34,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:34,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:34,905 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:34,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:34,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2072143320, now seen corresponding path program 1 times [2022-11-18 20:32:34,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:34,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210238114] [2022-11-18 20:32:34,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:34,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:32:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:32:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:32:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:32:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:32:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-18 20:32:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:32:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 20:32:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-18 20:32:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,385 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:32:35,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:35,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210238114] [2022-11-18 20:32:35,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210238114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:35,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126809918] [2022-11-18 20:32:35,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:35,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:35,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:35,387 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:35,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:32:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:35,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-18 20:32:35,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:35,644 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:32:35,644 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:32:35,663 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:32:35,663 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:32:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:32:36,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:37,284 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:32:37,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126809918] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:37,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:37,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 21 [2022-11-18 20:32:37,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383089804] [2022-11-18 20:32:37,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:37,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 20:32:37,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:37,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:32:37,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:32:37,288 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand has 21 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 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:32:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:38,070 INFO L93 Difference]: Finished difference Result 262 states and 340 transitions. [2022-11-18 20:32:38,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:32:38,071 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 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 97 [2022-11-18 20:32:38,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:38,073 INFO L225 Difference]: With dead ends: 262 [2022-11-18 20:32:38,073 INFO L226 Difference]: Without dead ends: 166 [2022-11-18 20:32:38,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 201 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2022-11-18 20:32:38,076 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 114 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:38,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1248 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 334 Invalid, 0 Unknown, 71 Unchecked, 0.3s Time] [2022-11-18 20:32:38,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-18 20:32:38,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 159. [2022-11-18 20:32:38,100 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:32:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 202 transitions. [2022-11-18 20:32:38,102 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 202 transitions. Word has length 97 [2022-11-18 20:32:38,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:38,102 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 202 transitions. [2022-11-18 20:32:38,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 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:32:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-11-18 20:32:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-18 20:32:38,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:38,105 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:32:38,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:38,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-18 20:32:38,311 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:38,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:38,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1222210787, now seen corresponding path program 1 times [2022-11-18 20:32:38,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:38,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7726382] [2022-11-18 20:32:38,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:38,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:32:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:32:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:32:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:32:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:38,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:32:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:32:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:32:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:32:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:32:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,067 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:32:39,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:39,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7726382] [2022-11-18 20:32:39,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7726382] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:39,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563860329] [2022-11-18 20:32:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:39,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:39,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:39,069 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:39,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:32:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:39,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:32:39,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:39,345 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:32:39,346 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:32:39,360 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:32:39,361 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:32:40,523 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:32:40,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:41,214 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:32:41,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563860329] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:41,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:41,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 11] total 26 [2022-11-18 20:32:41,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421635087] [2022-11-18 20:32:41,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:41,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-18 20:32:41,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:41,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-18 20:32:41,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2022-11-18 20:32:41,217 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:32:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:43,596 INFO L93 Difference]: Finished difference Result 397 states and 543 transitions. [2022-11-18 20:32:43,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-18 20:32:43,601 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:32:43,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:43,602 INFO L225 Difference]: With dead ends: 397 [2022-11-18 20:32:43,603 INFO L226 Difference]: Without dead ends: 292 [2022-11-18 20:32:43,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 219 SyntacticMatches, 15 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=438, Invalid=1914, Unknown=0, NotChecked=0, Total=2352 [2022-11-18 20:32:43,604 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 337 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:43,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 2084 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 993 Invalid, 0 Unknown, 263 Unchecked, 1.0s Time] [2022-11-18 20:32:43,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-18 20:32:43,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 243. [2022-11-18 20:32:43,643 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:32:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 319 transitions. [2022-11-18 20:32:43,645 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 319 transitions. Word has length 101 [2022-11-18 20:32:43,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:43,647 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 319 transitions. [2022-11-18 20:32:43,647 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:32:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 319 transitions. [2022-11-18 20:32:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-18 20:32:43,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:43,649 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:32:43,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:43,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-18 20:32:43,856 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:43,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash -853016413, now seen corresponding path program 1 times [2022-11-18 20:32:43,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:43,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670489521] [2022-11-18 20:32:43,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:43,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:43,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:43,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:32:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:43,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:32:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:32:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:32:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:32:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:32:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:32:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:32:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:32:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,099 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:32:44,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:44,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670489521] [2022-11-18 20:32:44,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670489521] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:44,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874118148] [2022-11-18 20:32:44,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:44,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:44,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:44,102 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:44,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:32:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:32:44,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:44,347 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:32:44,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:32:44,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874118148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:44,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:32:44,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-18 20:32:44,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159202504] [2022-11-18 20:32:44,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:44,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:32:44,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:44,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:32:44,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:32:44,351 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:32:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:44,395 INFO L93 Difference]: Finished difference Result 390 states and 520 transitions. [2022-11-18 20:32:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:32:44,395 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:32:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:44,398 INFO L225 Difference]: With dead ends: 390 [2022-11-18 20:32:44,398 INFO L226 Difference]: Without dead ends: 238 [2022-11-18 20:32:44,399 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:32:44,401 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:32:44,402 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:32:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-18 20:32:44,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2022-11-18 20:32:44,424 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:32:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 308 transitions. [2022-11-18 20:32:44,429 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 308 transitions. Word has length 101 [2022-11-18 20:32:44,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:44,429 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 308 transitions. [2022-11-18 20:32:44,429 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:32:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 308 transitions. [2022-11-18 20:32:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-18 20:32:44,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:44,432 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:32:44,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:44,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:44,639 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:44,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:44,640 INFO L85 PathProgramCache]: Analyzing trace with hash -550482073, now seen corresponding path program 1 times [2022-11-18 20:32:44,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:44,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384742329] [2022-11-18 20:32:44,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:44,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:32:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:32:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:32:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:32:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:32:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:32:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:32:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:32:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:32:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-18 20:32:44,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:44,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384742329] [2022-11-18 20:32:44,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384742329] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:44,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113854202] [2022-11-18 20:32:44,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:44,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:44,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:44,871 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:44,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:32:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:45,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:32:45,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-18 20:32:45,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:32:45,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113854202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:45,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:32:45,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-18 20:32:45,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843902734] [2022-11-18 20:32:45,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:45,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:32:45,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:45,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:32:45,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:32:45,126 INFO L87 Difference]: Start difference. First operand 238 states and 308 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:32:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:45,161 INFO L93 Difference]: Finished difference Result 328 states and 431 transitions. [2022-11-18 20:32:45,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:32:45,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:32:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:45,164 INFO L225 Difference]: With dead ends: 328 [2022-11-18 20:32:45,164 INFO L226 Difference]: Without dead ends: 168 [2022-11-18 20:32:45,165 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:32:45,166 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:32:45,167 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:32:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-18 20:32:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 162. [2022-11-18 20:32:45,184 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:32:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2022-11-18 20:32:45,185 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 200 transitions. Word has length 101 [2022-11-18 20:32:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:45,186 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 200 transitions. [2022-11-18 20:32:45,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:32:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2022-11-18 20:32:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-18 20:32:45,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:45,190 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] [2022-11-18 20:32:45,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:45,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:45,401 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:45,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:45,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1237588355, now seen corresponding path program 1 times [2022-11-18 20:32:45,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:45,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532017417] [2022-11-18 20:32:45,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:45,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:45,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:32:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:45,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:32:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:45,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:45,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:32:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:45,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:32:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:46,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:32:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:46,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:32:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:46,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:32:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:46,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:46,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:32:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:46,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 20:32:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-18 20:32:46,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:46,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532017417] [2022-11-18 20:32:46,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532017417] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:46,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809069475] [2022-11-18 20:32:46,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:46,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:46,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:46,273 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:46,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:32:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:46,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-18 20:32:46,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:46,621 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:32:46,621 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:32:47,832 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:32:47,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:48,590 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 236 treesize of output 220 [2022-11-18 20:32:48,595 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 220 treesize of output 212 [2022-11-18 20:32:48,600 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 212 treesize of output 196 [2022-11-18 20:32:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-18 20:32:48,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809069475] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:48,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:48,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 38 [2022-11-18 20:32:48,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146857523] [2022-11-18 20:32:48,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:48,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-18 20:32:48,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:48,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-18 20:32:48,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1273, Unknown=0, NotChecked=0, Total=1406 [2022-11-18 20:32:48,775 INFO L87 Difference]: Start difference. First operand 162 states and 200 transitions. Second operand has 38 states, 35 states have (on average 3.342857142857143) internal successors, (117), 35 states have internal predecessors, (117), 15 states have call successors, (31), 6 states have call predecessors, (31), 7 states have return successors, (27), 12 states have call predecessors, (27), 14 states have call successors, (27) [2022-11-18 20:32:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:51,207 INFO L93 Difference]: Finished difference Result 418 states and 523 transitions. [2022-11-18 20:32:51,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-18 20:32:51,208 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 3.342857142857143) internal successors, (117), 35 states have internal predecessors, (117), 15 states have call successors, (31), 6 states have call predecessors, (31), 7 states have return successors, (27), 12 states have call predecessors, (27), 14 states have call successors, (27) Word has length 100 [2022-11-18 20:32:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:51,210 INFO L225 Difference]: With dead ends: 418 [2022-11-18 20:32:51,211 INFO L226 Difference]: Without dead ends: 330 [2022-11-18 20:32:51,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 193 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=409, Invalid=3373, Unknown=0, NotChecked=0, Total=3782 [2022-11-18 20:32:51,213 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 726 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:51,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 2344 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 1597 Invalid, 0 Unknown, 150 Unchecked, 1.5s Time] [2022-11-18 20:32:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-11-18 20:32:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 248. [2022-11-18 20:32:51,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 179 states have (on average 1.1955307262569832) internal successors, (214), 183 states have internal predecessors, (214), 43 states have call successors, (43), 24 states have call predecessors, (43), 25 states have return successors, (50), 40 states have call predecessors, (50), 42 states have call successors, (50) [2022-11-18 20:32:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 307 transitions. [2022-11-18 20:32:51,243 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 307 transitions. Word has length 100 [2022-11-18 20:32:51,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:51,244 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 307 transitions. [2022-11-18 20:32:51,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 3.342857142857143) internal successors, (117), 35 states have internal predecessors, (117), 15 states have call successors, (31), 6 states have call predecessors, (31), 7 states have return successors, (27), 12 states have call predecessors, (27), 14 states have call successors, (27) [2022-11-18 20:32:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 307 transitions. [2022-11-18 20:32:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-18 20:32:51,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:51,248 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] [2022-11-18 20:32:51,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:51,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:51,455 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:51,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash 226471105, now seen corresponding path program 1 times [2022-11-18 20:32:51,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:51,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765684474] [2022-11-18 20:32:51,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:51,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:32:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:32:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:32:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:32:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:32:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:32:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:32:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:32:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 20:32:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-18 20:32:51,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:51,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765684474] [2022-11-18 20:32:51,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765684474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:51,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:32:51,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:32:51,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576315188] [2022-11-18 20:32:51,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:51,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:32:51,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:51,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:32:51,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:32:51,766 INFO L87 Difference]: Start difference. First operand 248 states and 307 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:32:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:51,888 INFO L93 Difference]: Finished difference Result 517 states and 650 transitions. [2022-11-18 20:32:51,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:32:51,889 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 100 [2022-11-18 20:32:51,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:51,891 INFO L225 Difference]: With dead ends: 517 [2022-11-18 20:32:51,891 INFO L226 Difference]: Without dead ends: 241 [2022-11-18 20:32:51,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:32:51,893 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 39 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:51,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 673 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:32:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-18 20:32:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-11-18 20:32:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 172 states have (on average 1.1744186046511629) internal successors, (202), 176 states have internal predecessors, (202), 43 states have call successors, (43), 24 states have call predecessors, (43), 25 states have return successors, (50), 40 states have call predecessors, (50), 42 states have call successors, (50) [2022-11-18 20:32:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 295 transitions. [2022-11-18 20:32:51,923 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 295 transitions. Word has length 100 [2022-11-18 20:32:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:51,923 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 295 transitions. [2022-11-18 20:32:51,923 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:32:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 295 transitions. [2022-11-18 20:32:51,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-18 20:32:51,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:51,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:51,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:32:51,927 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:51,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:51,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1093244626, now seen corresponding path program 1 times [2022-11-18 20:32:51,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:51,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661079255] [2022-11-18 20:32:51,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:51,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:32:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:32:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:32:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:32:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:32:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:32:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 20:32:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:32:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:32:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-18 20:32:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,623 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:32:52,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:52,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661079255] [2022-11-18 20:32:52,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661079255] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:52,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527771501] [2022-11-18 20:32:52,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:52,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:52,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:52,625 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:52,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:32:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:52,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-18 20:32:52,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-18 20:32:53,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:32:53,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527771501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:32:53,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:32:53,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 13 [2022-11-18 20:32:53,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825631427] [2022-11-18 20:32:53,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:32:53,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:32:53,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:53,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:32:53,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:32:53,227 INFO L87 Difference]: Start difference. First operand 241 states and 295 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-18 20:32:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:53,493 INFO L93 Difference]: Finished difference Result 421 states and 528 transitions. [2022-11-18 20:32:53,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:32:53,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2022-11-18 20:32:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:53,496 INFO L225 Difference]: With dead ends: 421 [2022-11-18 20:32:53,497 INFO L226 Difference]: Without dead ends: 275 [2022-11-18 20:32:53,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:32:53,498 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 20 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:53,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 796 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 84 Unchecked, 0.1s Time] [2022-11-18 20:32:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-18 20:32:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 253. [2022-11-18 20:32:53,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 182 states have (on average 1.1813186813186813) internal successors, (215), 187 states have internal predecessors, (215), 43 states have call successors, (43), 24 states have call predecessors, (43), 27 states have return successors, (54), 41 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-18 20:32:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 312 transitions. [2022-11-18 20:32:53,528 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 312 transitions. Word has length 110 [2022-11-18 20:32:53,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:53,528 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 312 transitions. [2022-11-18 20:32:53,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-18 20:32:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 312 transitions. [2022-11-18 20:32:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-18 20:32:53,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:53,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:53,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:53,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:53,738 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:53,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1262560624, now seen corresponding path program 1 times [2022-11-18 20:32:53,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:53,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97469407] [2022-11-18 20:32:53,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:53,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:32:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:32:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:32:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:32:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:32:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:32:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:32:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 20:32:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:32:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:32:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:32:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-18 20:32:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-18 20:32:54,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:54,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97469407] [2022-11-18 20:32:54,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97469407] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:54,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852380157] [2022-11-18 20:32:54,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:54,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:54,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:54,592 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:54,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:32:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:54,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-18 20:32:54,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:54,924 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:32:54,924 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:32:54,939 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:32:54,940 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:32:57,149 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) 0)))) is different from true [2022-11-18 20:32:59,235 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|) 0)))) is different from true [2022-11-18 20:33:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 7 not checked. [2022-11-18 20:33:00,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:33:00,971 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:33:00,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852380157] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:33:00,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:33:00,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 11] total 29 [2022-11-18 20:33:00,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444807050] [2022-11-18 20:33:00,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:33:00,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:33:00,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:33:00,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:33:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=620, Unknown=2, NotChecked=102, Total=812 [2022-11-18 20:33:00,974 INFO L87 Difference]: Start difference. First operand 253 states and 312 transitions. Second operand has 29 states, 28 states have (on average 4.0) internal successors, (112), 28 states have internal predecessors, (112), 10 states have call successors, (27), 6 states have call predecessors, (27), 7 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2022-11-18 20:33:03,339 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|) 0)))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) 0))))) is different from true [2022-11-18 20:33:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:03,936 INFO L93 Difference]: Finished difference Result 372 states and 469 transitions. [2022-11-18 20:33:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 20:33:03,937 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.0) internal successors, (112), 28 states have internal predecessors, (112), 10 states have call successors, (27), 6 states have call predecessors, (27), 7 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) Word has length 110 [2022-11-18 20:33:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:03,939 INFO L225 Difference]: With dead ends: 372 [2022-11-18 20:33:03,940 INFO L226 Difference]: Without dead ends: 272 [2022-11-18 20:33:03,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 224 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=235, Invalid=1496, Unknown=3, NotChecked=246, Total=1980 [2022-11-18 20:33:03,941 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 139 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:33:03,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1665 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 462 Invalid, 0 Unknown, 459 Unchecked, 0.4s Time] [2022-11-18 20:33:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-18 20:33:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 242. [2022-11-18 20:33:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 172 states have (on average 1.186046511627907) internal successors, (204), 177 states have internal predecessors, (204), 43 states have call successors, (43), 23 states have call predecessors, (43), 26 states have return successors, (53), 41 states have call predecessors, (53), 42 states have call successors, (53) [2022-11-18 20:33:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 300 transitions. [2022-11-18 20:33:03,972 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 300 transitions. Word has length 110 [2022-11-18 20:33:03,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:03,973 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 300 transitions. [2022-11-18 20:33:03,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.0) internal successors, (112), 28 states have internal predecessors, (112), 10 states have call successors, (27), 6 states have call predecessors, (27), 7 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2022-11-18 20:33:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 300 transitions. [2022-11-18 20:33:03,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-18 20:33:03,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:03,975 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:33:03,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-18 20:33:04,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:33:04,182 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:04,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:04,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1963183712, now seen corresponding path program 1 times [2022-11-18 20:33:04,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:04,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040442094] [2022-11-18 20:33:04,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:04,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:05,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:33:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:05,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:33:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:05,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:33:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:05,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:33:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:05,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:33:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:05,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:33:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:05,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:33:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:05,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 20:33:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:05,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:33:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:05,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:33:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:05,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:33:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:05,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 20:33:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:05,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:33:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-18 20:33:05,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:05,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040442094] [2022-11-18 20:33:05,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040442094] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:33:05,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966873917] [2022-11-18 20:33:05,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:05,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:33:05,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:33:05,823 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:33:05,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 20:33:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:06,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-18 20:33:06,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:33:06,208 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:33:06,212 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:33:06,219 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:33:06,222 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:33:09,986 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:33:09,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:33:23,738 WARN L233 SmtUtils]: Spent 10.05s 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:33:35,968 WARN L233 SmtUtils]: Spent 10.08s 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:33:37,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:37,928 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 3578 treesize of output 3242 [2022-11-18 20:33:38,240 INFO L321 Elim1Store]: treesize reduction 8, result has 95.2 percent of original size [2022-11-18 20:33:38,241 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 44375 treesize of output 41309 [2022-11-18 20:33:38,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:38,985 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 48552 treesize of output 47150 [2022-11-18 20:33:42,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:42,105 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 44633 treesize of output 44005 [2022-11-18 20:33:42,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:42,621 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 45166 treesize of output 45028 [2022-11-18 20:33:43,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:33:43,617 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 44734 treesize of output 44707 [2022-11-18 20:34:26,659 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-18 20:34:26,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:26,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 20:34:26,861 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:34:26,865 INFO L158 Benchmark]: Toolchain (without parser) took 220751.29ms. Allocated memory was 125.8MB in the beginning and 885.0MB in the end (delta: 759.2MB). Free memory was 79.0MB in the beginning and 594.4MB in the end (delta: -515.4MB). Peak memory consumption was 537.6MB. Max. memory is 16.1GB. [2022-11-18 20:34:26,865 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 125.8MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:34:26,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2449.26ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 78.9MB in the beginning and 72.2MB in the end (delta: 6.6MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2022-11-18 20:34:26,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 151.20ms. Allocated memory is still 163.6MB. Free memory was 72.2MB in the beginning and 66.7MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 20:34:26,866 INFO L158 Benchmark]: Boogie Preprocessor took 98.27ms. Allocated memory is still 163.6MB. Free memory was 66.7MB in the beginning and 126.8MB in the end (delta: -60.2MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-11-18 20:34:26,867 INFO L158 Benchmark]: RCFGBuilder took 758.18ms. Allocated memory is still 163.6MB. Free memory was 126.8MB in the beginning and 100.6MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-18 20:34:26,867 INFO L158 Benchmark]: TraceAbstraction took 217284.30ms. Allocated memory was 163.6MB in the beginning and 885.0MB in the end (delta: 721.4MB). Free memory was 99.6MB in the beginning and 594.4MB in the end (delta: -494.8MB). Peak memory consumption was 522.3MB. Max. memory is 16.1GB. [2022-11-18 20:34:26,869 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 125.8MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2449.26ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 78.9MB in the beginning and 72.2MB in the end (delta: 6.6MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 151.20ms. Allocated memory is still 163.6MB. Free memory was 72.2MB in the beginning and 66.7MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.27ms. Allocated memory is still 163.6MB. Free memory was 66.7MB in the beginning and 126.8MB in the end (delta: -60.2MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * RCFGBuilder took 758.18ms. Allocated memory is still 163.6MB. Free memory was 126.8MB in the beginning and 100.6MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 217284.30ms. Allocated memory was 163.6MB in the beginning and 885.0MB in the end (delta: 721.4MB). Free memory was 99.6MB in the beginning and 594.4MB in the end (delta: -494.8MB). Peak memory consumption was 522.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:34:26,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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 61592663790a1842b8bd7e9befeca1c276604b90aee8701db027349608c78395 --- 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:34:29,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:34:29,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:34:29,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:34:29,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:34:29,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:34:29,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:34:29,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:34:29,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:34:29,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:34:29,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:34:29,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:34:29,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:34:29,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:34:29,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:34:29,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:34:29,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:34:29,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:34:29,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:34:29,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:34:29,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:34:29,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:34:29,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:34:29,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:34:29,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:34:29,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:34:29,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:34:29,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:34:29,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:34:29,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:34:29,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:34:29,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:34:29,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:34:29,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:34:29,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:34:29,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:34:29,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:34:29,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:34:29,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:34:29,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:34:29,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:34:29,342 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-18 20:34:29,376 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:34:29,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:34:29,379 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:34:29,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:34:29,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:34:29,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:34:29,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:34:29,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:34:29,382 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:34:29,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:34:29,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:34:29,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:34:29,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:34:29,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:34:29,384 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:34:29,384 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:34:29,385 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:34:29,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:34:29,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:34:29,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:34:29,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:34:29,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:34:29,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:34:29,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:34:29,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:34:29,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:34:29,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:34:29,387 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:34:29,388 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:34:29,388 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:34:29,388 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:34:29,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:34:29,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:34:29,389 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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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 -> 61592663790a1842b8bd7e9befeca1c276604b90aee8701db027349608c78395 [2022-11-18 20:34:29,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:34:29,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:34:29,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:34:29,806 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:34:29,808 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:34:29,810 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i [2022-11-18 20:34:29,888 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/data/7f8010c13/06b54e3c46a944b28d71c9a86955ca30/FLAG25cd6afb5 [2022-11-18 20:34:30,773 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:34:30,774 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i [2022-11-18 20:34:30,817 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/data/7f8010c13/06b54e3c46a944b28d71c9a86955ca30/FLAG25cd6afb5 [2022-11-18 20:34:30,840 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/data/7f8010c13/06b54e3c46a944b28d71c9a86955ca30 [2022-11-18 20:34:30,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:34:30,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:34:30,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:34:30,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:34:30,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:34:30,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:30" (1/1) ... [2022-11-18 20:34:30,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd499ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30, skipping insertion in model container [2022-11-18 20:34:30,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:30" (1/1) ... [2022-11-18 20:34:30,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:34:30,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:34:31,320 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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2022-11-18 20:34:31,328 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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2022-11-18 20:34:32,429 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:32,430 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:32,432 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:32,433 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:32,436 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:32,462 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:32,470 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:32,473 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:32,475 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:32,480 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:32,482 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:32,483 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:32,484 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:32,846 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:34:32,847 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:34:32,848 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:34:32,850 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:34:32,851 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:34:32,852 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:34:32,852 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:34:32,853 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:34:32,854 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:34:32,854 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:34:32,995 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:34:33,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:34:33,058 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-18 20:34:33,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:34:33,120 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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2022-11-18 20:34:33,120 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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2022-11-18 20:34:33,189 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,189 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,190 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,190 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,191 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,203 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,204 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,208 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,209 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,211 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,212 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,212 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,212 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,281 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:34:33,283 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:34:33,283 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:34:33,286 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:34:33,292 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:34:33,293 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:34:33,294 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:34:33,295 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:34:33,295 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:34:33,296 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:34:33,334 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:34:33,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:34:33,393 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:34:33,419 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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2022-11-18 20:34:33,420 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_d8b04015-1d2d-4a3b-914c-89a3369a51f6/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2022-11-18 20:34:33,463 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,463 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,464 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,464 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,465 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,470 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,470 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,471 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,472 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,473 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,473 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,474 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,474 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:34:33,500 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:34:33,501 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:34:33,502 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:34:33,502 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:34:33,503 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:34:33,503 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:34:33,504 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:34:33,504 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:34:33,505 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:34:33,505 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:34:33,553 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:34:33,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:34:33,787 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:34:33,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:33 WrapperNode [2022-11-18 20:34:33,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:34:33,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:34:33,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:34:33,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:34:33,796 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:34:33" (1/1) ... [2022-11-18 20:34:33,872 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:34:33" (1/1) ... [2022-11-18 20:34:33,917 INFO L138 Inliner]: procedures = 698, calls = 1044, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 134 [2022-11-18 20:34:33,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:34:33,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:34:33,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:34:33,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:34:33,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:33" (1/1) ... [2022-11-18 20:34:33,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:33" (1/1) ... [2022-11-18 20:34:33,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:33" (1/1) ... [2022-11-18 20:34:33,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:33" (1/1) ... [2022-11-18 20:34:33,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:33" (1/1) ... [2022-11-18 20:34:33,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:33" (1/1) ... [2022-11-18 20:34:33,977 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:33" (1/1) ... [2022-11-18 20:34:33,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:33" (1/1) ... [2022-11-18 20:34:33,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:34:33,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:34:33,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:34:33,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:34:33,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:33" (1/1) ... [2022-11-18 20:34:34,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:34:34,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:34,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:34:34,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:34:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:34:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:34:34,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-18 20:34:34,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-18 20:34:34,070 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-18 20:34:34,070 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-18 20:34:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:34:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-18 20:34:34,072 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-18 20:34:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:34:34,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:34:34,073 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_front [2022-11-18 20:34:34,073 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_front [2022-11-18 20:34:34,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:34:34,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:34:34,074 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-11-18 20:34:34,074 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-11-18 20:34:34,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:34:34,074 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:34:34,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:34:34,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:34:34,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:34:34,075 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-18 20:34:34,075 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-18 20:34:34,075 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-18 20:34:34,075 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-18 20:34:34,419 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:34:34,421 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:34:34,857 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:34:34,865 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:34:34,865 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:34:34,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:34 BoogieIcfgContainer [2022-11-18 20:34:34,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:34:34,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:34:34,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:34:34,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:34:34,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:34:30" (1/3) ... [2022-11-18 20:34:34,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b989b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:34, skipping insertion in model container [2022-11-18 20:34:34,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:33" (2/3) ... [2022-11-18 20:34:34,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b989b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:34, skipping insertion in model container [2022-11-18 20:34:34,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:34" (3/3) ... [2022-11-18 20:34:34,878 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_front_harness.i [2022-11-18 20:34:34,897 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:34:34,898 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:34:34,963 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:34:34,975 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;@46a9daa8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:34:34,982 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:34:34,986 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:34:34,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-18 20:34:34,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:34,999 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:34:35,000 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:35,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:35,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1286081961, now seen corresponding path program 1 times [2022-11-18 20:34:35,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:34:35,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597082911] [2022-11-18 20:34:35,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:35,023 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:34:35,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:34:35,028 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:35,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 20:34:35,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:35,468 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:34:35,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:35,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:34:35,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597082911] [2022-11-18 20:34:35,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597082911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:35,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:35,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:34:35,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143559392] [2022-11-18 20:34:35,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:35,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:34:35,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:34:35,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:34:35,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:34:35,511 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:34:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:35,552 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2022-11-18 20:34:35,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:34:35,555 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:34:35,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:35,567 INFO L225 Difference]: With dead ends: 188 [2022-11-18 20:34:35,568 INFO L226 Difference]: Without dead ends: 93 [2022-11-18 20:34:35,577 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:34:35,584 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:34:35,588 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:34:35,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-18 20:34:35,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-18 20:34:35,676 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:34:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-11-18 20:34:35,693 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 84 [2022-11-18 20:34:35,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:35,694 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-11-18 20:34:35,694 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:34:35,698 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-11-18 20:34:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-18 20:34:35,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:35,702 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:34:35,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:35,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:35,917 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:35,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:35,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1287183985, now seen corresponding path program 1 times [2022-11-18 20:34:35,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:34:35,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485588183] [2022-11-18 20:34:35,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:35,919 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:34:35,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:34:35,921 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:35,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:34:36,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:36,339 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:34:36,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:36,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:34:36,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485588183] [2022-11-18 20:34:36,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485588183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:36,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:36,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:34:36,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118378468] [2022-11-18 20:34:36,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:36,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:34:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:34:36,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:34:36,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:34:36,344 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:34:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:36,450 INFO L93 Difference]: Finished difference Result 169 states and 224 transitions. [2022-11-18 20:34:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:34:36,450 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:34:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:36,453 INFO L225 Difference]: With dead ends: 169 [2022-11-18 20:34:36,454 INFO L226 Difference]: Without dead ends: 95 [2022-11-18 20:34:36,454 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:34:36,455 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:34:36,456 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:34:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-18 20:34:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-18 20:34:36,467 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:34:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2022-11-18 20:34:36,470 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 84 [2022-11-18 20:34:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:36,470 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2022-11-18 20:34:36,471 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:34:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2022-11-18 20:34:36,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-18 20:34:36,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:36,473 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:34:36,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:36,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:36,697 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:36,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:36,707 INFO L85 PathProgramCache]: Analyzing trace with hash 415994251, now seen corresponding path program 1 times [2022-11-18 20:34:36,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:34:36,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410771661] [2022-11-18 20:34:36,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:36,709 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:34:36,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:34:36,711 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:36,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:37,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:34:37,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:37,187 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:34:37,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:37,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:34:37,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410771661] [2022-11-18 20:34:37,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410771661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:37,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:37,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:34:37,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603319506] [2022-11-18 20:34:37,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:37,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:34:37,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:34:37,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:34:37,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:34:37,193 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:34:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:37,561 INFO L93 Difference]: Finished difference Result 174 states and 231 transitions. [2022-11-18 20:34:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:34:37,562 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:34:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:37,563 INFO L225 Difference]: With dead ends: 174 [2022-11-18 20:34:37,563 INFO L226 Difference]: Without dead ends: 95 [2022-11-18 20:34:37,564 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:34:37,565 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 50 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:37,565 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.3s Time] [2022-11-18 20:34:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-18 20:34:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-18 20:34:37,578 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:34:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2022-11-18 20:34:37,579 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 86 [2022-11-18 20:34:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:37,580 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2022-11-18 20:34:37,580 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:34:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2022-11-18 20:34:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-18 20:34:37,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:37,582 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:34:37,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:37,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:37,798 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:37,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:37,799 INFO L85 PathProgramCache]: Analyzing trace with hash 426166840, now seen corresponding path program 1 times [2022-11-18 20:34:37,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:34:37,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905754995] [2022-11-18 20:34:37,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:37,800 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:34:37,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:34:37,802 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:37,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:34:38,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:38,236 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:34:38,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:38,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:34:38,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905754995] [2022-11-18 20:34:38,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905754995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:38,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:38,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:34:38,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376563087] [2022-11-18 20:34:38,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:38,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:34:38,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:34:38,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:34:38,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:34:38,238 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:34:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:38,698 INFO L93 Difference]: Finished difference Result 183 states and 244 transitions. [2022-11-18 20:34:38,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:34:38,699 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:34:38,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:38,701 INFO L225 Difference]: With dead ends: 183 [2022-11-18 20:34:38,701 INFO L226 Difference]: Without dead ends: 103 [2022-11-18 20:34:38,701 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:34:38,702 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.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:38,703 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.3s Time] [2022-11-18 20:34:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-18 20:34:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2022-11-18 20:34:38,715 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:34:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2022-11-18 20:34:38,717 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 88 [2022-11-18 20:34:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:38,717 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2022-11-18 20:34:38,717 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:34:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2022-11-18 20:34:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-18 20:34:38,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:38,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] [2022-11-18 20:34:38,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:38,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:38,947 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:38,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash 134211126, now seen corresponding path program 1 times [2022-11-18 20:34:38,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:34:38,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790352977] [2022-11-18 20:34:38,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:38,949 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:34:38,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:34:38,950 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:38,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:39,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:34:39,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:39,391 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:34:39,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:39,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:34:39,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790352977] [2022-11-18 20:34:39,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790352977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:39,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:39,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:34:39,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086811597] [2022-11-18 20:34:39,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:39,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:34:39,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:34:39,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:34:39,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:34:39,396 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:34:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:39,774 INFO L93 Difference]: Finished difference Result 179 states and 240 transitions. [2022-11-18 20:34:39,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:34:39,775 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:34:39,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:39,776 INFO L225 Difference]: With dead ends: 179 [2022-11-18 20:34:39,776 INFO L226 Difference]: Without dead ends: 102 [2022-11-18 20:34:39,777 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:34:39,778 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 56 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:39,778 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.3s Time] [2022-11-18 20:34:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-18 20:34:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-11-18 20:34:39,796 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:34:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2022-11-18 20:34:39,797 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 89 [2022-11-18 20:34:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:39,798 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2022-11-18 20:34:39,798 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:34:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2022-11-18 20:34:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-18 20:34:39,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:39,801 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:34:39,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:40,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:40,017 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:40,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:40,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2072143320, now seen corresponding path program 1 times [2022-11-18 20:34:40,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:34:40,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721132305] [2022-11-18 20:34:40,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:40,019 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:34:40,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:34:40,020 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:40,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:34:40,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:40,368 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:34:40,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:40,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:34:40,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721132305] [2022-11-18 20:34:40,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721132305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:40,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:40,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:34:40,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424932092] [2022-11-18 20:34:40,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:40,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:34:40,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:34:40,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:34:40,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:34:40,374 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:34:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:40,504 INFO L93 Difference]: Finished difference Result 178 states and 233 transitions. [2022-11-18 20:34:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:34:40,506 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:34:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:40,507 INFO L225 Difference]: With dead ends: 178 [2022-11-18 20:34:40,507 INFO L226 Difference]: Without dead ends: 100 [2022-11-18 20:34:40,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:34:40,509 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:34:40,509 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:34:40,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-18 20:34:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-11-18 20:34:40,537 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:34:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2022-11-18 20:34:40,540 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 97 [2022-11-18 20:34:40,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:40,540 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2022-11-18 20:34:40,540 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:34:40,541 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2022-11-18 20:34:40,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-18 20:34:40,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:40,546 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:34:40,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:40,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:40,760 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:40,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:40,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1447444667, now seen corresponding path program 1 times [2022-11-18 20:34:40,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:34:40,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153063606] [2022-11-18 20:34:40,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:40,762 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:34:40,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:34:40,762 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:40,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:41,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:34:41,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:43,585 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:34:43,963 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:34:43,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:34:44,465 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:34:44,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:34:44,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153063606] [2022-11-18 20:34:44,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153063606] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:34:44,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:34:44,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2022-11-18 20:34:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089112166] [2022-11-18 20:34:44,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:34:44,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 20:34:44,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:34:44,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 20:34:44,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2022-11-18 20:34:44,469 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:34:45,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:45,992 INFO L93 Difference]: Finished difference Result 248 states and 342 transitions. [2022-11-18 20:34:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:34:45,995 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:34:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:45,997 INFO L225 Difference]: With dead ends: 248 [2022-11-18 20:34:45,997 INFO L226 Difference]: Without dead ends: 169 [2022-11-18 20:34:45,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=105, Invalid=360, Unknown=1, NotChecked=40, Total=506 [2022-11-18 20:34:46,000 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 177 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:46,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 845 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 323 Invalid, 0 Unknown, 213 Unchecked, 0.9s Time] [2022-11-18 20:34:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-18 20:34:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 116. [2022-11-18 20:34:46,030 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:34:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 152 transitions. [2022-11-18 20:34:46,032 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 152 transitions. Word has length 99 [2022-11-18 20:34:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:46,032 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 152 transitions. [2022-11-18 20:34:46,032 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:34:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2022-11-18 20:34:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-18 20:34:46,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:46,036 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:34:46,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:46,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:46,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:46,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:46,250 INFO L85 PathProgramCache]: Analyzing trace with hash 514129991, now seen corresponding path program 1 times [2022-11-18 20:34:46,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:34:46,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775619791] [2022-11-18 20:34:46,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:46,251 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:34:46,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:34:46,252 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:46,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:46,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:34:46,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:46,528 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:34:46,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:46,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:34:46,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775619791] [2022-11-18 20:34:46,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775619791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:46,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:46,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:34:46,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110710029] [2022-11-18 20:34:46,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:46,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:34:46,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:34:46,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:34:46,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:34:46,530 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:34:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:46,583 INFO L93 Difference]: Finished difference Result 216 states and 290 transitions. [2022-11-18 20:34:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:34:46,583 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:34:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:46,585 INFO L225 Difference]: With dead ends: 216 [2022-11-18 20:34:46,586 INFO L226 Difference]: Without dead ends: 119 [2022-11-18 20:34:46,586 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:34:46,587 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:34:46,587 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:34:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-18 20:34:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2022-11-18 20:34:46,603 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:34:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 151 transitions. [2022-11-18 20:34:46,605 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 151 transitions. Word has length 99 [2022-11-18 20:34:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:46,605 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 151 transitions. [2022-11-18 20:34:46,606 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:34:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 151 transitions. [2022-11-18 20:34:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-18 20:34:46,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:46,607 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:34:46,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:46,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:46,825 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:46,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:46,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1074829769, now seen corresponding path program 1 times [2022-11-18 20:34:46,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:34:46,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735671263] [2022-11-18 20:34:46,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:46,826 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:34:46,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:34:46,827 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:46,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:47,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:34:47,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:47,124 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:34:47,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:47,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:34:47,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735671263] [2022-11-18 20:34:47,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735671263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:47,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:47,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:34:47,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267214208] [2022-11-18 20:34:47,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:47,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:34:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:34:47,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:34:47,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:34:47,127 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:34:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:47,215 INFO L93 Difference]: Finished difference Result 214 states and 287 transitions. [2022-11-18 20:34:47,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:34:47,216 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:34:47,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:47,220 INFO L225 Difference]: With dead ends: 214 [2022-11-18 20:34:47,220 INFO L226 Difference]: Without dead ends: 117 [2022-11-18 20:34:47,221 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:34:47,223 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:34:47,223 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:34:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-18 20:34:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2022-11-18 20:34:47,247 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:34:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2022-11-18 20:34:47,249 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 99 [2022-11-18 20:34:47,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:47,251 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2022-11-18 20:34:47,251 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:34:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2022-11-18 20:34:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-18 20:34:47,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:47,253 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:34:47,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:47,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:47,469 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:47,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2113170743, now seen corresponding path program 1 times [2022-11-18 20:34:47,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:34:47,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199680774] [2022-11-18 20:34:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:47,471 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:34:47,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:34:47,472 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:47,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:34:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:47,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-18 20:34:47,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:50,415 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_4 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_4) (_ bv0 64)) v_aws_linked_list_front_~list.base_BEFORE_CALL_4))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_4 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_4) (_ bv0 64)) (_ bv16 64))))) is different from true [2022-11-18 20:34:58,620 WARN L233 SmtUtils]: Spent 8.06s 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:35:06,989 WARN L233 SmtUtils]: Spent 8.05s 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:35:15,270 WARN L233 SmtUtils]: Spent 8.07s 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:35:23,807 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:35:32,091 WARN L233 SmtUtils]: Spent 8.05s 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:35:32,194 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:35:32,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:35:38,833 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 20:35:38,834 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:35:38,856 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-18 20:35:38,856 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:35:38,888 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:35:38,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:35:38,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199680774] [2022-11-18 20:35:38,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199680774] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:35:38,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:35:38,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2022-11-18 20:35:38,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416853124] [2022-11-18 20:35:38,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:35:38,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:35:38,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:35:38,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:35:38,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=672, Unknown=2, NotChecked=52, Total=812 [2022-11-18 20:35:38,892 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:35:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:43,817 INFO L93 Difference]: Finished difference Result 257 states and 332 transitions. [2022-11-18 20:35:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-18 20:35:43,818 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:35:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:43,819 INFO L225 Difference]: With dead ends: 257 [2022-11-18 20:35:43,820 INFO L226 Difference]: Without dead ends: 145 [2022-11-18 20:35:43,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 49.2s TimeCoverageRelationStatistics Valid=115, Invalid=943, Unknown=2, NotChecked=62, Total=1122 [2022-11-18 20:35:43,821 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 82 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:35:43,822 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.1s Time] [2022-11-18 20:35:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-18 20:35:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2022-11-18 20:35:43,842 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:35:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 172 transitions. [2022-11-18 20:35:43,843 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 172 transitions. Word has length 100 [2022-11-18 20:35:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:43,844 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 172 transitions. [2022-11-18 20:35:43,844 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:35:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 172 transitions. [2022-11-18 20:35:43,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-18 20:35:43,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:43,846 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:35:43,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:35:44,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:35:44,063 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2037452824, now seen corresponding path program 2 times [2022-11-18 20:35:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:35:44,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145953572] [2022-11-18 20:35:44,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:35:44,064 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:35:44,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:35:44,065 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:35:44,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:35:44,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:35:44,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:35:44,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-18 20:35:44,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:35:47,530 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:35:47,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:35:50,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:51,000 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:35:51,035 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 20:35:51,035 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:35:51,116 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:35:51,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:35:51,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145953572] [2022-11-18 20:35:51,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145953572] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:35:51,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:35:51,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2022-11-18 20:35:51,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112922669] [2022-11-18 20:35:51,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:35:51,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:35:51,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:35:51,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:35:51,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:35:51,119 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:35:52,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:52,987 INFO L93 Difference]: Finished difference Result 256 states and 324 transitions. [2022-11-18 20:35:52,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:35:52,989 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:35:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:52,991 INFO L225 Difference]: With dead ends: 256 [2022-11-18 20:35:52,991 INFO L226 Difference]: Without dead ends: 174 [2022-11-18 20:35:52,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 193 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2022-11-18 20:35:52,992 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:35:52,993 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:35:52,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-18 20:35:53,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 162. [2022-11-18 20:35:53,016 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:35:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 203 transitions. [2022-11-18 20:35:53,017 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 203 transitions. Word has length 110 [2022-11-18 20:35:53,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:53,018 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 203 transitions. [2022-11-18 20:35:53,018 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:35:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 203 transitions. [2022-11-18 20:35:53,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-18 20:35:53,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:53,020 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:35:53,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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)] Forceful destruction successful, exit code 0 [2022-11-18 20:35:53,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:35:53,237 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:53,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:53,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1228106198, now seen corresponding path program 1 times [2022-11-18 20:35:53,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:35:53,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918441946] [2022-11-18 20:35:53,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:53,239 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:35:53,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:35:53,240 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:35:53,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:35:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:53,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-18 20:35:53,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:35:54,427 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:35:54,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:35:55,379 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 20:35:55,380 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:35:55,562 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:35:55,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:35:55,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918441946] [2022-11-18 20:35:55,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918441946] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:35:55,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:35:55,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2022-11-18 20:35:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917631488] [2022-11-18 20:35:55,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:35:55,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:35:55,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:35:55,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:35:55,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2022-11-18 20:35:55,565 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:35:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:58,922 INFO L93 Difference]: Finished difference Result 348 states and 466 transitions. [2022-11-18 20:35:58,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:35:58,923 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:35:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:58,925 INFO L225 Difference]: With dead ends: 348 [2022-11-18 20:35:58,926 INFO L226 Difference]: Without dead ends: 235 [2022-11-18 20:35:58,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=170, Invalid=883, Unknown=3, NotChecked=0, Total=1056 [2022-11-18 20:35:58,928 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 145 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:35:58,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1207 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 466 Invalid, 0 Unknown, 14 Unchecked, 1.7s Time] [2022-11-18 20:35:58,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-18 20:35:58,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 167. [2022-11-18 20:35:58,977 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:35:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 211 transitions. [2022-11-18 20:35:58,979 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 211 transitions. Word has length 110 [2022-11-18 20:35:58,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:58,979 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 211 transitions. [2022-11-18 20:35:58,980 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:35:58,980 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 211 transitions. [2022-11-18 20:35:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-18 20:35:58,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:58,981 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:35:59,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:35:59,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:35:59,199 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:59,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:59,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1127699052, now seen corresponding path program 1 times [2022-11-18 20:35:59,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:35:59,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639020969] [2022-11-18 20:35:59,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:59,200 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:35:59,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:35:59,201 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:35:59,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:35:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:59,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:35:59,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:35:59,504 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:35:59,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:35:59,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:35:59,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639020969] [2022-11-18 20:35:59,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639020969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:59,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:59,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:35:59,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916069682] [2022-11-18 20:35:59,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:59,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:35:59,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:35:59,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:35:59,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:35:59,508 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:35:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:59,569 INFO L93 Difference]: Finished difference Result 288 states and 373 transitions. [2022-11-18 20:35:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:35:59,570 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:35:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:59,572 INFO L225 Difference]: With dead ends: 288 [2022-11-18 20:35:59,572 INFO L226 Difference]: Without dead ends: 170 [2022-11-18 20:35:59,573 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:35:59,574 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:35:59,574 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:35:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-18 20:35:59,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2022-11-18 20:35:59,600 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:35:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 207 transitions. [2022-11-18 20:35:59,602 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 207 transitions. Word has length 110 [2022-11-18 20:35:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:59,603 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 207 transitions. [2022-11-18 20:35:59,603 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:35:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 207 transitions. [2022-11-18 20:35:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-18 20:35:59,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:59,605 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:35:59,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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)] Forceful destruction successful, exit code 0 [2022-11-18 20:35:59,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:35:59,826 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:59,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2030089748, now seen corresponding path program 1 times [2022-11-18 20:35:59,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:35:59,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234377049] [2022-11-18 20:35:59,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:59,827 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:35:59,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:35:59,828 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:35:59,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:36:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-18 20:36:00,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:00,272 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:36:00,278 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:36:02,576 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:36:02,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:36:02,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:36:02,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234377049] [2022-11-18 20:36:02,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234377049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:02,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:36:02,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 20:36:02,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591626623] [2022-11-18 20:36:02,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:02,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:36:02,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:36:02,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:36:02,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:36:02,580 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:36:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:03,461 INFO L93 Difference]: Finished difference Result 376 states and 474 transitions. [2022-11-18 20:36:03,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:36:03,462 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:36:03,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:03,464 INFO L225 Difference]: With dead ends: 376 [2022-11-18 20:36:03,465 INFO L226 Difference]: Without dead ends: 280 [2022-11-18 20:36:03,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 12 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:36:03,466 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:36:03,466 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:36:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-18 20:36:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 265. [2022-11-18 20:36:03,509 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:36:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 329 transitions. [2022-11-18 20:36:03,511 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 329 transitions. Word has length 111 [2022-11-18 20:36:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:03,512 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 329 transitions. [2022-11-18 20:36:03,512 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:36:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 329 transitions. [2022-11-18 20:36:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-18 20:36:03,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:03,513 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:36:03,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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)] Forceful destruction successful, exit code 0 [2022-11-18 20:36:03,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:36:03,727 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:03,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:03,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1637062738, now seen corresponding path program 1 times [2022-11-18 20:36:03,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:36:03,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753482749] [2022-11-18 20:36:03,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:03,728 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:36:03,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:36:03,730 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:36:03,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:36:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-18 20:36:04,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:07,784 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:36:07,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:11,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:36:11,678 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:36:11,713 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 20:36:11,714 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:36:11,756 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:36:11,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:36:11,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753482749] [2022-11-18 20:36:11,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753482749] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:11,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:11,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 23 [2022-11-18 20:36:11,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517846523] [2022-11-18 20:36:11,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:11,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 20:36:11,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:36:11,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:36:11,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-11-18 20:36:11,759 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:36:14,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:14,695 INFO L93 Difference]: Finished difference Result 380 states and 475 transitions. [2022-11-18 20:36:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:36:14,697 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:36:14,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:14,699 INFO L225 Difference]: With dead ends: 380 [2022-11-18 20:36:14,700 INFO L226 Difference]: Without dead ends: 282 [2022-11-18 20:36:14,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 192 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2022-11-18 20:36:14,701 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:36:14,702 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:36:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-18 20:36:14,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 271. [2022-11-18 20:36:14,745 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:36:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2022-11-18 20:36:14,748 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 111 [2022-11-18 20:36:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:14,748 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2022-11-18 20:36:14,749 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:36:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2022-11-18 20:36:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-18 20:36:14,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:14,750 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:36:14,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:36:14,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:36:14,967 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1895228176, now seen corresponding path program 1 times [2022-11-18 20:36:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:36:14,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337674490] [2022-11-18 20:36:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:14,968 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:36:14,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:36:14,969 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:36:14,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:36:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:15,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-18 20:36:15,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:17,509 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:36:19,692 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:36:21,914 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_30 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_31 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_30) v_aws_linked_list_front_~list.offset_BEFORE_CALL_31) (_ bv0 64)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_30 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_31 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_30) v_aws_linked_list_front_~list.offset_BEFORE_CALL_31))))) is different from true [2022-11-18 20:36:24,052 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_31 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_32 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_31) v_aws_linked_list_front_~list.offset_BEFORE_CALL_32)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_31 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_32 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_31) v_aws_linked_list_front_~list.offset_BEFORE_CALL_32))))) is different from true [2022-11-18 20:36:26,230 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_32 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_33 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_32) v_aws_linked_list_front_~list.offset_BEFORE_CALL_33)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_32 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_33 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_32) v_aws_linked_list_front_~list.offset_BEFORE_CALL_33) (_ bv0 64))))) is different from true [2022-11-18 20:36:28,374 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_34 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_33 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_33) v_aws_linked_list_front_~list.offset_BEFORE_CALL_34)))) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_34 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_33 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_33) v_aws_linked_list_front_~list.offset_BEFORE_CALL_34) (_ bv0 64))))) is different from true [2022-11-18 20:36:36,566 WARN L233 SmtUtils]: Spent 6.09s 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:36:44,808 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:36:53,080 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:36:58,515 WARN L233 SmtUtils]: Spent 5.27s 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:36:58,635 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:36:58,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:37:01,873 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 20:37:01,874 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:37:01,902 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-18 20:37:01,903 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:37:01,929 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:37:01,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:01,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337674490] [2022-11-18 20:37:01,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337674490] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:37:01,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:37:01,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 23 [2022-11-18 20:37:01,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130074408] [2022-11-18 20:37:01,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:37:01,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 20:37:01,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:01,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:37:01,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=221, Unknown=10, NotChecked=210, Total=506 [2022-11-18 20:37:01,932 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:37:16,985 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:37:29,278 WARN L233 SmtUtils]: Spent 6.09s 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:37:39,454 WARN L233 SmtUtils]: Spent 6.12s 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:37:47,669 WARN L233 SmtUtils]: Spent 6.18s 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:37:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:47,956 INFO L93 Difference]: Finished difference Result 455 states and 552 transitions. [2022-11-18 20:37:47,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:37:47,957 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:37:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:47,959 INFO L225 Difference]: With dead ends: 455 [2022-11-18 20:37:47,960 INFO L226 Difference]: Without dead ends: 349 [2022-11-18 20:37:47,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 194 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 90.2s TimeCoverageRelationStatistics Valid=164, Invalid=491, Unknown=23, NotChecked=378, Total=1056 [2022-11-18 20:37:47,961 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.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:47,962 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.6s Time] [2022-11-18 20:37:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-18 20:37:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 305. [2022-11-18 20:37:48,014 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:37:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 367 transitions. [2022-11-18 20:37:48,017 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 367 transitions. Word has length 111 [2022-11-18 20:37:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:48,017 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 367 transitions. [2022-11-18 20:37:48,018 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:37:48,018 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 367 transitions. [2022-11-18 20:37:48,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-18 20:37:48,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:48,020 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:37:48,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:37:48,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:37:48,235 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:48,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:48,235 INFO L85 PathProgramCache]: Analyzing trace with hash 884110926, now seen corresponding path program 1 times [2022-11-18 20:37:48,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:48,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875178433] [2022-11-18 20:37:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:48,236 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:37:48,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:48,237 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:37:48,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:37:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:48,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:37:48,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:48,710 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:37:48,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:37:48,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:48,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875178433] [2022-11-18 20:37:48,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875178433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:37:48,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:37:48,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:37:48,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048846870] [2022-11-18 20:37:48,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:37:48,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:37:48,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:48,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:37:48,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:37:48,713 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:37:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:48,920 INFO L93 Difference]: Finished difference Result 605 states and 744 transitions. [2022-11-18 20:37:48,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:37:48,921 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:37:48,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:48,923 INFO L225 Difference]: With dead ends: 605 [2022-11-18 20:37:48,923 INFO L226 Difference]: Without dead ends: 292 [2022-11-18 20:37:48,924 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:37:48,925 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:37:48,925 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:37:48,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-18 20:37:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-11-18 20:37:48,988 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:37:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 344 transitions. [2022-11-18 20:37:48,991 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 344 transitions. Word has length 111 [2022-11-18 20:37:48,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:48,992 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 344 transitions. [2022-11-18 20:37:48,992 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:37:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 344 transitions. [2022-11-18 20:37:48,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-18 20:37:48,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:48,994 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:37:49,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:37:49,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:37:49,213 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:49,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:49,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1573375158, now seen corresponding path program 1 times [2022-11-18 20:37:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:49,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023739742] [2022-11-18 20:37:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:49,215 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:37:49,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:49,217 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:37:49,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:37:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:49,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-18 20:37:49,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:49,876 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-18 20:37:49,876 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:37:49,890 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:37:49,908 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:37:50,028 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-18 20:37:50,028 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 36 [2022-11-18 20:37:50,033 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 29 treesize of output 17 [2022-11-18 20:37:50,385 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (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_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse1))) (not (= (_ bv0 64) .cse1)))))) is different from true [2022-11-18 20:37:51,267 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (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_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse1))) (not (= (_ bv0 64) .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse2) (not (= (_ bv0 64) .cse2))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (= .cse3 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse3))))))) is different from true [2022-11-18 20:37:51,614 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (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_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse1))) (not (= (_ bv0 64) .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse2) (not (= (_ bv0 64) .cse2))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (= .cse3 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse3)))))) (let ((.cse6 (bvadd |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset| (_ bv24 64)))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base|) .cse6))) (let ((.cse4 (not (= (_ bv0 64) .cse5)))) (or (and .cse4 (= .cse5 |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base|)) (and .cse4 (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base| v_DerPreprocessor_2) .cse5 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base| v_DerPreprocessor_2) .cse5) (select |c_#memory_$Pointer$.base| .cse5)) (= .cse5 (select v_DerPreprocessor_2 .cse6))))))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset|)) is different from true [2022-11-18 20:37:51,875 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (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_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse1))) (not (= (_ bv0 64) .cse1)))))) (= |c_aws_linked_list_front_#in~list.offset| (_ bv0 64)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse2) (not (= (_ bv0 64) .cse2))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (= .cse3 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse3)))))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_front_#in~list.base|) (_ bv24 64)))) (let ((.cse4 (not (= (_ bv0 64) .cse5)))) (or (and .cse4 (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse5) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |c_aws_linked_list_front_#in~list.base| v_DerPreprocessor_2) .cse5 v_DerPreprocessor_1) |c_aws_linked_list_front_#in~list.base| v_DerPreprocessor_2) .cse5) (select |c_#memory_$Pointer$.base| .cse5))))) (and .cse4 (= .cse5 |c_aws_linked_list_front_#in~list.base|)))))) is different from true [2022-11-18 20:37:52,019 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 64) c_aws_linked_list_front_~list.offset) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (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_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse1))) (not (= (_ bv0 64) .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse2) (not (= (_ bv0 64) .cse2))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (= .cse3 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse3)))))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_aws_linked_list_front_~list.base) (_ bv24 64)))) (let ((.cse5 (not (= (_ bv0 64) .cse4)))) (or (and (= c_aws_linked_list_front_~list.base .cse4) .cse5) (and .cse5 (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_1) c_aws_linked_list_front_~list.base v_DerPreprocessor_2) .cse4 v_DerPreprocessor_1) c_aws_linked_list_front_~list.base v_DerPreprocessor_2) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse4)))))))) is different from true [2022-11-18 20:37:52,159 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (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_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse1))) (not (= (_ bv0 64) .cse1)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (= .cse2 v_aws_linked_list_front_~list.base_BEFORE_CALL_44)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse3)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse3 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (= .cse3 (select v_DerPreprocessor_2 (_ bv24 64))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse4) (not (= (_ bv0 64) .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse5) (select |c_#memory_$Pointer$.base| .cse5)) (= .cse5 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse5))))))) is different from true [2022-11-18 20:37:55,677 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 64) c_aws_linked_list_front_~list.offset) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (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_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse1))) (not (= (_ bv0 64) .cse1)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (= .cse2 v_aws_linked_list_front_~list.base_BEFORE_CALL_44)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse3)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse3 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (= .cse3 (select v_DerPreprocessor_2 (_ bv24 64))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse4) (not (= (_ bv0 64) .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse5) (select |c_#memory_$Pointer$.base| .cse5)) (= .cse5 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse5)))))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_aws_linked_list_front_~list.base) (_ bv24 64)))) (let ((.cse7 (not (= (_ bv0 64) .cse6)))) (or (and (= c_aws_linked_list_front_~list.base .cse6) .cse7) (and .cse7 (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_1) c_aws_linked_list_front_~list.base v_DerPreprocessor_2) .cse6 v_DerPreprocessor_1) c_aws_linked_list_front_~list.base v_DerPreprocessor_2) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse6)))))))) is different from true [2022-11-18 20:37:59,689 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 64) c_aws_linked_list_front_~list.offset) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (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_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse1))) (not (= (_ bv0 64) .cse1)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (= .cse2 v_aws_linked_list_front_~list.base_BEFORE_CALL_44)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse3)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse3 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (= .cse3 (select v_DerPreprocessor_2 (_ bv24 64))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse4) (not (= (_ bv0 64) .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse5) (select |c_#memory_$Pointer$.base| .cse5)) (= .cse5 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse5)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse6)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse6 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (= .cse6 (select v_DerPreprocessor_2 (_ bv24 64)))))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (= .cse7 v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (not (= (_ bv0 64) .cse7)))))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_aws_linked_list_front_~list.base) (_ bv24 64)))) (let ((.cse9 (not (= (_ bv0 64) .cse8)))) (or (and (= c_aws_linked_list_front_~list.base .cse8) .cse9) (and .cse9 (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_1) c_aws_linked_list_front_~list.base v_DerPreprocessor_2) .cse8 v_DerPreprocessor_1) c_aws_linked_list_front_~list.base v_DerPreprocessor_2) .cse8) (select |c_#memory_$Pointer$.base| .cse8)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse8)))))))) is different from true [2022-11-18 20:38:00,038 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= .cse0 (select v_DerPreprocessor_2 (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0)))) (not (= .cse0 (_ bv0 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse1 v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (not (= .cse1 (_ bv0 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse2)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse3)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse3))) (not (= (_ bv0 64) .cse3)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse4)) (= .cse4 v_aws_linked_list_front_~list.base_BEFORE_CALL_44)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse5 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse5) (select |c_#memory_$Pointer$.base| .cse5)) (= .cse5 (select v_DerPreprocessor_2 (_ bv24 64))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse6) (not (= (_ bv0 64) .cse6))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse7) (select |c_#memory_$Pointer$.base| .cse7)) (= .cse7 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse7)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse8)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse8 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse8) (select |c_#memory_$Pointer$.base| .cse8)) (= .cse8 (select v_DerPreprocessor_2 (_ bv24 64)))))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (= .cse9 v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (not (= (_ bv0 64) .cse9))))))) is different from true [2022-11-18 20:38:09,788 WARN L233 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 133 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:38:28,813 WARN L233 SmtUtils]: Spent 17.50s on a formula simplification that was a NOOP. DAG size: 133 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:38:34,420 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= .cse0 (select v_DerPreprocessor_2 (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0)))) (not (= .cse0 (_ bv0 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse1 v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_48 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= .cse2 (select v_DerPreprocessor_2 (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_48 v_DerPreprocessor_2) .cse2 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_48 v_DerPreprocessor_2) .cse2) (select |c_#memory_$Pointer$.base| .cse2)))) (not (= .cse2 (_ bv0 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_48 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (_ bv24 64)))) (and (= .cse3 v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (not (= .cse3 (_ bv0 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse4)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse4)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse5) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse5)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse5))) (not (= (_ bv0 64) .cse5)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse6)) (= .cse6 v_aws_linked_list_front_~list.base_BEFORE_CALL_44)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse7 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse7) (select |c_#memory_$Pointer$.base| .cse7)) (= .cse7 (select v_DerPreprocessor_2 (_ bv24 64))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse8) (not (= (_ bv0 64) .cse8))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse9) (select |c_#memory_$Pointer$.base| .cse9)) (= .cse9 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse9)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse10)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse10 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= .cse10 (select v_DerPreprocessor_2 (_ bv24 64)))))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (= .cse11 v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (not (= (_ bv0 64) .cse11)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse12)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse12) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_47 v_DerPreprocessor_2) .cse12 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_47 v_DerPreprocessor_2) .cse12)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse12)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse13)) (= .cse13 v_aws_linked_list_front_~list.base_BEFORE_CALL_47)))))) is different from true [2022-11-18 20:39:02,942 WARN L233 SmtUtils]: Spent 28.02s on a formula simplification that was a NOOP. DAG size: 160 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:39:20,943 WARN L233 SmtUtils]: Spent 16.17s on a formula simplification that was a NOOP. DAG size: 162 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:39:43,619 WARN L233 SmtUtils]: Spent 21.64s on a formula simplification that was a NOOP. DAG size: 162 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:40:12,554 WARN L233 SmtUtils]: Spent 26.42s on a formula simplification that was a NOOP. DAG size: 160 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:40:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 52 not checked. [2022-11-18 20:40:13,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:40:16,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:40:16,352 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 124 treesize of output 127 [2022-11-18 20:40:16,361 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 136 treesize of output 128 [2022-11-18 20:40:16,376 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 128 treesize of output 124 [2022-11-18 20:40:16,501 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:40:16,529 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:40:17,093 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:40:17,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:40:17,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023739742] [2022-11-18 20:40:17,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023739742] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 20:40:17,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:40:17,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [24] total 33 [2022-11-18 20:40:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22970293] [2022-11-18 20:40:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:40:17,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:40:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:40:17,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:40:17,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=386, Unknown=62, NotChecked=510, Total=1056 [2022-11-18 20:40:17,098 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:40:21,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:40:21,309 INFO L93 Difference]: Finished difference Result 414 states and 505 transitions. [2022-11-18 20:40:21,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:40:21,311 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:40:21,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:40:21,312 INFO L225 Difference]: With dead ends: 414 [2022-11-18 20:40:21,312 INFO L226 Difference]: Without dead ends: 315 [2022-11-18 20:40:21,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 136.8s TimeCoverageRelationStatistics Valid=121, Invalid=550, Unknown=71, NotChecked=590, Total=1332 [2022-11-18 20:40:21,313 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 61 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:40:21,313 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.7s Time] [2022-11-18 20:40:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-18 20:40:21,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 306. [2022-11-18 20:40:21,362 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:40:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 365 transitions. [2022-11-18 20:40:21,364 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 365 transitions. Word has length 113 [2022-11-18 20:40:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:40:21,365 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 365 transitions. [2022-11-18 20:40:21,365 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:40:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 365 transitions. [2022-11-18 20:40:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-18 20:40:21,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:40:21,367 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:40:21,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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)] Forceful destruction successful, exit code 0 [2022-11-18 20:40:21,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:40:21,586 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:40:21,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:40:21,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1350560461, now seen corresponding path program 1 times [2022-11-18 20:40:21,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:40:21,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998563567] [2022-11-18 20:40:21,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:40:21,588 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:40:21,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:40:21,589 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:40:21,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:40:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:40:22,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-18 20:40:22,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:40:56,467 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:40:56,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:41:21,197 INFO L321 Elim1Store]: treesize reduction 21, result has 78.8 percent of original size [2022-11-18 20:41:21,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 121 [2022-11-18 20:41:21,740 INFO L321 Elim1Store]: treesize reduction 15, result has 77.6 percent of original size [2022-11-18 20:41:21,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 125 [2022-11-18 20:41:28,316 INFO L321 Elim1Store]: treesize reduction 17, result has 82.8 percent of original size [2022-11-18 20:41:28,317 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:41:29,129 INFO L321 Elim1Store]: treesize reduction 8, result has 88.1 percent of original size [2022-11-18 20:41:29,130 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:41:31,895 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:41:31,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:41:31,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998563567] [2022-11-18 20:41:31,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998563567] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:41:31,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:41:31,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 38 [2022-11-18 20:41:31,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164482701] [2022-11-18 20:41:31,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:41:31,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-18 20:41:31,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:41:31,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-18 20:41:31,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1263, Unknown=5, NotChecked=0, Total=1406 [2022-11-18 20:41:31,898 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:41:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:41:44,564 INFO L93 Difference]: Finished difference Result 507 states and 623 transitions. [2022-11-18 20:41:44,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-18 20:41:44,566 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:41:44,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:41:44,568 INFO L225 Difference]: With dead ends: 507 [2022-11-18 20:41:44,569 INFO L226 Difference]: Without dead ends: 379 [2022-11-18 20:41:44,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 209 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 57.8s TimeCoverageRelationStatistics Valid=286, Invalid=2463, Unknown=7, NotChecked=0, Total=2756 [2022-11-18 20:41:44,571 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 106 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:41:44,571 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.1s Time] [2022-11-18 20:41:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-11-18 20:41:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 324. [2022-11-18 20:41:44,653 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:41:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 379 transitions. [2022-11-18 20:41:44,655 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 379 transitions. Word has length 124 [2022-11-18 20:41:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:41:44,656 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 379 transitions. [2022-11-18 20:41:44,656 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:41:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 379 transitions. [2022-11-18 20:41:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-18 20:41:44,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:41:44,658 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:41:44,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:41:44,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:41:44,876 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:41:44,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:41:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1092395023, now seen corresponding path program 1 times [2022-11-18 20:41:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:41:44,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880777800] [2022-11-18 20:41:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:41:44,878 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:41:44,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:41:44,879 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:41:44,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:41:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:41:45,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-18 20:41:45,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:41:47,513 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:41:49,672 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:41:51,893 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_60 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_63 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_63) v_aws_linked_list_front_~list.offset_BEFORE_CALL_60)))) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_60 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_63 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_63) v_aws_linked_list_front_~list.offset_BEFORE_CALL_60))))) is different from true [2022-11-18 20:41:54,027 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_61 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_64 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_64) v_aws_linked_list_front_~list.offset_BEFORE_CALL_61) (_ bv0 64)))) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_61 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_64 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_64) v_aws_linked_list_front_~list.offset_BEFORE_CALL_61))))) is different from true [2022-11-18 20:41:56,192 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_65 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_62 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_65) v_aws_linked_list_front_~list.offset_BEFORE_CALL_62)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_65 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_62 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_65) v_aws_linked_list_front_~list.offset_BEFORE_CALL_62))))) is different from true [2022-11-18 20:41:58,336 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_66 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_63 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_66) v_aws_linked_list_front_~list.offset_BEFORE_CALL_63)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_66 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_63 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_66) v_aws_linked_list_front_~list.offset_BEFORE_CALL_63) (_ bv0 64))))) is different from true [2022-11-18 20:42:06,566 WARN L233 SmtUtils]: Spent 6.10s 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:42:12,947 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:42:19,148 WARN L233 SmtUtils]: Spent 6.09s 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:42:25,390 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:42:31,682 WARN L233 SmtUtils]: Spent 6.11s 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:42:42,522 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:42:48,835 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:42:48,899 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:42:48,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:42:54,325 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 20:42:54,325 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:42:54,344 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-18 20:42:54,344 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:42:54,371 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:42:54,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:42:54,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880777800] [2022-11-18 20:42:54,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880777800] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:42:54,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:42:54,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 31 [2022-11-18 20:42:54,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786387072] [2022-11-18 20:42:54,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:42:54,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-18 20:42:54,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:42:54,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-18 20:42:54,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=531, Unknown=8, NotChecked=306, Total=930 [2022-11-18 20:42:54,376 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:43:12,921 WARN L233 SmtUtils]: Spent 12.18s on a formula simplification. DAG size of input: 43 DAG size of output: 16 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:43:15,150 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:43:27,636 WARN L233 SmtUtils]: Spent 12.24s 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:43:40,027 WARN L233 SmtUtils]: Spent 12.18s 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:43:50,728 WARN L233 SmtUtils]: Spent 10.48s 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:44:04,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:44:04,578 INFO L93 Difference]: Finished difference Result 502 states and 600 transitions. [2022-11-18 20:44:04,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-18 20:44:04,579 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:44:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:44:04,581 INFO L225 Difference]: With dead ends: 502 [2022-11-18 20:44:04,581 INFO L226 Difference]: Without dead ends: 367 [2022-11-18 20:44:04,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 212 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 134.5s TimeCoverageRelationStatistics Valid=216, Invalid=1201, Unknown=17, NotChecked=546, Total=1980 [2022-11-18 20:44:04,584 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 128 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1288 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:44:04,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1203 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 456 Invalid, 0 Unknown, 1288 Unchecked, 2.0s Time] [2022-11-18 20:44:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-11-18 20:44:04,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 334. [2022-11-18 20:44:04,665 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:44:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 385 transitions. [2022-11-18 20:44:04,667 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 385 transitions. Word has length 124 [2022-11-18 20:44:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:44:04,667 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 385 transitions. [2022-11-18 20:44:04,668 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:44:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 385 transitions. [2022-11-18 20:44:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-18 20:44:04,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:44:04,670 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:44:04,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:44:04,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:44:04,883 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:44:04,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:44:04,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2103512273, now seen corresponding path program 1 times [2022-11-18 20:44:04,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:44:04,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119900423] [2022-11-18 20:44:04,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:44:04,885 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:44:04,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:44:04,886 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:44:04,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:44:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:05,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 20:44:05,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:44:05,492 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:44:05,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:44:05,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:44:05,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119900423] [2022-11-18 20:44:05,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119900423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:44:05,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:44:05,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 20:44:05,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980104992] [2022-11-18 20:44:05,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:44:05,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:44:05,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:44:05,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:44:05,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:44:05,496 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:44:06,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:44:06,297 INFO L93 Difference]: Finished difference Result 660 states and 784 transitions. [2022-11-18 20:44:06,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:44:06,298 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:44:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:44:06,301 INFO L225 Difference]: With dead ends: 660 [2022-11-18 20:44:06,301 INFO L226 Difference]: Without dead ends: 334 [2022-11-18 20:44:06,302 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:44:06,303 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 80 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:44:06,304 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.6s Time] [2022-11-18 20:44:06,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-18 20:44:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 291. [2022-11-18 20:44:06,369 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:44:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 333 transitions. [2022-11-18 20:44:06,370 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 333 transitions. Word has length 124 [2022-11-18 20:44:06,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:44:06,371 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 333 transitions. [2022-11-18 20:44:06,371 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:44:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 333 transitions. [2022-11-18 20:44:06,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-18 20:44:06,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:44:06,372 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1] [2022-11-18 20:44:06,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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)] Forceful destruction successful, exit code 0 [2022-11-18 20:44:06,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:44:06,573 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:44:06,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:44:06,573 INFO L85 PathProgramCache]: Analyzing trace with hash -945612142, now seen corresponding path program 1 times [2022-11-18 20:44:06,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:44:06,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103257300] [2022-11-18 20:44:06,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:44:06,574 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:44:06,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:44:06,575 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:44:06,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:44:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:06,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-18 20:44:06,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:44:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 80 proven. 43 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-18 20:44:14,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:44:35,765 INFO L321 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-11-18 20:44:35,765 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2022-11-18 20:44:39,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:44:39,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2022-11-18 20:44:40,235 INFO L321 Elim1Store]: treesize reduction 4, result has 92.9 percent of original size [2022-11-18 20:44:40,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 68 [2022-11-18 20:44:40,486 INFO L321 Elim1Store]: treesize reduction 4, result has 92.9 percent of original size [2022-11-18 20:44:40,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 68 [2022-11-18 20:44:40,582 INFO L321 Elim1Store]: treesize reduction 19, result has 38.7 percent of original size [2022-11-18 20:44:40,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 28 [2022-11-18 20:44:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 19 proven. 43 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-18 20:44:41,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:44:41,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103257300] [2022-11-18 20:44:41,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103257300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:44:41,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:44:41,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 40 [2022-11-18 20:44:41,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214444591] [2022-11-18 20:44:41,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:44:41,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-18 20:44:41,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:44:41,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-18 20:44:41,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1420, Unknown=4, NotChecked=0, Total=1560 [2022-11-18 20:44:41,452 INFO L87 Difference]: Start difference. First operand 291 states and 333 transitions. Second operand has 40 states, 39 states have (on average 3.5384615384615383) internal successors, (138), 38 states have internal predecessors, (138), 15 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) [2022-11-18 20:44:45,740 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_node_next_is_valid_#in~node.base| c_aws_linked_list_node_next_is_valid_~node.base) (= c_aws_linked_list_node_next_is_valid_~node.offset |c_aws_linked_list_node_next_is_valid_#in~node.offset|) (or |c_aws_linked_list_node_next_is_valid_#t~short309| (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|) (_ bv0 64)) (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_35| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_35|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_34|)) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_35|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_34|)))))) is different from false [2022-11-18 20:44:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:44:58,746 INFO L93 Difference]: Finished difference Result 700 states and 871 transitions. [2022-11-18 20:44:58,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-18 20:44:58,748 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.5384615384615383) internal successors, (138), 38 states have internal predecessors, (138), 15 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) Word has length 137 [2022-11-18 20:44:58,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:44:58,751 INFO L225 Difference]: With dead ends: 700 [2022-11-18 20:44:58,751 INFO L226 Difference]: Without dead ends: 577 [2022-11-18 20:44:58,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 233 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=350, Invalid=3307, Unknown=7, NotChecked=118, Total=3782 [2022-11-18 20:44:58,754 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 331 mSDsluCounter, 2963 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 3136 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1312 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:44:58,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 3136 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1015 Invalid, 0 Unknown, 1312 Unchecked, 3.7s Time] [2022-11-18 20:44:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-11-18 20:44:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 443. [2022-11-18 20:44:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 327 states have (on average 1.0978593272171253) internal successors, (359), 336 states have internal predecessors, (359), 65 states have call successors, (65), 42 states have call predecessors, (65), 50 states have return successors, (85), 64 states have call predecessors, (85), 64 states have call successors, (85) [2022-11-18 20:44:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 509 transitions. [2022-11-18 20:44:58,892 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 509 transitions. Word has length 137 [2022-11-18 20:44:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:44:58,892 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 509 transitions. [2022-11-18 20:44:58,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.5384615384615383) internal successors, (138), 38 states have internal predecessors, (138), 15 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) [2022-11-18 20:44:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 509 transitions. [2022-11-18 20:44:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-18 20:44:58,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:44:58,895 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] [2022-11-18 20:44:58,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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)] Forceful destruction successful, exit code 0 [2022-11-18 20:44:59,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:44:59,117 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:44:59,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:44:59,117 INFO L85 PathProgramCache]: Analyzing trace with hash 726269746, now seen corresponding path program 2 times [2022-11-18 20:44:59,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:44:59,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293254301] [2022-11-18 20:44:59,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:44:59,118 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:44:59,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:44:59,119 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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:44:59,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8b04015-1d2d-4a3b-914c-89a3369a51f6/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 (24)] Waiting until timeout for monitored process [2022-11-18 20:44:59,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:44:59,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:44:59,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-18 20:44:59,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:03,184 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_78 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_87 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_87) v_aws_linked_list_front_~list.offset_BEFORE_CALL_78)) (.cse0 (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_87) v_aws_linked_list_front_~list.offset_BEFORE_CALL_78))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse3) .cse0)) (.cse2 (bvadd (select (select |c_#memory_$Pointer$.offset| .cse3) .cse0) (_ bv8 64)))) (and (= .cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) (= .cse1 v_aws_linked_list_front_~list.base_BEFORE_CALL_87) (= (select (select |c_#memory_$Pointer$.base| .cse1) .cse2) .cse3))))) is different from true