./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_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_rbegin_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 3bef4637cc296c755ba815d09f028f51f0bde7e0d2e6155f2b5c648b5201a193 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:30:43,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:30:43,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:30:43,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:30:43,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:30:43,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:30:43,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:30:43,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:30:43,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:30:43,938 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:30:43,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:30:43,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:30:43,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:30:43,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:30:43,940 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:30:43,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:30:43,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:30:43,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:30:43,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:30:43,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:30:43,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:30:43,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:30:43,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:30:43,942 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:30:43,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:30:43,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:30:43,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:30:43,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:30:43,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:30:43,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:30:43,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:30:43,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:30:43,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:30:43,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:30:43,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:30:43,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:30:43,954 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:30:43,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:30:43,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:30:43,955 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 -> 3bef4637cc296c755ba815d09f028f51f0bde7e0d2e6155f2b5c648b5201a193 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:30:44,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:30:44,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:30:44,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:30:44,277 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:30:44,278 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:30:44,279 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_rbegin_harness.i [2023-11-23 07:30:45,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:30:45,935 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:30:45,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness.i [2023-11-23 07:30:45,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af2a97e7b/ef2ff7b1341745f0984fd8c5bce1a6d9/FLAGaeaf5473b [2023-11-23 07:30:45,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af2a97e7b/ef2ff7b1341745f0984fd8c5bce1a6d9 [2023-11-23 07:30:45,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:30:45,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:30:45,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:30:45,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:30:45,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:30:45,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:30:45" (1/1) ... [2023-11-23 07:30:45,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7182e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:45, skipping insertion in model container [2023-11-23 07:30:45,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:30:45" (1/1) ... [2023-11-23 07:30:46,066 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:30:46,286 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_rbegin_harness.i[4496,4509] [2023-11-23 07:30:46,294 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_rbegin_harness.i[4556,4569] [2023-11-23 07:30:46,831 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:46,832 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:46,833 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:46,837 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:46,840 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:46,857 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:46,865 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:46,867 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:46,867 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:46,869 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:46,869 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:46,870 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:46,878 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:47,101 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:30:47,102 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:30:47,103 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:30:47,104 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:30:47,106 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:30:47,106 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:30:47,107 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:30:47,107 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:30:47,108 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:30:47,117 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:30:47,251 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:30:47,264 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:30:47,273 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_rbegin_harness.i[4496,4509] [2023-11-23 07:30:47,274 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_rbegin_harness.i[4556,4569] [2023-11-23 07:30:47,367 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:47,372 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:47,372 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:47,372 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:47,373 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:47,389 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:47,389 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:47,390 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:47,390 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:47,390 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:47,391 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:47,391 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:47,391 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:47,429 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:30:47,433 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:30:47,440 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:30:47,441 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:30:47,441 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:30:47,442 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:30:47,442 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:30:47,443 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:30:47,443 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:30:47,443 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:30:47,465 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:30:47,562 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,562 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,562 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,562 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,563 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,563 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,563 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,563 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,563 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,563 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,563 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,564 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,564 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,564 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,565 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,565 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:47,572 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:30:47,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:47 WrapperNode [2023-11-23 07:30:47,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:30:47,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:30:47,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:30:47,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:30:47,579 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:30:47" (1/1) ... [2023-11-23 07:30:47,626 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:30:47" (1/1) ... [2023-11-23 07:30:47,653 INFO L138 Inliner]: procedures = 678, calls = 1041, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 141 [2023-11-23 07:30:47,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:30:47,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:30:47,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:30:47,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:30:47,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:47" (1/1) ... [2023-11-23 07:30:47,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:47" (1/1) ... [2023-11-23 07:30:47,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:47" (1/1) ... [2023-11-23 07:30:47,680 INFO L188 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2023-11-23 07:30:47,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:47" (1/1) ... [2023-11-23 07:30:47,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:47" (1/1) ... [2023-11-23 07:30:47,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:47" (1/1) ... [2023-11-23 07:30:47,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:47" (1/1) ... [2023-11-23 07:30:47,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:47" (1/1) ... [2023-11-23 07:30:47,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:47" (1/1) ... [2023-11-23 07:30:47,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:30:47,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:30:47,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:30:47,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:30:47,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:47" (1/1) ... [2023-11-23 07:30:47,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:30:47,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:30:47,756 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:30:47,773 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:30:47,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:30:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:30:47,809 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:30:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:30:47,809 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:30:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:30:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 07:30:47,810 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 07:30:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:30:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:30:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:30:47,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:30:47,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:30:47,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:30:47,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:30:47,811 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:30:47,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:30:47,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:30:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:30:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:30:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:30:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:30:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:30:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:30:47,812 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:30:47,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:30:47,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:30:47,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:30:48,023 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:30:48,029 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:30:48,182 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:30:48,207 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:30:48,207 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 07:30:48,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:30:48 BoogieIcfgContainer [2023-11-23 07:30:48,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:30:48,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:30:48,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:30:48,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:30:48,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:30:45" (1/3) ... [2023-11-23 07:30:48,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac1a1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:30:48, skipping insertion in model container [2023-11-23 07:30:48,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:47" (2/3) ... [2023-11-23 07:30:48,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac1a1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:30:48, skipping insertion in model container [2023-11-23 07:30:48,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:30:48" (3/3) ... [2023-11-23 07:30:48,214 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness.i [2023-11-23 07:30:48,227 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:30:48,227 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:30:48,262 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:30:48,266 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;@5817ac54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:30:48,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:30:48,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-23 07:30:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:30:48,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:48,311 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:30:48,312 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:48,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash 333379415, now seen corresponding path program 1 times [2023-11-23 07:30:48,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:48,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597265157] [2023-11-23 07:30:48,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:48,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:48,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:30:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:48,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:30:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:48,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:30:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:48,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:30:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:48,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:30:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:30:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:48,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:30:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 07:30:48,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:48,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597265157] [2023-11-23 07:30:48,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597265157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:48,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:30:48,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 07:30:48,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691222904] [2023-11-23 07:30:48,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:48,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:30:48,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:48,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:30:48,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:30:48,772 INFO L87 Difference]: Start difference. First operand has 60 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:30:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:48,822 INFO L93 Difference]: Finished difference Result 114 states and 170 transitions. [2023-11-23 07:30:48,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:30:48,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-23 07:30:48,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:48,832 INFO L225 Difference]: With dead ends: 114 [2023-11-23 07:30:48,834 INFO L226 Difference]: Without dead ends: 58 [2023-11-23 07:30:48,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:30:48,842 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:48,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:30:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-23 07:30:48,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-23 07:30:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 07:30:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2023-11-23 07:30:48,887 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 65 [2023-11-23 07:30:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:48,887 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2023-11-23 07:30:48,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:30:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2023-11-23 07:30:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:30:48,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:48,889 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:30:48,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:30:48,889 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:48,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:48,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1079899247, now seen corresponding path program 1 times [2023-11-23 07:30:48,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:48,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568464224] [2023-11-23 07:30:48,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:48,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:49,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:30:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:49,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:30:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:49,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:30:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:49,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:30:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:49,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:30:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:49,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:30:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:49,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:30:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:30:49,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568464224] [2023-11-23 07:30:49,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568464224] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:30:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404026603] [2023-11-23 07:30:49,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:49,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:30:49,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:30:49,373 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:30:49,395 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:30:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:49,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-23 07:30:49,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:30:49,646 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:30:49,655 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:30:49,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:49,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:49,744 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 42 treesize of output 22 [2023-11-23 07:30:49,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:49,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:49,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:49,765 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:30:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:30:50,604 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:30:50,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404026603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:50,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:30:50,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 07:30:50,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116450597] [2023-11-23 07:30:50,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:50,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:30:50,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:50,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:30:50,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:30:50,607 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 07:30:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:51,392 INFO L93 Difference]: Finished difference Result 160 states and 217 transitions. [2023-11-23 07:30:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:30:51,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2023-11-23 07:30:51,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:51,394 INFO L225 Difference]: With dead ends: 160 [2023-11-23 07:30:51,394 INFO L226 Difference]: Without dead ends: 110 [2023-11-23 07:30:51,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:30:51,395 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:51,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 362 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 07:30:51,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-23 07:30:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2023-11-23 07:30:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 76 states have internal predecessors, (100), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 07:30:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2023-11-23 07:30:51,448 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 65 [2023-11-23 07:30:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:51,448 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2023-11-23 07:30:51,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 07:30:51,449 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2023-11-23 07:30:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:30:51,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:51,451 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:30:51,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 07:30:51,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:30:51,665 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:51,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:51,665 INFO L85 PathProgramCache]: Analyzing trace with hash 418373195, now seen corresponding path program 1 times [2023-11-23 07:30:51,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:51,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053318066] [2023-11-23 07:30:51,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:51,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:51,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:30:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:51,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:30:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:51,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:30:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:30:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:51,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:30:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:51,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:30:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:51,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:30:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:30:51,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:51,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053318066] [2023-11-23 07:30:51,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053318066] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:30:51,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127855689] [2023-11-23 07:30:51,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:51,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:30:51,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:30:51,881 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:30:51,905 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:30:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-23 07:30:52,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:30:52,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2023-11-23 07:30:52,066 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 8 treesize of output 1 [2023-11-23 07:30:52,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 07:30:52,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:52,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-11-23 07:30:54,145 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse1 .cse0) .cse2)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) is different from true [2023-11-23 07:30:54,643 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse1 .cse0) .cse2)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse4 .cse3) .cse5)) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse3))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))))) is different from true [2023-11-23 07:30:57,197 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse1 .cse0) .cse2)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse4 .cse3) .cse5)) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse3))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|) .cse7 .cse6) .cse8)) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| .cse6))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|))))) is different from true [2023-11-23 07:31:13,593 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_3| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_3| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|) .cse1 .cse0) .cse2)) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3| .cse0))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_3| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse4 (select .cse3 .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) .cse5 .cse4))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| .cse4)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse7 .cse6) .cse8)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)) (.cse10 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse9 (select .cse11 .cse10))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse10 .cse9) .cse11)) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse9))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse12 (select .cse14 .cse13))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|) .cse13 .cse12) .cse14)) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| .cse12))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|))))) is different from true [2023-11-23 07:31:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2023-11-23 07:31:15,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:31:15,652 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2023-11-23 07:31:15,653 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 190 treesize of output 176 [2023-11-23 07:31:15,659 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 25 treesize of output 21 [2023-11-23 07:31:15,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:15,667 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 65 treesize of output 67 [2023-11-23 07:31:15,694 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 7 treesize of output 3 [2023-11-23 07:31:15,697 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 50 treesize of output 42 [2023-11-23 07:31:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:31:16,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127855689] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:16,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:31:16,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 19] total 31 [2023-11-23 07:31:16,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186875556] [2023-11-23 07:31:16,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:16,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:31:16,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:16,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:31:16,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=600, Unknown=26, NotChecked=212, Total=930 [2023-11-23 07:31:16,073 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 07:31:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:16,562 INFO L93 Difference]: Finished difference Result 183 states and 258 transitions. [2023-11-23 07:31:16,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:31:16,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 07:31:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:16,565 INFO L225 Difference]: With dead ends: 183 [2023-11-23 07:31:16,565 INFO L226 Difference]: Without dead ends: 124 [2023-11-23 07:31:16,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=115, Invalid=804, Unknown=27, NotChecked=244, Total=1190 [2023-11-23 07:31:16,567 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 47 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:16,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 398 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:31:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-23 07:31:16,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2023-11-23 07:31:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 78 states have internal predecessors, (102), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 07:31:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2023-11-23 07:31:16,580 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 65 [2023-11-23 07:31:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:16,580 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2023-11-23 07:31:16,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 07:31:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2023-11-23 07:31:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:31:16,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:16,582 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:31:16,595 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:31:16,795 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,SelfDestructingSolverStorable2 [2023-11-23 07:31:16,795 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:16,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:16,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1444145797, now seen corresponding path program 1 times [2023-11-23 07:31:16,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:16,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607102121] [2023-11-23 07:31:16,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:16,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:16,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:16,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:16,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:31:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:16,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:31:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:17,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:31:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:17,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:31:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:31:17,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:17,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607102121] [2023-11-23 07:31:17,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607102121] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:17,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365876350] [2023-11-23 07:31:17,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:17,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:17,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:17,049 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:31:17,050 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:31:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:17,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-23 07:31:17,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:17,215 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:31:17,219 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:31:17,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:17,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:17,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:17,286 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:31:17,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:17,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:17,296 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 42 treesize of output 22 [2023-11-23 07:31:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 07:31:18,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:18,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365876350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:18,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:18,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2023-11-23 07:31:18,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659058029] [2023-11-23 07:31:18,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:18,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:31:18,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:18,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:31:18,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:31:18,381 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 07:31:20,422 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:31:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:22,320 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2023-11-23 07:31:22,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:31:22,321 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 07:31:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:22,324 INFO L225 Difference]: With dead ends: 181 [2023-11-23 07:31:22,324 INFO L226 Difference]: Without dead ends: 117 [2023-11-23 07:31:22,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-11-23 07:31:22,328 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 80 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:22,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 408 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 324 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2023-11-23 07:31:22,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-23 07:31:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2023-11-23 07:31:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 80 states have internal predecessors, (104), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 07:31:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 150 transitions. [2023-11-23 07:31:22,356 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 150 transitions. Word has length 65 [2023-11-23 07:31:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:22,356 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 150 transitions. [2023-11-23 07:31:22,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 07:31:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 150 transitions. [2023-11-23 07:31:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:31:22,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:22,358 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:31:22,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-23 07:31:22,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:22,570 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:22,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:22,570 INFO L85 PathProgramCache]: Analyzing trace with hash -630861761, now seen corresponding path program 1 times [2023-11-23 07:31:22,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:22,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068148427] [2023-11-23 07:31:22,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:22,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:22,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:22,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:22,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:23,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:31:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:23,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:31:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:23,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:31:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:23,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:31:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:31:23,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:23,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068148427] [2023-11-23 07:31:23,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068148427] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:23,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930770678] [2023-11-23 07:31:23,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:23,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:23,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:23,092 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:31:23,109 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:31:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:23,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-23 07:31:23,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:23,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:31:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 07:31:24,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:24,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930770678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:24,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:24,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2023-11-23 07:31:24,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883061338] [2023-11-23 07:31:24,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:24,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:31:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:24,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:31:24,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-11-23 07:31:24,526 INFO L87 Difference]: Start difference. First operand 112 states and 150 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 07:31:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:25,221 INFO L93 Difference]: Finished difference Result 191 states and 256 transitions. [2023-11-23 07:31:25,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:31:25,222 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 07:31:25,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:25,223 INFO L225 Difference]: With dead ends: 191 [2023-11-23 07:31:25,223 INFO L226 Difference]: Without dead ends: 121 [2023-11-23 07:31:25,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2023-11-23 07:31:25,224 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 102 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:25,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 420 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 07:31:25,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-23 07:31:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2023-11-23 07:31:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.325) internal successors, (106), 82 states have internal predecessors, (106), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 07:31:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2023-11-23 07:31:25,233 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 65 [2023-11-23 07:31:25,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:25,233 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2023-11-23 07:31:25,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 07:31:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2023-11-23 07:31:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:31:25,234 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:25,234 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:31:25,249 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:31:25,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:25,435 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:25,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:25,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1848299655, now seen corresponding path program 1 times [2023-11-23 07:31:25,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:25,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055048538] [2023-11-23 07:31:25,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:25,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:25,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:25,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:25,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:31:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:25,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:31:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:25,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:31:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:25,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:31:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:31:25,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:25,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055048538] [2023-11-23 07:31:25,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055048538] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:25,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76322697] [2023-11-23 07:31:25,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:25,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:25,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:25,617 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:31:25,642 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:31:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:25,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 07:31:25,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:31:25,804 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:25,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76322697] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:25,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:25,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-23 07:31:25,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315976023] [2023-11-23 07:31:25,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:25,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 07:31:25,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:25,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 07:31:25,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:31:25,806 INFO L87 Difference]: Start difference. First operand 114 states and 152 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:25,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:25,863 INFO L93 Difference]: Finished difference Result 245 states and 336 transitions. [2023-11-23 07:31:25,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:31:25,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-23 07:31:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:25,865 INFO L225 Difference]: With dead ends: 245 [2023-11-23 07:31:25,865 INFO L226 Difference]: Without dead ends: 144 [2023-11-23 07:31:25,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:31:25,866 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 34 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:25,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 214 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:31:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-23 07:31:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2023-11-23 07:31:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 110 states have internal predecessors, (144), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2023-11-23 07:31:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 198 transitions. [2023-11-23 07:31:25,882 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 198 transitions. Word has length 65 [2023-11-23 07:31:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:25,882 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 198 transitions. [2023-11-23 07:31:25,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 198 transitions. [2023-11-23 07:31:25,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-23 07:31:25,884 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:25,885 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:31:25,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:26,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:26,089 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:26,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash 611626855, now seen corresponding path program 1 times [2023-11-23 07:31:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:26,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271389653] [2023-11-23 07:31:26,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:26,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:26,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:26,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:26,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:31:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:26,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:31:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:26,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 07:31:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:26,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 07:31:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:26,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 07:31:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 07:31:26,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:26,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271389653] [2023-11-23 07:31:26,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271389653] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:26,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525535382] [2023-11-23 07:31:26,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:26,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:26,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:26,331 INFO L229 MonitoredProcess]: Starting monitored process 7 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:31:26,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 07:31:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:26,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-23 07:31:26,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:26,561 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:31:26,575 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:31:26,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:26,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:26,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 07:31:26,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:26,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-23 07:31:26,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:26,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-23 07:31:26,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:26,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-23 07:31:26,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:26,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:26,771 INFO L349 Elim1Store]: treesize reduction 167, result has 9.2 percent of original size [2023-11-23 07:31:26,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 88 [2023-11-23 07:31:26,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:26,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 46 [2023-11-23 07:31:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:31:28,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:31:28,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:28,642 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 98 [2023-11-23 07:31:28,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:28,653 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-23 07:31:28,676 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 8 treesize of output 6 [2023-11-23 07:31:28,705 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_arrayElimArr_6))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_subst_1 Int)) (or (not (= (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16) (select v_arrayElimArr_5 v_subst_1))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_15| Int)) (= 0 (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_15|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_arrayElimArr_5))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2))))))))) is different from false [2023-11-23 07:31:28,722 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:28,723 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:28,823 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:31:28,823 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 179 treesize of output 208 [2023-11-23 07:31:28,834 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:28,835 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:28,917 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:31:28,918 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 363 treesize of output 350 [2023-11-23 07:31:28,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:28,945 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 296 treesize of output 294 [2023-11-23 07:31:28,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:28,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 250 [2023-11-23 07:31:28,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:28,983 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 346 treesize of output 324 [2023-11-23 07:31:28,996 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 291 treesize of output 279 [2023-11-23 07:31:29,491 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 8 treesize of output 4 [2023-11-23 07:31:29,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:29,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 154 [2023-11-23 07:31:29,775 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:29,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:29,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 64 [2023-11-23 07:31:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2023-11-23 07:31:29,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525535382] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:31:29,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:31:29,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2023-11-23 07:31:29,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521651683] [2023-11-23 07:31:29,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:31:29,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-23 07:31:29,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:29,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-23 07:31:29,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=401, Unknown=1, NotChecked=40, Total=506 [2023-11-23 07:31:29,891 INFO L87 Difference]: Start difference. First operand 144 states and 198 transitions. Second operand has 23 states, 20 states have (on average 4.5) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2023-11-23 07:31:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:32,346 INFO L93 Difference]: Finished difference Result 299 states and 430 transitions. [2023-11-23 07:31:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-23 07:31:32,347 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 4.5) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) Word has length 66 [2023-11-23 07:31:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:32,348 INFO L225 Difference]: With dead ends: 299 [2023-11-23 07:31:32,348 INFO L226 Difference]: Without dead ends: 225 [2023-11-23 07:31:32,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=162, Invalid=1173, Unknown=1, NotChecked=70, Total=1406 [2023-11-23 07:31:32,350 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 98 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:32,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1027 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 848 Invalid, 0 Unknown, 155 Unchecked, 1.6s Time] [2023-11-23 07:31:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-23 07:31:32,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 217. [2023-11-23 07:31:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 160 states have (on average 1.36875) internal successors, (219), 168 states have internal predecessors, (219), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2023-11-23 07:31:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 304 transitions. [2023-11-23 07:31:32,367 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 304 transitions. Word has length 66 [2023-11-23 07:31:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:32,367 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 304 transitions. [2023-11-23 07:31:32,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 4.5) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2023-11-23 07:31:32,367 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 304 transitions. [2023-11-23 07:31:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 07:31:32,368 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:32,368 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:32,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-23 07:31:32,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:32,573 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:32,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:32,574 INFO L85 PathProgramCache]: Analyzing trace with hash 714140445, now seen corresponding path program 1 times [2023-11-23 07:31:32,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:32,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089953655] [2023-11-23 07:31:32,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:32,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:32,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:32,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:32,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:32,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:31:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:32,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 07:31:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:32,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 07:31:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:32,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 07:31:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:31:32,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:32,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089953655] [2023-11-23 07:31:32,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089953655] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:32,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017012612] [2023-11-23 07:31:32,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:32,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:32,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:32,784 INFO L229 MonitoredProcess]: Starting monitored process 8 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:31:32,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 07:31:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:32,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 07:31:32,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:31:32,996 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:32,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017012612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:32,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:32,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 07:31:32,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674115575] [2023-11-23 07:31:32,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:32,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:31:32,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:32,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:31:32,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:31:32,997 INFO L87 Difference]: Start difference. First operand 217 states and 304 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:33,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:33,129 INFO L93 Difference]: Finished difference Result 436 states and 615 transitions. [2023-11-23 07:31:33,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:31:33,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2023-11-23 07:31:33,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:33,131 INFO L225 Difference]: With dead ends: 436 [2023-11-23 07:31:33,131 INFO L226 Difference]: Without dead ends: 235 [2023-11-23 07:31:33,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:31:33,132 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 33 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:33,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 236 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:31:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-11-23 07:31:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 217. [2023-11-23 07:31:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 160 states have (on average 1.36875) internal successors, (219), 168 states have internal predecessors, (219), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2023-11-23 07:31:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 304 transitions. [2023-11-23 07:31:33,148 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 304 transitions. Word has length 67 [2023-11-23 07:31:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:33,148 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 304 transitions. [2023-11-23 07:31:33,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 304 transitions. [2023-11-23 07:31:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 07:31:33,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:33,149 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:33,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:33,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:33,363 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:33,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1041179350, now seen corresponding path program 1 times [2023-11-23 07:31:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:33,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363554981] [2023-11-23 07:31:33,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:33,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:33,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:33,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:33,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:31:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:33,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:31:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:33,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:31:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 07:31:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 07:31:33,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:33,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363554981] [2023-11-23 07:31:33,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363554981] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:33,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233343430] [2023-11-23 07:31:33,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:33,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:33,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:33,588 INFO L229 MonitoredProcess]: Starting monitored process 9 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:31:33,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 07:31:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:33,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:31:33,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:31:33,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:33,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233343430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:33,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:33,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2023-11-23 07:31:33,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988526019] [2023-11-23 07:31:33,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:33,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:31:33,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:33,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:31:33,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:31:33,848 INFO L87 Difference]: Start difference. First operand 217 states and 304 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:34,061 INFO L93 Difference]: Finished difference Result 481 states and 684 transitions. [2023-11-23 07:31:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:31:34,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2023-11-23 07:31:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:34,063 INFO L225 Difference]: With dead ends: 481 [2023-11-23 07:31:34,063 INFO L226 Difference]: Without dead ends: 280 [2023-11-23 07:31:34,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:31:34,064 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 57 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:34,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 278 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:31:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-11-23 07:31:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 220. [2023-11-23 07:31:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 163 states have (on average 1.3803680981595092) internal successors, (225), 171 states have internal predecessors, (225), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2023-11-23 07:31:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 310 transitions. [2023-11-23 07:31:34,081 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 310 transitions. Word has length 69 [2023-11-23 07:31:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:34,081 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 310 transitions. [2023-11-23 07:31:34,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 310 transitions. [2023-11-23 07:31:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 07:31:34,082 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:34,083 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:34,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:34,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-23 07:31:34,297 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:34,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:34,298 INFO L85 PathProgramCache]: Analyzing trace with hash 98444781, now seen corresponding path program 1 times [2023-11-23 07:31:34,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:34,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290362791] [2023-11-23 07:31:34,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:34,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:34,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:34,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:34,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:34,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:31:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:34,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 07:31:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:34,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:31:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:34,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 07:31:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 07:31:34,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:34,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290362791] [2023-11-23 07:31:34,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290362791] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:34,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716580260] [2023-11-23 07:31:34,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:34,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:34,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:34,435 INFO L229 MonitoredProcess]: Starting monitored process 10 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:31:34,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 07:31:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:34,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 07:31:34,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 07:31:34,578 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:34,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716580260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:34,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:34,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-23 07:31:34,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340942433] [2023-11-23 07:31:34,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:34,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 07:31:34,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:34,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 07:31:34,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:31:34,580 INFO L87 Difference]: Start difference. First operand 220 states and 310 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:34,635 INFO L93 Difference]: Finished difference Result 454 states and 666 transitions. [2023-11-23 07:31:34,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 07:31:34,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2023-11-23 07:31:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:34,637 INFO L225 Difference]: With dead ends: 454 [2023-11-23 07:31:34,637 INFO L226 Difference]: Without dead ends: 250 [2023-11-23 07:31:34,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:31:34,638 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:34,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 130 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:31:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-11-23 07:31:34,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 229. [2023-11-23 07:31:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 172 states have (on average 1.377906976744186) internal successors, (237), 180 states have internal predecessors, (237), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2023-11-23 07:31:34,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 322 transitions. [2023-11-23 07:31:34,668 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 322 transitions. Word has length 70 [2023-11-23 07:31:34,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:34,668 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 322 transitions. [2023-11-23 07:31:34,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:31:34,668 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 322 transitions. [2023-11-23 07:31:34,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 07:31:34,670 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:34,670 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:34,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-23 07:31:34,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 07:31:34,882 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:34,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:34,883 INFO L85 PathProgramCache]: Analyzing trace with hash -293677218, now seen corresponding path program 1 times [2023-11-23 07:31:34,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:34,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850433562] [2023-11-23 07:31:34,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:34,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:35,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:35,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:35,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:31:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:35,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:31:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:35,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:31:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:35,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:31:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:35,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:31:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:31:35,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:35,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850433562] [2023-11-23 07:31:35,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850433562] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:35,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951722080] [2023-11-23 07:31:35,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:35,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:35,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:35,236 INFO L229 MonitoredProcess]: Starting monitored process 11 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:31:35,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 07:31:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:35,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:31:35,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 07:31:35,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:35,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951722080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:35,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:35,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-11-23 07:31:35,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202432691] [2023-11-23 07:31:35,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:35,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:31:35,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:35,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:31:35,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:31:35,539 INFO L87 Difference]: Start difference. First operand 229 states and 322 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:31:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:35,637 INFO L93 Difference]: Finished difference Result 445 states and 616 transitions. [2023-11-23 07:31:35,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:31:35,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 77 [2023-11-23 07:31:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:35,639 INFO L225 Difference]: With dead ends: 445 [2023-11-23 07:31:35,639 INFO L226 Difference]: Without dead ends: 180 [2023-11-23 07:31:35,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:31:35,642 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 36 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:35,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 294 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:31:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-23 07:31:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2023-11-23 07:31:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 126 states have (on average 1.2777777777777777) internal successors, (161), 134 states have internal predecessors, (161), 35 states have call successors, (35), 13 states have call predecessors, (35), 18 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2023-11-23 07:31:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 240 transitions. [2023-11-23 07:31:35,657 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 240 transitions. Word has length 77 [2023-11-23 07:31:35,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:35,657 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 240 transitions. [2023-11-23 07:31:35,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:31:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 240 transitions. [2023-11-23 07:31:35,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-23 07:31:35,658 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:35,658 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:35,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:35,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 07:31:35,870 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:35,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:35,870 INFO L85 PathProgramCache]: Analyzing trace with hash -940653504, now seen corresponding path program 1 times [2023-11-23 07:31:35,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:35,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916338034] [2023-11-23 07:31:35,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:36,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:36,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:36,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:31:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:36,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:31:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:36,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 07:31:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:36,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 07:31:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:31:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:36,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:31:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 07:31:36,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:36,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916338034] [2023-11-23 07:31:36,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916338034] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:36,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894652695] [2023-11-23 07:31:36,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:36,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:36,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:36,125 INFO L229 MonitoredProcess]: Starting monitored process 12 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:31:36,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 07:31:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:36,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-23 07:31:36,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:36,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2023-11-23 07:31:36,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 25 [2023-11-23 07:31:36,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-23 07:31:36,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2023-11-23 07:31:36,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:36,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-23 07:31:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 07:31:36,991 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:36,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894652695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:36,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:36,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2023-11-23 07:31:36,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092258565] [2023-11-23 07:31:36,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:36,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:31:36,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:36,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:31:36,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:31:36,993 INFO L87 Difference]: Start difference. First operand 180 states and 240 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:31:38,998 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:41,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:43,082 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:31:46,060 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:31:48,165 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:50,336 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,380 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,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:52,594 INFO L93 Difference]: Finished difference Result 340 states and 465 transitions. [2023-11-23 07:31:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:31:52,594 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 78 [2023-11-23 07:31:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:52,595 INFO L225 Difference]: With dead ends: 340 [2023-11-23 07:31:52,595 INFO L226 Difference]: Without dead ends: 192 [2023-11-23 07:31:52,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2023-11-23 07:31:52,596 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 77 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 21 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:52,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 386 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 15.4s Time] [2023-11-23 07:31:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-11-23 07:31:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 128. [2023-11-23 07:31:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 95 states have internal predecessors, (112), 24 states have call successors, (24), 10 states have call predecessors, (24), 13 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2023-11-23 07:31:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2023-11-23 07:31:52,608 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 78 [2023-11-23 07:31:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:52,608 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2023-11-23 07:31:52,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:31:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2023-11-23 07:31:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-23 07:31:52,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:52,609 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:52,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:52,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 07:31:52,822 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:52,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:52,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1843153604, now seen corresponding path program 1 times [2023-11-23 07:31:52,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:52,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967930025] [2023-11-23 07:31:52,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:52,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:31:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:31:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 07:31:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:52,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 07:31:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:53,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:31:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:53,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:31:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 07:31:53,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:53,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967930025] [2023-11-23 07:31:53,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967930025] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:53,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473707862] [2023-11-23 07:31:53,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:53,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:53,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:53,009 INFO L229 MonitoredProcess]: Starting monitored process 13 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:31:53,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 07:31:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:53,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-23 07:31:53,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:53,269 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:31:53,278 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:31:53,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:53,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:53,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 07:31:53,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:53,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-23 07:31:53,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:53,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-23 07:31:53,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:53,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-23 07:31:53,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:53,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:53,506 INFO L349 Elim1Store]: treesize reduction 167, result has 9.2 percent of original size [2023-11-23 07:31:53,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 88 [2023-11-23 07:31:53,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:53,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 44 [2023-11-23 07:31:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:31:55,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:31:55,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:55,681 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 98 [2023-11-23 07:31:55,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:55,690 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-23 07:31:55,702 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 8 treesize of output 6 [2023-11-23 07:31:55,760 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| Int)) (or (forall ((v_arrayElimArr_12 (Array Int Int)) (v_subst_4 Int)) (or (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_17| Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_17|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| v_arrayElimArr_12))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_4))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (not (= (select v_arrayElimArr_12 v_subst_4) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| v_arrayElimArr_13))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| 1)))))) is different from false [2023-11-23 07:31:55,774 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:55,775 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:55,866 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2023-11-23 07:31:55,866 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 305 treesize of output 292 [2023-11-23 07:31:55,879 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:55,880 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:55,970 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2023-11-23 07:31:55,971 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 371 treesize of output 358 [2023-11-23 07:31:55,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:55,994 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 304 treesize of output 302 [2023-11-23 07:31:56,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:56,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 258 [2023-11-23 07:31:56,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:56,037 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 354 treesize of output 328 [2023-11-23 07:31:56,055 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 295 treesize of output 283 [2023-11-23 07:31:56,507 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 8 treesize of output 4 [2023-11-23 07:31:56,540 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 8 treesize of output 4 [2023-11-23 07:31:56,870 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:56,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:56,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 115 [2023-11-23 07:31:56,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-23 07:31:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2023-11-23 07:31:57,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473707862] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:31:57,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:31:57,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 26 [2023-11-23 07:31:57,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941275746] [2023-11-23 07:31:57,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:31:57,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 07:31:57,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:57,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 07:31:57,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=529, Unknown=1, NotChecked=46, Total=650 [2023-11-23 07:31:57,034 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand has 26 states, 23 states have (on average 4.956521739130435) internal successors, (114), 25 states have internal predecessors, (114), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-23 07:32:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:32:00,911 INFO L93 Difference]: Finished difference Result 385 states and 528 transitions. [2023-11-23 07:32:00,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-23 07:32:00,911 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 4.956521739130435) internal successors, (114), 25 states have internal predecessors, (114), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) Word has length 78 [2023-11-23 07:32:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:32:00,912 INFO L225 Difference]: With dead ends: 385 [2023-11-23 07:32:00,912 INFO L226 Difference]: Without dead ends: 218 [2023-11-23 07:32:00,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 153 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=320, Invalid=2335, Unknown=1, NotChecked=100, Total=2756 [2023-11-23 07:32:00,914 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 162 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:32:00,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1170 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1173 Invalid, 0 Unknown, 211 Unchecked, 2.2s Time] [2023-11-23 07:32:00,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-11-23 07:32:00,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 134. [2023-11-23 07:32:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 95 states have (on average 1.231578947368421) internal successors, (117), 101 states have internal predecessors, (117), 24 states have call successors, (24), 10 states have call predecessors, (24), 14 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 07:32:00,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 173 transitions. [2023-11-23 07:32:00,929 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 173 transitions. Word has length 78 [2023-11-23 07:32:00,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:32:00,929 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 173 transitions. [2023-11-23 07:32:00,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 4.956521739130435) internal successors, (114), 25 states have internal predecessors, (114), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-23 07:32:00,930 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2023-11-23 07:32:00,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 07:32:00,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:32:00,930 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:32:00,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 07:32:01,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 07:32:01,145 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:32:01,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:32:01,168 INFO L85 PathProgramCache]: Analyzing trace with hash -849551483, now seen corresponding path program 1 times [2023-11-23 07:32:01,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:32:01,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400165164] [2023-11-23 07:32:01,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:32:01,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:32:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:01,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:01,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:32:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:01,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:32:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:32:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:01,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:32:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:32:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:01,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:32:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:01,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:32:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 07:32:01,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:32:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400165164] [2023-11-23 07:32:01,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400165164] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:32:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313658059] [2023-11-23 07:32:01,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:32:01,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:32:01,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:32:01,532 INFO L229 MonitoredProcess]: Starting monitored process 14 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:32:01,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 07:32:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:01,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-23 07:32:01,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:32:01,872 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 07:32:01,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:32:01,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 07:32:01,964 INFO L349 Elim1Store]: treesize reduction 68, result has 9.3 percent of original size [2023-11-23 07:32:01,964 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 29 [2023-11-23 07:32:04,009 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_56| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_56|))) (let ((.cse0 (select .cse1 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_43|))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_56|) (= .cse0 (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (not (= .cse0 0)))))) is different from true [2023-11-23 07:32:06,224 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24)) .cse1) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (not (= 0 .cse1)))))) is different from true [2023-11-23 07:32:08,337 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_22| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_21| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_22|))) (let ((.cse0 (select .cse1 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_21|))) (and (not (= .cse0 0)) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_22|) (= (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_21| 24)) .cse0))))) is different from true [2023-11-23 07:32:08,659 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2023-11-23 07:32:08,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:32:09,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:09,034 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 39 [2023-11-23 07:32:09,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:09,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 215 treesize of output 207 [2023-11-23 07:32:09,073 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 280 treesize of output 272 [2023-11-23 07:32:09,253 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 6 treesize of output 4 [2023-11-23 07:32:09,262 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 26 treesize of output 24 [2023-11-23 07:32:09,275 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 6 treesize of output 4 [2023-11-23 07:32:09,303 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 6 treesize of output 4 [2023-11-23 07:32:09,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:09,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 116 [2023-11-23 07:32:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 07:32:09,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313658059] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:32:09,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:32:09,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 11] total 29 [2023-11-23 07:32:09,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601710427] [2023-11-23 07:32:09,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:32:09,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-23 07:32:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:32:09,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-23 07:32:09,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=582, Unknown=3, NotChecked=150, Total=812 [2023-11-23 07:32:09,635 INFO L87 Difference]: Start difference. First operand 134 states and 173 transitions. Second operand has 29 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 28 states have internal predecessors, (128), 10 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (22), 8 states have call predecessors, (22), 10 states have call successors, (22) [2023-11-23 07:32:12,017 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,078 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:16,199 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:39,618 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:41,627 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:43,634 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:51,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:32:51,181 INFO L93 Difference]: Finished difference Result 419 states and 584 transitions. [2023-11-23 07:32:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-23 07:32:51,182 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 28 states have internal predecessors, (128), 10 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (22), 8 states have call predecessors, (22), 10 states have call successors, (22) Word has length 80 [2023-11-23 07:32:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:32:51,183 INFO L225 Difference]: With dead ends: 419 [2023-11-23 07:32:51,183 INFO L226 Difference]: Without dead ends: 221 [2023-11-23 07:32:51,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 164 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=452, Invalid=2966, Unknown=16, NotChecked=348, Total=3782 [2023-11-23 07:32:51,185 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 335 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 73 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 1167 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2023-11-23 07:32:51,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1079 Invalid, 2735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1489 Invalid, 6 Unknown, 1167 Unchecked, 13.8s Time] [2023-11-23 07:32:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-11-23 07:32:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 195. [2023-11-23 07:32:51,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 150 states have internal predecessors, (174), 33 states have call successors, (33), 14 states have call predecessors, (33), 18 states have return successors, (44), 30 states have call predecessors, (44), 31 states have call successors, (44) [2023-11-23 07:32:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 251 transitions. [2023-11-23 07:32:51,213 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 251 transitions. Word has length 80 [2023-11-23 07:32:51,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:32:51,214 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 251 transitions. [2023-11-23 07:32:51,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 28 states have internal predecessors, (128), 10 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (22), 8 states have call predecessors, (22), 10 states have call successors, (22) [2023-11-23 07:32:51,214 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 251 transitions. [2023-11-23 07:32:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-23 07:32:51,215 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:32:51,216 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:32:51,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-23 07:32:51,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 07:32:51,428 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:32:51,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:32:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash -850121196, now seen corresponding path program 1 times [2023-11-23 07:32:51,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:32:51,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141902150] [2023-11-23 07:32:51,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:32:51,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:32:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:51,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:51,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:32:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:51,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:32:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:51,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:32:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:51,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:32:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:51,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:32:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:51,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:32:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:51,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:32:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 07:32:51,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:32:51,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141902150] [2023-11-23 07:32:51,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141902150] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:32:51,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682444450] [2023-11-23 07:32:51,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:32:51,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:32:51,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:32:51,813 INFO L229 MonitoredProcess]: Starting monitored process 15 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:32:51,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 07:32:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:51,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 07:32:51,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:32:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 07:32:52,124 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:32:52,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682444450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:32:52,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:32:52,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2023-11-23 07:32:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858779631] [2023-11-23 07:32:52,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:32:52,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:32:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:32:52,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:32:52,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:32:52,125 INFO L87 Difference]: Start difference. First operand 195 states and 251 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:32:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:32:52,326 INFO L93 Difference]: Finished difference Result 308 states and 389 transitions. [2023-11-23 07:32:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 07:32:52,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 84 [2023-11-23 07:32:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:32:52,327 INFO L225 Difference]: With dead ends: 308 [2023-11-23 07:32:52,328 INFO L226 Difference]: Without dead ends: 189 [2023-11-23 07:32:52,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2023-11-23 07:32:52,328 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 31 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:32:52,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 252 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:32:52,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-11-23 07:32:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2023-11-23 07:32:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 144 states have internal predecessors, (166), 33 states have call successors, (33), 14 states have call predecessors, (33), 16 states have return successors, (40), 30 states have call predecessors, (40), 31 states have call successors, (40) [2023-11-23 07:32:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 239 transitions. [2023-11-23 07:32:52,354 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 239 transitions. Word has length 84 [2023-11-23 07:32:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:32:52,355 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 239 transitions. [2023-11-23 07:32:52,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:32:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 239 transitions. [2023-11-23 07:32:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-23 07:32:52,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:32:52,356 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:32:52,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-23 07:32:52,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:32:52,576 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:32:52,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:32:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1350102166, now seen corresponding path program 1 times [2023-11-23 07:32:52,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:32:52,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202251887] [2023-11-23 07:32:52,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:32:52,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:32:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:52,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:32:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:52,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:32:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:52,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:32:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:52,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:32:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:52,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:32:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:52,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:32:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:32:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:52,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:32:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:52,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:32:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:52,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:32:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-23 07:32:52,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:32:52,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202251887] [2023-11-23 07:32:52,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202251887] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:32:52,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256806276] [2023-11-23 07:32:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:32:52,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:32:52,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:32:52,875 INFO L229 MonitoredProcess]: Starting monitored process 16 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:32:52,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-23 07:32:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:32:53,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-23 07:32:53,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:32:53,182 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 7 [2023-11-23 07:32:53,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-23 07:32:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 52 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 07:32:55,983 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:33:02,537 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:33:02,754 INFO L349 Elim1Store]: treesize reduction 272, result has 48.2 percent of original size [2023-11-23 07:33:02,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 4452 treesize of output 3361 [2023-11-23 07:33:03,010 INFO L349 Elim1Store]: treesize reduction 8, result has 91.0 percent of original size [2023-11-23 07:33:03,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1719 treesize of output 1721 [2023-11-23 07:33:03,044 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:33:03,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1535 treesize of output 1431 [2023-11-23 07:33:04,237 INFO L349 Elim1Store]: treesize reduction 727, result has 37.6 percent of original size [2023-11-23 07:33:04,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 56 case distinctions, treesize of input 6358 treesize of output 5144 [2023-11-23 07:33:04,620 INFO L349 Elim1Store]: treesize reduction 39, result has 75.0 percent of original size [2023-11-23 07:33:04,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2496 treesize of output 2481 [2023-11-23 07:33:04,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:04,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2162 treesize of output 2171 [2023-11-23 07:33:08,075 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:15,563 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:15,590 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 8 treesize of output 6 [2023-11-23 07:33:18,533 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 6 treesize of output 4 [2023-11-23 07:33:18,779 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 6 treesize of output 4 [2023-11-23 07:33:18,846 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 6 treesize of output 4 [2023-11-23 07:33:19,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:19,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1273 treesize of output 1265 [2023-11-23 07:33:20,061 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:20,088 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:20,105 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:20,119 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:20,137 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:20,161 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:20,425 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:20,456 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:20,473 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:20,490 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:20,511 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:20,536 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:20,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:20,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1273 treesize of output 1265 [2023-11-23 07:33:22,124 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 8 treesize of output 6 [2023-11-23 07:33:22,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:22,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 895 treesize of output 847 [2023-11-23 07:33:22,670 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 8 treesize of output 6 [2023-11-23 07:33:22,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-11-23 07:33:22,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-11-23 07:33:23,308 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-23 07:33:23,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-11-23 07:33:23,349 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:33:23,459 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 8 treesize of output 6 [2023-11-23 07:33:23,476 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 8 treesize of output 6 [2023-11-23 07:33:23,573 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 8 treesize of output 6 [2023-11-23 07:33:23,580 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 8 treesize of output 6 [2023-11-23 07:33:23,601 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 8 treesize of output 6 [2023-11-23 07:33:23,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:23,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 249 treesize of output 271 [2023-11-23 07:33:23,966 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 8 treesize of output 6 [2023-11-23 07:33:23,972 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 8 treesize of output 6 [2023-11-23 07:33:23,975 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 8 treesize of output 6 [2023-11-23 07:33:24,024 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-11-23 07:33:24,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 271 treesize of output 1 [2023-11-23 07:33:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 29 proven. 41 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 07:33:24,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256806276] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:33:24,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:33:24,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 27, 25] total 55 [2023-11-23 07:33:24,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225938675] [2023-11-23 07:33:24,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:33:24,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-23 07:33:24,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:33:24,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-23 07:33:24,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2745, Unknown=2, NotChecked=0, Total=2970 [2023-11-23 07:33:24,210 INFO L87 Difference]: Start difference. First operand 189 states and 239 transitions. Second operand has 55 states, 48 states have (on average 3.4791666666666665) internal successors, (167), 48 states have internal predecessors, (167), 16 states have call successors, (28), 4 states have call predecessors, (28), 13 states have return successors, (27), 16 states have call predecessors, (27), 16 states have call successors, (27) [2023-11-23 07:33:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:33:33,603 INFO L93 Difference]: Finished difference Result 362 states and 478 transitions. [2023-11-23 07:33:33,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-11-23 07:33:33,603 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 48 states have (on average 3.4791666666666665) internal successors, (167), 48 states have internal predecessors, (167), 16 states have call successors, (28), 4 states have call predecessors, (28), 13 states have return successors, (27), 16 states have call predecessors, (27), 16 states have call successors, (27) Word has length 104 [2023-11-23 07:33:33,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:33:33,605 INFO L225 Difference]: With dead ends: 362 [2023-11-23 07:33:33,605 INFO L226 Difference]: Without dead ends: 251 [2023-11-23 07:33:33,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 183 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1129, Invalid=9171, Unknown=2, NotChecked=0, Total=10302 [2023-11-23 07:33:33,608 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 430 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 2446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-23 07:33:33,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1440 Invalid, 2446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-23 07:33:33,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-11-23 07:33:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 192. [2023-11-23 07:33:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 141 states have (on average 1.177304964539007) internal successors, (166), 146 states have internal predecessors, (166), 33 states have call successors, (33), 14 states have call predecessors, (33), 17 states have return successors, (40), 31 states have call predecessors, (40), 31 states have call successors, (40) [2023-11-23 07:33:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 239 transitions. [2023-11-23 07:33:33,641 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 239 transitions. Word has length 104 [2023-11-23 07:33:33,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:33:33,641 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 239 transitions. [2023-11-23 07:33:33,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 48 states have (on average 3.4791666666666665) internal successors, (167), 48 states have internal predecessors, (167), 16 states have call successors, (28), 4 states have call predecessors, (28), 13 states have return successors, (27), 16 states have call predecessors, (27), 16 states have call successors, (27) [2023-11-23 07:33:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 239 transitions. [2023-11-23 07:33:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 07:33:33,643 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:33:33,643 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:33:33,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-23 07:33:33,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 07:33:33,855 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:33:33,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:33:33,855 INFO L85 PathProgramCache]: Analyzing trace with hash 602769734, now seen corresponding path program 1 times [2023-11-23 07:33:33,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:33:33,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600870066] [2023-11-23 07:33:33,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:33,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:33:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:34,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:33:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:34,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:33:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:34,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:33:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:34,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:34,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:33:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:34,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:33:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:34,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:34,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:33:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:34,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:33:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:34,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 5 proven. 59 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-23 07:33:34,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:33:34,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600870066] [2023-11-23 07:33:34,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600870066] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:33:34,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453325870] [2023-11-23 07:33:34,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:34,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:33:34,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:33:34,629 INFO L229 MonitoredProcess]: Starting monitored process 17 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:33:34,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-23 07:33:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:34,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-23 07:33:34,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:33:34,928 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 13 treesize of output 1 [2023-11-23 07:33:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 78 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:33:35,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:33:37,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 227 [2023-11-23 07:33:37,167 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 51 treesize of output 47 [2023-11-23 07:33:37,172 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 53 treesize of output 45 [2023-11-23 07:33:37,237 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 7 proven. 66 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-23 07:33:37,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453325870] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:33:37,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:33:37,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 19] total 50 [2023-11-23 07:33:37,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787659546] [2023-11-23 07:33:37,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:33:37,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-23 07:33:37,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:33:37,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-23 07:33:37,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2257, Unknown=0, NotChecked=0, Total=2450 [2023-11-23 07:33:37,245 INFO L87 Difference]: Start difference. First operand 192 states and 239 transitions. Second operand has 50 states, 46 states have (on average 3.869565217391304) internal successors, (178), 47 states have internal predecessors, (178), 18 states have call successors, (27), 3 states have call predecessors, (27), 12 states have return successors, (27), 14 states have call predecessors, (27), 18 states have call successors, (27) [2023-11-23 07:33:39,253 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:41,311 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:33:43,382 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:33:45,448 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:33:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:33:48,951 INFO L93 Difference]: Finished difference Result 708 states and 970 transitions. [2023-11-23 07:33:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-23 07:33:48,952 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 3.869565217391304) internal successors, (178), 47 states have internal predecessors, (178), 18 states have call successors, (27), 3 states have call predecessors, (27), 12 states have return successors, (27), 14 states have call predecessors, (27), 18 states have call successors, (27) Word has length 107 [2023-11-23 07:33:48,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:33:48,954 INFO L225 Difference]: With dead ends: 708 [2023-11-23 07:33:48,954 INFO L226 Difference]: Without dead ends: 510 [2023-11-23 07:33:48,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1606 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=854, Invalid=6118, Unknown=0, NotChecked=0, Total=6972 [2023-11-23 07:33:48,957 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 389 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 2201 mSolverCounterSat, 118 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2201 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:33:48,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1184 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2201 Invalid, 4 Unknown, 0 Unchecked, 10.2s Time] [2023-11-23 07:33:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2023-11-23 07:33:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 386. [2023-11-23 07:33:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 286 states have (on average 1.2167832167832169) internal successors, (348), 297 states have internal predecessors, (348), 61 states have call successors, (61), 24 states have call predecessors, (61), 38 states have return successors, (99), 64 states have call predecessors, (99), 57 states have call successors, (99) [2023-11-23 07:33:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 508 transitions. [2023-11-23 07:33:49,047 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 508 transitions. Word has length 107 [2023-11-23 07:33:49,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:33:49,048 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 508 transitions. [2023-11-23 07:33:49,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 3.869565217391304) internal successors, (178), 47 states have internal predecessors, (178), 18 states have call successors, (27), 3 states have call predecessors, (27), 12 states have return successors, (27), 14 states have call predecessors, (27), 18 states have call successors, (27) [2023-11-23 07:33:49,048 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 508 transitions. [2023-11-23 07:33:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 07:33:49,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:33:49,050 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:33:49,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-23 07:33:49,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-23 07:33:49,264 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:33:49,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:33:49,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2065351562, now seen corresponding path program 1 times [2023-11-23 07:33:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:33:49,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328642032] [2023-11-23 07:33:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:33:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:33:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:33:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:33:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:33:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:33:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:33:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:33:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 41 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 07:33:49,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:33:49,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328642032] [2023-11-23 07:33:49,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328642032] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:33:49,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737450990] [2023-11-23 07:33:49,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:49,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:33:49,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:33:49,728 INFO L229 MonitoredProcess]: Starting monitored process 18 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:33:49,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-23 07:33:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:49,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-23 07:33:49,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:33:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-23 07:33:50,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:33:50,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737450990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:33:50,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:33:50,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2023-11-23 07:33:50,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054609545] [2023-11-23 07:33:50,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:33:50,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:33:50,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:33:50,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:33:50,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2023-11-23 07:33:50,177 INFO L87 Difference]: Start difference. First operand 386 states and 508 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-23 07:33:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:33:50,653 INFO L93 Difference]: Finished difference Result 831 states and 1126 transitions. [2023-11-23 07:33:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:33:50,653 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 107 [2023-11-23 07:33:50,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:33:50,655 INFO L225 Difference]: With dead ends: 831 [2023-11-23 07:33:50,655 INFO L226 Difference]: Without dead ends: 407 [2023-11-23 07:33:50,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2023-11-23 07:33:50,657 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 47 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:33:50,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 423 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:33:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-11-23 07:33:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 384. [2023-11-23 07:33:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 284 states have (on average 1.2112676056338028) internal successors, (344), 297 states have internal predecessors, (344), 61 states have call successors, (61), 24 states have call predecessors, (61), 38 states have return successors, (98), 62 states have call predecessors, (98), 57 states have call successors, (98) [2023-11-23 07:33:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 503 transitions. [2023-11-23 07:33:50,722 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 503 transitions. Word has length 107 [2023-11-23 07:33:50,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:33:50,722 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 503 transitions. [2023-11-23 07:33:50,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-23 07:33:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 503 transitions. [2023-11-23 07:33:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-23 07:33:50,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:33:50,724 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:33:50,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-23 07:33:50,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-23 07:33:50,936 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:33:50,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:33:50,936 INFO L85 PathProgramCache]: Analyzing trace with hash 13945180, now seen corresponding path program 1 times [2023-11-23 07:33:50,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:33:50,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512415728] [2023-11-23 07:33:50,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:50,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:33:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:51,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:33:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:51,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:33:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:51,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:33:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:51,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:51,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:33:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:51,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:33:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:51,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:51,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 07:33:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:51,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 07:33:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:51,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:33:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-23 07:33:51,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:33:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512415728] [2023-11-23 07:33:51,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512415728] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:33:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667548984] [2023-11-23 07:33:51,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:33:51,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:33:51,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:33:51,993 INFO L229 MonitoredProcess]: Starting monitored process 19 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:33:52,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-23 07:33:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:33:52,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-23 07:33:52,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:33:52,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:52,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 07:33:52,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:52,334 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 21 treesize of output 1 [2023-11-23 07:33:52,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:33:52,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 21 [2023-11-23 07:33:52,347 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 12 treesize of output 1 [2023-11-23 07:33:54,376 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_85| Int)) (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_85|) 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_85|)) is different from true [2023-11-23 07:33:56,573 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_85| Int)) (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_85|) 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_85|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_86| Int)) (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_86|) 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_86|))) is different from true [2023-11-23 07:33:58,763 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_37| Int)) (<= (+ (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_37|) 24) 2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_37|)) is different from true [2023-11-23 07:34:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 26 not checked. [2023-11-23 07:34:19,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:34:36,020 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:34:36,242 INFO L349 Elim1Store]: treesize reduction 153, result has 52.3 percent of original size [2023-11-23 07:34:36,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 2168 treesize of output 1668 [2023-11-23 07:34:36,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3719 treesize of output 3575 [2023-11-23 07:34:36,465 INFO L349 Elim1Store]: treesize reduction 8, result has 91.0 percent of original size [2023-11-23 07:34:36,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1009 treesize of output 980 [2023-11-23 07:34:36,515 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 585 treesize of output 567 [2023-11-23 07:34:36,549 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 650 treesize of output 614 [2023-11-23 07:34:36,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:34:36,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 673 treesize of output 683 [2023-11-23 07:34:40,046 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:34:40,082 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:34:40,853 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:34:40,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2023-11-23 07:34:40,935 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:34:40,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2023-11-23 07:34:40,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:34:40,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 108 [2023-11-23 07:34:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 31 proven. 29 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-23 07:34:41,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667548984] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:34:41,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:34:41,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 24, 18] total 49 [2023-11-23 07:34:41,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98744171] [2023-11-23 07:34:41,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:34:41,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-23 07:34:41,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:34:41,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-23 07:34:41,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1913, Unknown=15, NotChecked=270, Total=2352 [2023-11-23 07:34:41,498 INFO L87 Difference]: Start difference. First operand 384 states and 503 transitions. Second operand has 49 states, 42 states have (on average 3.9761904761904763) internal successors, (167), 43 states have internal predecessors, (167), 16 states have call successors, (26), 5 states have call predecessors, (26), 11 states have return successors, (25), 13 states have call predecessors, (25), 16 states have call successors, (25) [2023-11-23 07:34:45,645 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:34:47,664 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, 1] [2023-11-23 07:34:54,567 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:34:58,636 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:35:02,695 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:35:04,733 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:35:06,776 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:35:08,817 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:35:10,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:35:12,922 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:35:14,995 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