./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_front_harness.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_front_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 edd3fac09d24fc037292743bb080afb788cb886b05d29648be5f73c1396cfbb6 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:28:52,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:28:52,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:28:52,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:28:52,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:28:52,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:28:52,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:28:52,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:28:52,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:28:52,398 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:28:52,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:28:52,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:28:52,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:28:52,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:28:52,400 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:28:52,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:28:52,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:28:52,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:28:52,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:28:52,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:28:52,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:28:52,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:28:52,401 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:28:52,402 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:28:52,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:28:52,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:28:52,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:28:52,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:28:52,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:28:52,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:28:52,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:28:52,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:28:52,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:28:52,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:28:52,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:28:52,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:28:52,406 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:28:52,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:28:52,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:28:52,406 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> edd3fac09d24fc037292743bb080afb788cb886b05d29648be5f73c1396cfbb6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:28:52,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:28:52,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:28:52,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:28:52,633 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:28:52,634 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:28:52,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_front_harness.i [2023-11-23 07:28:53,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:28:53,899 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:28:53,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_front_harness.i [2023-11-23 07:28:53,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c561a9c/f72e4d4b15ed451ab66a2ecb94d3c2f6/FLAG85c86be73 [2023-11-23 07:28:53,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c561a9c/f72e4d4b15ed451ab66a2ecb94d3c2f6 [2023-11-23 07:28:53,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:28:53,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:28:53,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:28:53,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:28:53,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:28:53,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:28:53" (1/1) ... [2023-11-23 07:28:53,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:53, skipping insertion in model container [2023-11-23 07:28:53,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:28:53" (1/1) ... [2023-11-23 07:28:54,033 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:28:54,353 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_front_harness.i[4499,4512] [2023-11-23 07:28:54,377 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_front_harness.i[4559,4572] [2023-11-23 07:28:54,947 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:54,949 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:54,950 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:54,950 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:54,952 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:54,959 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:54,962 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:54,964 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:54,966 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:54,969 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:54,970 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:54,970 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:54,970 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:55,204 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:28:55,205 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:28:55,205 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:28:55,206 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:28:55,206 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:28:55,207 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:28:55,207 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:28:55,208 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:28:55,208 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:28:55,208 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:28:55,297 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:28:55,320 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:28:55,330 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_front_harness.i[4499,4512] [2023-11-23 07:28:55,331 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_front_harness.i[4559,4572] [2023-11-23 07:28:55,365 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:55,366 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:55,366 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:55,366 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:55,367 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:55,379 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:55,380 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:55,381 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:55,381 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:55,382 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:55,384 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:55,385 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:55,385 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:28:55,417 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:28:55,417 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:28:55,418 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:28:55,419 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:28:55,423 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:28:55,424 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:28:55,424 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:28:55,426 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:28:55,426 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:28:55,427 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:28:55,477 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:28:55,596 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,596 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,597 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,597 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,597 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,597 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,597 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,597 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,598 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,598 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,598 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,598 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,598 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,598 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,599 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,599 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:28:55,605 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:28:55,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:55 WrapperNode [2023-11-23 07:28:55,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:28:55,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:28:55,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:28:55,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:28:55,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:55" (1/1) ... [2023-11-23 07:28:55,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:55" (1/1) ... [2023-11-23 07:28:55,694 INFO L138 Inliner]: procedures = 678, calls = 1046, calls flagged for inlining = 52, calls inlined = 8, statements flattened = 224 [2023-11-23 07:28:55,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:28:55,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:28:55,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:28:55,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:28:55,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:55" (1/1) ... [2023-11-23 07:28:55,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:55" (1/1) ... [2023-11-23 07:28:55,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:55" (1/1) ... [2023-11-23 07:28:55,743 INFO L188 MemorySlicer]: Split 43 memory accesses to 4 slices as follows [2, 5, 0, 36]. 84 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 9 writes are split as follows [0, 0, 0, 9]. [2023-11-23 07:28:55,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:55" (1/1) ... [2023-11-23 07:28:55,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:55" (1/1) ... [2023-11-23 07:28:55,765 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:55" (1/1) ... [2023-11-23 07:28:55,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:55" (1/1) ... [2023-11-23 07:28:55,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:55" (1/1) ... [2023-11-23 07:28:55,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:55" (1/1) ... [2023-11-23 07:28:55,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:28:55,784 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:28:55,784 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:28:55,784 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:28:55,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:55" (1/1) ... [2023-11-23 07:28:55,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:28:55,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:55,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 07:28:55,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 07:28:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2023-11-23 07:28:55,850 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2023-11-23 07:28:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2023-11-23 07:28:55,851 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2023-11-23 07:28:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:28:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 07:28:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 07:28:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 07:28:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 07:28:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:28:55,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:28:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:28:55,852 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:28:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:28:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 07:28:55,852 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 07:28:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:28:55,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:28:55,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:28:55,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:28:55,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 07:28:55,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:28:55,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:28:55,853 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2023-11-23 07:28:55,854 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2023-11-23 07:28:55,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-23 07:28:55,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-23 07:28:55,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-23 07:28:55,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-23 07:28:55,854 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-23 07:28:55,855 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-23 07:28:55,855 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-23 07:28:55,855 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-23 07:28:55,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:28:55,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:28:55,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:28:55,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:28:55,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:28:55,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:28:55,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-23 07:28:55,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:28:55,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:28:55,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:28:55,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 07:28:55,857 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:28:55,857 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:28:55,857 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:28:55,857 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:28:55,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:28:55,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:28:55,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:28:55,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 07:28:56,102 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:28:56,105 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:28:56,456 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:28:56,499 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:28:56,500 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-23 07:28:56,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:28:56 BoogieIcfgContainer [2023-11-23 07:28:56,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:28:56,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:28:56,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:28:56,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:28:56,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:28:53" (1/3) ... [2023-11-23 07:28:56,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127558d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:28:56, skipping insertion in model container [2023-11-23 07:28:56,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:28:55" (2/3) ... [2023-11-23 07:28:56,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127558d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:28:56, skipping insertion in model container [2023-11-23 07:28:56,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:28:56" (3/3) ... [2023-11-23 07:28:56,507 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_front_harness.i [2023-11-23 07:28:56,521 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:28:56,521 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:28:56,564 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:28:56,574 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=LoopHeads, 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;@5a94cbd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:28:56,575 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:28:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-11-23 07:28:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:28:56,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:56,588 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:56,588 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:56,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:56,593 INFO L85 PathProgramCache]: Analyzing trace with hash 612240928, now seen corresponding path program 1 times [2023-11-23 07:28:56,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:56,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361101794] [2023-11-23 07:28:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:56,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:28:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:28:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:28:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:56,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:28:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:28:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:28:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:28:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:28:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:28:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:28:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:28:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:28:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,166 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-11-23 07:28:57,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:57,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361101794] [2023-11-23 07:28:57,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361101794] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:57,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820674074] [2023-11-23 07:28:57,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:57,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:57,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:57,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:28:57,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 07:28:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 07:28:57,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2023-11-23 07:28:57,419 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:28:57,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820674074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:57,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:28:57,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2023-11-23 07:28:57,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007476991] [2023-11-23 07:28:57,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:57,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:28:57,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:57,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:28:57,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:28:57,450 INFO L87 Difference]: Start difference. First operand has 121 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 07:28:57,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:57,510 INFO L93 Difference]: Finished difference Result 236 states and 371 transitions. [2023-11-23 07:28:57,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:28:57,513 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2023-11-23 07:28:57,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:57,521 INFO L225 Difference]: With dead ends: 236 [2023-11-23 07:28:57,521 INFO L226 Difference]: Without dead ends: 119 [2023-11-23 07:28:57,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:28:57,532 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:57,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:28:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-23 07:28:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-23 07:28:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 71 states have (on average 1.295774647887324) internal successors, (92), 72 states have internal predecessors, (92), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-23 07:28:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2023-11-23 07:28:57,568 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 110 [2023-11-23 07:28:57,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:57,568 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2023-11-23 07:28:57,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 07:28:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2023-11-23 07:28:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:28:57,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:57,570 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:57,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:57,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-23 07:28:57,783 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:57,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:57,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1810732768, now seen corresponding path program 1 times [2023-11-23 07:28:57,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:57,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071129166] [2023-11-23 07:28:57,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:57,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:28:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:28:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:28:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:28:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:28:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:57,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:28:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:28:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:28:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:28:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:28:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:28:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:28:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-11-23 07:28:58,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:58,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071129166] [2023-11-23 07:28:58,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071129166] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:58,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748307092] [2023-11-23 07:28:58,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:58,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:58,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:58,059 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:28:58,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 07:28:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 07:28:58,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-23 07:28:58,255 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:28:58,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748307092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:58,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:28:58,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 07:28:58,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260477425] [2023-11-23 07:28:58,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:58,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:28:58,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:58,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:28:58,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:28:58,259 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 07:28:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:58,330 INFO L93 Difference]: Finished difference Result 226 states and 319 transitions. [2023-11-23 07:28:58,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:28:58,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 110 [2023-11-23 07:28:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:58,332 INFO L225 Difference]: With dead ends: 226 [2023-11-23 07:28:58,332 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 07:28:58,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:28:58,334 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 3 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:58,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 442 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:28:58,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 07:28:58,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2023-11-23 07:28:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 75 states have internal predecessors, (95), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-23 07:28:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 168 transitions. [2023-11-23 07:28:58,343 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 168 transitions. Word has length 110 [2023-11-23 07:28:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:58,344 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 168 transitions. [2023-11-23 07:28:58,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 07:28:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 168 transitions. [2023-11-23 07:28:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:28:58,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:58,345 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:58,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:58,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-23 07:28:58,560 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:58,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:58,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1985732642, now seen corresponding path program 1 times [2023-11-23 07:28:58,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:58,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370886519] [2023-11-23 07:28:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:58,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:28:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:28:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:28:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:28:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:28:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:28:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:28:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:28:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:28:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:28:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:28:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:28:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-11-23 07:28:58,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:58,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370886519] [2023-11-23 07:28:58,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370886519] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:58,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456556189] [2023-11-23 07:28:58,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:58,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:58,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:58,952 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:28:58,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 07:28:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:59,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-23 07:28:59,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:59,181 INFO L378 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 [2023-11-23 07:28:59,190 INFO L378 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 24 treesize of output 9 [2023-11-23 07:28:59,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:59,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:59,256 INFO L378 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 32 treesize of output 35 [2023-11-23 07:28:59,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:59,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:59,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:59,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2023-11-23 07:29:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-23 07:29:00,978 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:29:00,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456556189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:29:00,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:29:00,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2023-11-23 07:29:00,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402137043] [2023-11-23 07:29:00,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:29:00,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 07:29:00,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:29:00,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 07:29:00,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:29:00,980 INFO L87 Difference]: Start difference. First operand 122 states and 168 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-23 07:29:03,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:04,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:29:04,953 INFO L93 Difference]: Finished difference Result 320 states and 441 transitions. [2023-11-23 07:29:04,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 07:29:04,961 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) Word has length 110 [2023-11-23 07:29:04,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:29:04,967 INFO L225 Difference]: With dead ends: 320 [2023-11-23 07:29:04,968 INFO L226 Difference]: Without dead ends: 209 [2023-11-23 07:29:04,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 120 SyntacticMatches, 12 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2023-11-23 07:29:04,969 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 113 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-23 07:29:04,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 800 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 660 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2023-11-23 07:29:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-23 07:29:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 202. [2023-11-23 07:29:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 125 states have (on average 1.288) internal successors, (161), 127 states have internal predecessors, (161), 60 states have call successors, (60), 17 states have call predecessors, (60), 16 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2023-11-23 07:29:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 280 transitions. [2023-11-23 07:29:04,998 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 280 transitions. Word has length 110 [2023-11-23 07:29:04,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:29:04,998 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 280 transitions. [2023-11-23 07:29:04,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-23 07:29:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 280 transitions. [2023-11-23 07:29:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:29:05,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:29:05,000 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:29:05,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 07:29:05,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:29:05,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:29:05,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:29:05,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1139578398, now seen corresponding path program 1 times [2023-11-23 07:29:05,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:29:05,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809553431] [2023-11-23 07:29:05,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:29:05,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:29:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:29:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:29:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:29:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:29:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:29:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:29:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:29:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:29:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:29:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:29:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:29:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:29:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:29:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:29:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:29:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:29:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-11-23 07:29:05,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:29:05,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809553431] [2023-11-23 07:29:05,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809553431] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:29:05,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568009112] [2023-11-23 07:29:05,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:29:05,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:29:05,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:29:05,492 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:29:05,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 07:29:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:05,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-23 07:29:05,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:29:05,693 INFO L378 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 [2023-11-23 07:29:05,702 INFO L378 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 24 treesize of output 9 [2023-11-23 07:29:05,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:29:05,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:29:05,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:29:05,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2023-11-23 07:29:05,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:29:05,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:29:05,775 INFO L378 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 40 treesize of output 28 [2023-11-23 07:29:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-23 07:29:07,359 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:29:07,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568009112] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:29:07,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:29:07,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2023-11-23 07:29:07,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372484429] [2023-11-23 07:29:07,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:29:07,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:29:07,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:29:07,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:29:07,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:29:07,361 INFO L87 Difference]: Start difference. First operand 202 states and 280 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-23 07:29:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:29:08,436 INFO L93 Difference]: Finished difference Result 350 states and 477 transitions. [2023-11-23 07:29:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:29:08,436 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) Word has length 110 [2023-11-23 07:29:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:29:08,438 INFO L225 Difference]: With dead ends: 350 [2023-11-23 07:29:08,438 INFO L226 Difference]: Without dead ends: 205 [2023-11-23 07:29:08,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 121 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2023-11-23 07:29:08,439 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 70 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 07:29:08,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 816 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 07:29:08,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-23 07:29:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2023-11-23 07:29:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 125 states have (on average 1.28) internal successors, (160), 127 states have internal predecessors, (160), 60 states have call successors, (60), 17 states have call predecessors, (60), 16 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2023-11-23 07:29:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 279 transitions. [2023-11-23 07:29:08,461 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 279 transitions. Word has length 110 [2023-11-23 07:29:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:29:08,462 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 279 transitions. [2023-11-23 07:29:08,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-23 07:29:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 279 transitions. [2023-11-23 07:29:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:29:08,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:29:08,465 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:29:08,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 07:29:08,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:29:08,672 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:29:08,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:29:08,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1314578272, now seen corresponding path program 1 times [2023-11-23 07:29:08,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:29:08,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434990765] [2023-11-23 07:29:08,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:29:08,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:29:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:29:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:29:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:29:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:29:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:29:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:29:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:29:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:29:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:29:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:29:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:29:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:29:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:29:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:29:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:29:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:29:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-11-23 07:29:08,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:29:08,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434990765] [2023-11-23 07:29:08,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434990765] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:29:08,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7012843] [2023-11-23 07:29:08,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:29:08,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:29:08,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:29:08,896 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:29:08,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 07:29:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:09,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-23 07:29:09,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:29:09,123 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2023-11-23 07:29:09,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2023-11-23 07:29:09,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 07:29:09,143 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 07:29:09,168 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:29:09,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2023-11-23 07:29:09,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 07:29:15,962 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#3.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| v_DerPreprocessor_2) .cse0))) (and (= .cse1 (select |c_#memory_$Pointer$#3.base| .cse0)) (= v_DerPreprocessor_2 (store .cse1 .cse2 .cse0))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#3.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) .cse3))) (and (= v_DerPreprocessor_2 (store .cse4 .cse5 .cse3)) (= (select |c_#memory_$Pointer$#3.base| .cse3) .cse4)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)))))) is different from true [2023-11-23 07:29:16,095 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset| 24))) (let ((.cse5 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse4))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#3.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| v_DerPreprocessor_2) .cse0))) (and (= .cse1 (select |c_#memory_$Pointer$#3.base| .cse0)) (= v_DerPreprocessor_2 (store .cse1 .cse2 .cse0))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)))) (<= 2 |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$#3.base| .cse5 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| v_DerPreprocessor_2) .cse5))) (and (= v_DerPreprocessor_2 (store .cse3 .cse4 .cse5)) (= .cse3 (select |c_#memory_$Pointer$#3.base| .cse5))))) (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse5)) (<= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse5) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#3.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) .cse6))) (and (= v_DerPreprocessor_2 (store .cse7 .cse8 .cse6)) (= (select |c_#memory_$Pointer$#3.base| .cse6) .cse7)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)))))))) is different from true [2023-11-23 07:29:16,157 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse1))) (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#3.base| .cse2 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_2) .cse2))) (and (= (store .cse0 .cse1 .cse2) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#3.base| .cse2) .cse0)))) (= .cse2 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#3.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| v_DerPreprocessor_2) .cse3))) (and (= .cse4 (select |c_#memory_$Pointer$#3.base| .cse3)) (= v_DerPreprocessor_2 (store .cse4 .cse5 .cse3))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)))) (<= 2 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) (<= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| .cse2) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#3.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) .cse6))) (and (= v_DerPreprocessor_2 (store .cse7 .cse8 .cse6)) (= (select |c_#memory_$Pointer$#3.base| .cse6) .cse7)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)))))))) is different from true [2023-11-23 07:29:17,434 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#3.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| v_DerPreprocessor_2) .cse0))) (and (= .cse1 (select |c_#memory_$Pointer$#3.base| .cse0)) (= v_DerPreprocessor_2 (store .cse1 .cse2 .cse0))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#3.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) .cse3))) (and (= v_DerPreprocessor_2 (store .cse4 .cse5 .cse3)) (= (select |c_#memory_$Pointer$#3.base| .cse3) .cse4)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$#3.base| .cse8 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| v_DerPreprocessor_2) .cse8))) (and (= v_DerPreprocessor_2 (store .cse6 .cse7 .cse8)) (= (select |c_#memory_$Pointer$#3.base| .cse8) .cse6)))) (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| .cse8))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|))))) is different from true [2023-11-23 07:29:18,309 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#3.base| .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_2) .cse2))) (and (= v_DerPreprocessor_2 (store .cse0 .cse1 .cse2)) (= .cse0 (select |c_#memory_$Pointer$#3.base| .cse2))))) (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| .cse2))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#3.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| v_DerPreprocessor_2) .cse3))) (and (= .cse4 (select |c_#memory_$Pointer$#3.base| .cse3)) (= v_DerPreprocessor_2 (store .cse4 .cse5 .cse3))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#3.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) .cse6))) (and (= v_DerPreprocessor_2 (store .cse7 .cse8 .cse6)) (= (select |c_#memory_$Pointer$#3.base| .cse6) .cse7)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24))) (let ((.cse11 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) .cse10))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#3.base| .cse11 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| v_DerPreprocessor_2) .cse11))) (and (= v_DerPreprocessor_2 (store .cse9 .cse10 .cse11)) (= (select |c_#memory_$Pointer$#3.base| .cse11) .cse9)))) (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| .cse11))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|))))) is different from true [2023-11-23 07:29:21,170 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#3.base| .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_2) .cse2))) (and (= v_DerPreprocessor_2 (store .cse0 .cse1 .cse2)) (= .cse0 (select |c_#memory_$Pointer$#3.base| .cse2))))) (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| .cse2))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#3.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| v_DerPreprocessor_2) .cse3))) (and (= .cse4 (select |c_#memory_$Pointer$#3.base| .cse3)) (= v_DerPreprocessor_2 (store .cse4 .cse5 .cse3))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#3.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) .cse6))) (and (= v_DerPreprocessor_2 (store .cse7 .cse8 .cse6)) (= (select |c_#memory_$Pointer$#3.base| .cse6) .cse7)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|) .cse11))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| .cse9) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_$Pointer$#3.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) .cse9))) (and (= (store .cse10 .cse11 .cse9) v_DerPreprocessor_2) (= .cse10 (select |c_#memory_$Pointer$#3.base| .cse9))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24))) (let ((.cse14 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) .cse13))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_$Pointer$#3.base| .cse14 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| v_DerPreprocessor_2) .cse14))) (and (= v_DerPreprocessor_2 (store .cse12 .cse13 .cse14)) (= (select |c_#memory_$Pointer$#3.base| .cse14) .cse12)))) (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| .cse14))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|))))) is different from true [2023-11-23 07:29:21,883 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse1))) (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#3.base| .cse2 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_2) .cse2))) (and (= (store .cse0 .cse1 .cse2) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#3.base| .cse2) .cse0)))) (= .cse2 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| 24))) (let ((.cse5 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) .cse4))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$#3.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_2) .cse5))) (and (= v_DerPreprocessor_2 (store .cse3 .cse4 .cse5)) (= .cse3 (select |c_#memory_$Pointer$#3.base| .cse5))))) (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| .cse5))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#3.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| v_DerPreprocessor_2) .cse6))) (and (= .cse7 (select |c_#memory_$Pointer$#3.base| .cse6)) (= v_DerPreprocessor_2 (store .cse7 .cse8 .cse6))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)))) (<= 2 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) (<= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| .cse2) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse11))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| .cse9) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_$Pointer$#3.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) .cse9))) (and (= v_DerPreprocessor_2 (store .cse10 .cse11 .cse9)) (= (select |c_#memory_$Pointer$#3.base| .cse9) .cse10)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|) .cse14))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| .cse12) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_$Pointer$#3.base| .cse12 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) .cse12))) (and (= (store .cse13 .cse14 .cse12) v_DerPreprocessor_2) (= .cse13 (select |c_#memory_$Pointer$#3.base| .cse12))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (let ((.cse16 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24))) (let ((.cse17 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) .cse16))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_$Pointer$#3.base| .cse17 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| v_DerPreprocessor_2) .cse17))) (and (= v_DerPreprocessor_2 (store .cse15 .cse16 .cse17)) (= (select |c_#memory_$Pointer$#3.base| .cse17) .cse15)))) (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| .cse17))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|))))))) is different from true [2023-11-23 07:29:41,655 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#3.base| .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_2) .cse2))) (and (= v_DerPreprocessor_2 (store .cse0 .cse1 .cse2)) (= .cse0 (select |c_#memory_$Pointer$#3.base| .cse2))))) (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| .cse2))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#3.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| v_DerPreprocessor_2) .cse3))) (and (= .cse4 (select |c_#memory_$Pointer$#3.base| .cse3)) (= v_DerPreprocessor_2 (store .cse4 .cse5 .cse3))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_3| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_3| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_3|) .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_3| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#3.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_3| v_DerPreprocessor_2) .cse6))) (and (= .cse7 (select |c_#memory_$Pointer$#3.base| .cse6)) (= (store .cse7 .cse8 .cse6) v_DerPreprocessor_2)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_3| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_3|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse11))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| .cse9) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_$Pointer$#3.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) .cse9))) (and (= v_DerPreprocessor_2 (store .cse10 .cse11 .cse9)) (= (select |c_#memory_$Pointer$#3.base| .cse9) .cse10)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_12| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_12|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_12| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_12| 24))) (let ((.cse14 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_12|) .cse13))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_$Pointer$#3.base| .cse14 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_12| v_DerPreprocessor_2) .cse14))) (and (= (store .cse12 .cse13 .cse14) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#3.base| .cse14) .cse12)))) (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_12| .cse14))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_12| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_12|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_12|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| Int)) (let ((.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| 24))) (let ((.cse15 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|) .cse17))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| .cse15) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_$Pointer$#3.base| .cse15 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) .cse15))) (and (= (store .cse16 .cse17 .cse15) v_DerPreprocessor_2) (= .cse16 (select |c_#memory_$Pointer$#3.base| .cse15))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (let ((.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24))) (let ((.cse20 (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) .cse19))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_$Pointer$#3.base| .cse20 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| v_DerPreprocessor_2) .cse20))) (and (= v_DerPreprocessor_2 (store .cse18 .cse19 .cse20)) (= (select |c_#memory_$Pointer$#3.base| .cse20) .cse18)))) (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| .cse20))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|))))) is different from true [2023-11-23 07:29:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 51 not checked. [2023-11-23 07:29:44,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:29:49,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:29:49,126 INFO L378 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 234 treesize of output 232 [2023-11-23 07:29:49,132 INFO L378 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 162 treesize of output 146 [2023-11-23 07:29:49,159 INFO L378 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 129 treesize of output 117 [2023-11-23 07:29:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2023-11-23 07:29:53,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7012843] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:29:53,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:29:53,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 24, 11] total 37 [2023-11-23 07:29:53,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647875967] [2023-11-23 07:29:53,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:29:53,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-23 07:29:53,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:29:53,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-23 07:29:53,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=679, Unknown=52, NotChecked=488, Total=1332 [2023-11-23 07:29:53,557 INFO L87 Difference]: Start difference. First operand 202 states and 279 transitions. Second operand has 37 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 17 states have call successors, (40), 9 states have call predecessors, (40), 12 states have return successors, (39), 15 states have call predecessors, (39), 17 states have call successors, (39) [2023-11-23 07:29:55,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:57,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:00,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:04,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:07,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:09,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:11,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:13,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:15,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:17,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:19,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:21,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:23,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:25,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:27,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:29,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:31,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:33,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:37,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:43,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:45,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:47,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:50,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:52,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:02,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:08,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:10,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:16,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:25,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:32,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:34,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:52,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:03,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:05,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:07,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:09,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:12,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:14,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:20,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:22,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:24,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:26,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:28,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:30,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:32,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:34,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:36,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:38,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:43,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:45,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:47,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:57,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:59,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:01,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:07,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:09,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:11,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:13,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:27,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:29,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:31,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:33,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15