/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'cvc4 --incremental --print-success --lang smt' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-04 20:48:34,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-04 20:48:35,000 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-04 20:48:35,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-04 20:48:35,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-04 20:48:35,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-04 20:48:35,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-04 20:48:35,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-04 20:48:35,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-04 20:48:35,035 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-04 20:48:35,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-04 20:48:35,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-04 20:48:35,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-04 20:48:35,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-04 20:48:35,037 INFO L153 SettingsManager]: * Use SBE=true [2024-11-04 20:48:35,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-04 20:48:35,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-04 20:48:35,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-04 20:48:35,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-04 20:48:35,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-04 20:48:35,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-04 20:48:35,041 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-04 20:48:35,041 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-04 20:48:35,041 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-04 20:48:35,042 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-04 20:48:35,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-04 20:48:35,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-04 20:48:35,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-04 20:48:35,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-04 20:48:35,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-04 20:48:35,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-04 20:48:35,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 20:48:35,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-04 20:48:35,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-04 20:48:35,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-04 20:48:35,043 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-04 20:48:35,043 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:35,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-04 20:48:35,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-04 20:48:35,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-04 20:48:35,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-04 20:48:35,045 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:35,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-04 20:48:35,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-04 20:48:35,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-04 20:48:35,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-04 20:48:35,259 INFO L274 PluginConnector]: CDTParser initialized [2024-11-04 20:48:35,260 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_rend_harness.i [2024-11-04 20:48:36,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-04 20:48:36,887 INFO L384 CDTParser]: Found 1 translation units. [2024-11-04 20:48:36,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness.i [2024-11-04 20:48:36,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8036d29a8/7418445d3324499c80fbd73affa2b581/FLAG55b89a97d [2024-11-04 20:48:36,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8036d29a8/7418445d3324499c80fbd73affa2b581 [2024-11-04 20:48:36,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-04 20:48:36,931 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-04 20:48:36,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-04 20:48:36,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-04 20:48:36,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-04 20:48:36,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 08:48:36" (1/1) ... [2024-11-04 20:48:36,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d2eed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:36, skipping insertion in model container [2024-11-04 20:48:36,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 08:48:36" (1/1) ... [2024-11-04 20:48:37,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 20:48:37,230 WARN L250 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_rend_harness.i[4494,4507] [2024-11-04 20:48:37,237 WARN L250 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_rend_harness.i[4554,4567] [2024-11-04 20:48:37,666 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,751 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,756 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,756 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,763 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,765 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:37,766 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:37,767 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:37,767 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,767 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:37,768 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:37,773 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,773 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,775 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,775 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,792 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:37,792 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,793 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:37,793 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,794 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:37,794 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,795 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:37,811 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,813 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:37,813 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,813 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:37,814 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:37,814 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:37,819 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,023 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,024 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,024 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,024 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,110 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:48:38,141 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-04 20:48:38,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 20:48:38,179 WARN L250 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_rend_harness.i[4494,4507] [2024-11-04 20:48:38,180 WARN L250 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_rend_harness.i[4554,4567] [2024-11-04 20:48:38,204 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,221 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,221 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,222 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,227 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,228 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,228 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,229 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,229 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,232 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,233 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,235 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,236 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,236 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,237 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,242 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,243 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,243 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,245 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,246 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,246 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,246 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,246 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,247 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,247 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,248 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,248 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,248 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,249 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,303 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,303 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,303 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,304 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,332 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:48:38,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:48:38,343 INFO L200 MainTranslator]: Completed pre-run [2024-11-04 20:48:38,358 WARN L250 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_rend_harness.i[4494,4507] [2024-11-04 20:48:38,359 WARN L250 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_rend_harness.i[4554,4567] [2024-11-04 20:48:38,389 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,390 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,390 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,392 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,393 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,402 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,403 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,405 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,405 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,406 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,406 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,406 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,407 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:38,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:48:38,583 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-04 20:48:38,593 INFO L204 MainTranslator]: Completed translation [2024-11-04 20:48:38,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:38 WrapperNode [2024-11-04 20:48:38,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-04 20:48:38,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-04 20:48:38,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-04 20:48:38,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-04 20:48:38,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:38" (1/1) ... [2024-11-04 20:48:38,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:38" (1/1) ... [2024-11-04 20:48:38,679 INFO L138 Inliner]: procedures = 687, calls = 1038, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 138 [2024-11-04 20:48:38,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-04 20:48:38,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-04 20:48:38,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-04 20:48:38,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-04 20:48:38,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:38" (1/1) ... [2024-11-04 20:48:38,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:38" (1/1) ... [2024-11-04 20:48:38,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:38" (1/1) ... [2024-11-04 20:48:38,718 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 14, 5]. 67 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2024-11-04 20:48:38,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:38" (1/1) ... [2024-11-04 20:48:38,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:38" (1/1) ... [2024-11-04 20:48:38,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:38" (1/1) ... [2024-11-04 20:48:38,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:38" (1/1) ... [2024-11-04 20:48:38,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:38" (1/1) ... [2024-11-04 20:48:38,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:38" (1/1) ... [2024-11-04 20:48:38,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-04 20:48:38,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-04 20:48:38,759 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-04 20:48:38,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-04 20:48:38,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:38" (1/1) ... [2024-11-04 20:48:38,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 20:48:38,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 20:48:38,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-04 20:48:38,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-04 20:48:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-04 20:48:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-04 20:48:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-04 20:48:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-04 20:48:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-04 20:48:38,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-04 20:48:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-04 20:48:38,844 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-04 20:48:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-04 20:48:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-04 20:48:38,844 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-04 20:48:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-04 20:48:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-04 20:48:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-04 20:48:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-04 20:48:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-04 20:48:38,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-04 20:48:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-04 20:48:38,845 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-04 20:48:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-04 20:48:38,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-04 20:48:38,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-04 20:48:38,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-04 20:48:38,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-04 20:48:38,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-04 20:48:38,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-04 20:48:38,846 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-04 20:48:38,846 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-04 20:48:39,056 INFO L238 CfgBuilder]: Building ICFG [2024-11-04 20:48:39,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-04 20:48:39,337 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-04 20:48:39,337 INFO L287 CfgBuilder]: Performing block encoding [2024-11-04 20:48:39,352 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-04 20:48:39,352 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-04 20:48:39,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 08:48:39 BoogieIcfgContainer [2024-11-04 20:48:39,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-04 20:48:39,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-04 20:48:39,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-04 20:48:39,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-04 20:48:39,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 08:48:36" (1/3) ... [2024-11-04 20:48:39,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449b941a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 08:48:39, skipping insertion in model container [2024-11-04 20:48:39,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:38" (2/3) ... [2024-11-04 20:48:39,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449b941a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 08:48:39, skipping insertion in model container [2024-11-04 20:48:39,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 08:48:39" (3/3) ... [2024-11-04 20:48:39,360 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rend_harness.i [2024-11-04 20:48:39,373 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-04 20:48:39,373 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-04 20:48:39,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-04 20:48:39,436 INFO L333 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, 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;@ff82e03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-04 20:48:39,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-04 20:48:39,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 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) [2024-11-04 20:48:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-04 20:48:39,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:39,451 INFO L215 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, 1, 1] [2024-11-04 20:48:39,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:39,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:39,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2107862704, now seen corresponding path program 1 times [2024-11-04 20:48:39,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:39,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1615722870] [2024-11-04 20:48:39,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:39,464 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:39,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:39,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:48:39,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-04 20:48:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:39,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-04 20:48:39,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-04 20:48:39,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-04 20:48:39,787 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:39,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1615722870] [2024-11-04 20:48:39,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1615722870] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-04 20:48:39,788 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-04 20:48:39,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-04 20:48:39,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815370869] [2024-11-04 20:48:39,790 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:39,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-04 20:48:39,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:39,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-04 20:48:39,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-04 20:48:39,814 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-04 20:48:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:39,838 INFO L93 Difference]: Finished difference Result 128 states and 184 transitions. [2024-11-04 20:48:39,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-04 20:48:39,840 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2024-11-04 20:48:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:39,845 INFO L225 Difference]: With dead ends: 128 [2024-11-04 20:48:39,845 INFO L226 Difference]: Without dead ends: 63 [2024-11-04 20:48:39,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-04 20:48:39,850 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:39,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:48:39,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-04 20:48:39,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-04 20:48:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 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) [2024-11-04 20:48:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-11-04 20:48:39,891 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 68 [2024-11-04 20:48:39,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:39,892 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-11-04 20:48:39,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-04 20:48:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-11-04 20:48:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-04 20:48:39,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:39,894 INFO L215 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, 1, 1] [2024-11-04 20:48:39,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Forceful destruction successful, exit code 0 [2024-11-04 20:48:40,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:40,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:40,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:40,096 INFO L85 PathProgramCache]: Analyzing trace with hash 900796622, now seen corresponding path program 1 times [2024-11-04 20:48:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:40,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1130431335] [2024-11-04 20:48:40,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:40,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:40,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:40,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:48:40,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-04 20:48:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:40,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-04 20:48:40,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-04 20:48:40,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-04 20:48:40,553 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:40,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1130431335] [2024-11-04 20:48:40,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1130431335] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:40,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:40,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-04 20:48:40,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137365649] [2024-11-04 20:48:40,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:40,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:48:40,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:40,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:48:40,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:48:40,556 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-04 20:48:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:40,607 INFO L93 Difference]: Finished difference Result 114 states and 152 transitions. [2024-11-04 20:48:40,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:48:40,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-04 20:48:40,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:40,610 INFO L225 Difference]: With dead ends: 114 [2024-11-04 20:48:40,610 INFO L226 Difference]: Without dead ends: 65 [2024-11-04 20:48:40,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:48:40,611 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:40,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 377 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:48:40,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-04 20:48:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-04 20:48:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.288888888888889) internal successors, (58), 47 states have internal predecessors, (58), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-11-04 20:48:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2024-11-04 20:48:40,620 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 68 [2024-11-04 20:48:40,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:40,620 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2024-11-04 20:48:40,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-04 20:48:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2024-11-04 20:48:40,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-04 20:48:40,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:40,622 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-04 20:48:40,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Forceful destruction successful, exit code 0 [2024-11-04 20:48:40,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:40,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:40,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:40,823 INFO L85 PathProgramCache]: Analyzing trace with hash 577933322, now seen corresponding path program 1 times [2024-11-04 20:48:40,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:40,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [33693833] [2024-11-04 20:48:40,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:40,824 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:40,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:40,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:48:40,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-04 20:48:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:41,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:48:41,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-04 20:48:41,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-04 20:48:41,229 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:41,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [33693833] [2024-11-04 20:48:41,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [33693833] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:41,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:41,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-11-04 20:48:41,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474867687] [2024-11-04 20:48:41,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:41,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:48:41,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:41,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:48:41,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:48:41,231 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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) [2024-11-04 20:48:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:41,351 INFO L93 Difference]: Finished difference Result 121 states and 163 transitions. [2024-11-04 20:48:41,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:48:41,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 70 [2024-11-04 20:48:41,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:41,352 INFO L225 Difference]: With dead ends: 121 [2024-11-04 20:48:41,353 INFO L226 Difference]: Without dead ends: 70 [2024-11-04 20:48:41,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:48:41,354 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 20 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:41,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 300 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:48:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-04 20:48:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-04 20:48:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 50 states have internal predecessors, (60), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:48:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2024-11-04 20:48:41,373 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 70 [2024-11-04 20:48:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:41,373 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2024-11-04 20:48:41,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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) [2024-11-04 20:48:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2024-11-04 20:48:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-04 20:48:41,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:41,375 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-04 20:48:41,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-04 20:48:41,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:41,578 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:41,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:41,579 INFO L85 PathProgramCache]: Analyzing trace with hash -34807881, now seen corresponding path program 1 times [2024-11-04 20:48:41,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:41,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [464547824] [2024-11-04 20:48:41,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:41,579 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:41,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:41,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:48:41,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-04 20:48:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:41,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-04 20:48:41,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-04 20:48:41,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-04 20:48:42,014 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [464547824] [2024-11-04 20:48:42,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [464547824] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:42,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:42,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-11-04 20:48:42,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44097824] [2024-11-04 20:48:42,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:42,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:48:42,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:42,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:48:42,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-04 20:48:42,015 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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) [2024-11-04 20:48:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:42,154 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2024-11-04 20:48:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-04 20:48:42,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 72 [2024-11-04 20:48:42,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:42,156 INFO L225 Difference]: With dead ends: 133 [2024-11-04 20:48:42,156 INFO L226 Difference]: Without dead ends: 79 [2024-11-04 20:48:42,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-04 20:48:42,157 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 29 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:42,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 354 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:48:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-04 20:48:42,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2024-11-04 20:48:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 52 states have internal predecessors, (63), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:48:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2024-11-04 20:48:42,165 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 72 [2024-11-04 20:48:42,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:42,165 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2024-11-04 20:48:42,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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) [2024-11-04 20:48:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2024-11-04 20:48:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-04 20:48:42,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:42,166 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-04 20:48:42,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-04 20:48:42,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:42,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:42,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:42,368 INFO L85 PathProgramCache]: Analyzing trace with hash 387052583, now seen corresponding path program 1 times [2024-11-04 20:48:42,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:42,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [482055772] [2024-11-04 20:48:42,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:42,368 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:42,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:42,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:48:42,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-04 20:48:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:42,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-04 20:48:42,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-04 20:48:42,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-04 20:48:42,633 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:42,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [482055772] [2024-11-04 20:48:42,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [482055772] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:42,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:42,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 7 [2024-11-04 20:48:42,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196510069] [2024-11-04 20:48:42,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:42,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:48:42,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:42,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:48:42,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:48:42,635 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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) [2024-11-04 20:48:42,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:42,712 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2024-11-04 20:48:42,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:48:42,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 73 [2024-11-04 20:48:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:42,714 INFO L225 Difference]: With dead ends: 133 [2024-11-04 20:48:42,714 INFO L226 Difference]: Without dead ends: 77 [2024-11-04 20:48:42,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:48:42,715 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 25 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:42,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 230 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:48:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-04 20:48:42,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2024-11-04 20:48:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:48:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-04 20:48:42,722 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 73 [2024-11-04 20:48:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:42,723 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-04 20:48:42,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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) [2024-11-04 20:48:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-04 20:48:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-04 20:48:42,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:42,724 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:48:42,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-04 20:48:42,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:42,924 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:42,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:42,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1595103561, now seen corresponding path program 1 times [2024-11-04 20:48:42,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:42,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863644428] [2024-11-04 20:48:42,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:42,925 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:42,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:42,930 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:48:42,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-04 20:48:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:43,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:48:43,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-04 20:48:43,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-04 20:48:43,350 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:43,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863644428] [2024-11-04 20:48:43,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1863644428] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:43,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:43,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-04 20:48:43,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261806619] [2024-11-04 20:48:43,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:43,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:48:43,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:43,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:48:43,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:48:43,351 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:48:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:43,387 INFO L93 Difference]: Finished difference Result 134 states and 181 transitions. [2024-11-04 20:48:43,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:48:43,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2024-11-04 20:48:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:43,389 INFO L225 Difference]: With dead ends: 134 [2024-11-04 20:48:43,389 INFO L226 Difference]: Without dead ends: 77 [2024-11-04 20:48:43,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:48:43,390 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:43,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:48:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-04 20:48:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2024-11-04 20:48:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:48:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2024-11-04 20:48:43,397 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 81 [2024-11-04 20:48:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:43,397 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2024-11-04 20:48:43,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:48:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2024-11-04 20:48:43,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-04 20:48:43,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:43,398 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:48:43,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-04 20:48:43,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:43,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:43,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:43,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1786751690, now seen corresponding path program 1 times [2024-11-04 20:48:43,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:43,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1459373259] [2024-11-04 20:48:43,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:43,600 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:43,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:43,601 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:48:43,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-04 20:48:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:43,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-04 20:48:43,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-04 20:48:43,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-04 20:48:43,985 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:43,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1459373259] [2024-11-04 20:48:43,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1459373259] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:43,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:43,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-04 20:48:43,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053230229] [2024-11-04 20:48:43,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:43,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:48:43,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:43,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:48:43,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:48:43,987 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:48:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:44,013 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2024-11-04 20:48:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:48:44,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2024-11-04 20:48:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:44,015 INFO L225 Difference]: With dead ends: 125 [2024-11-04 20:48:44,015 INFO L226 Difference]: Without dead ends: 74 [2024-11-04 20:48:44,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:48:44,016 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:44,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:48:44,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-04 20:48:44,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-04 20:48:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 56 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (19), 12 states have call predecessors, (19), 12 states have call successors, (19) [2024-11-04 20:48:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2024-11-04 20:48:44,023 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 83 [2024-11-04 20:48:44,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:44,023 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2024-11-04 20:48:44,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:48:44,023 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2024-11-04 20:48:44,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-04 20:48:44,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:44,024 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:48:44,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-04 20:48:44,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:44,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:44,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:44,225 INFO L85 PathProgramCache]: Analyzing trace with hash -11292686, now seen corresponding path program 1 times [2024-11-04 20:48:44,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:44,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1480659085] [2024-11-04 20:48:44,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:44,225 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:44,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:44,228 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:48:44,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-04 20:48:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:44,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-04 20:48:44,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-04 20:48:44,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-04 20:48:44,674 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:44,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1480659085] [2024-11-04 20:48:44,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1480659085] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:44,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:44,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-11-04 20:48:44,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132526122] [2024-11-04 20:48:44,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:44,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:48:44,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:44,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:48:44,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-04 20:48:44,676 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 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) [2024-11-04 20:48:44,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:44,796 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2024-11-04 20:48:44,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:48:44,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 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 85 [2024-11-04 20:48:44,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:44,797 INFO L225 Difference]: With dead ends: 136 [2024-11-04 20:48:44,798 INFO L226 Difference]: Without dead ends: 76 [2024-11-04 20:48:44,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-04 20:48:44,798 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 23 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:44,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 364 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:48:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-04 20:48:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-04 20:48:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.25) internal successors, (65), 56 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (19), 12 states have call predecessors, (19), 12 states have call successors, (19) [2024-11-04 20:48:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2024-11-04 20:48:44,808 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 85 [2024-11-04 20:48:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:44,808 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2024-11-04 20:48:44,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 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) [2024-11-04 20:48:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2024-11-04 20:48:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-04 20:48:44,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:44,809 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:48:44,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-04 20:48:45,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:45,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:45,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:45,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1015915871, now seen corresponding path program 2 times [2024-11-04 20:48:45,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:45,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [742102896] [2024-11-04 20:48:45,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:45,011 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:45,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:45,013 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:48:45,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-04 20:48:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:45,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-04 20:48:45,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-04 20:48:45,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-04 20:48:45,450 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:45,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [742102896] [2024-11-04 20:48:45,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [742102896] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:45,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:45,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2024-11-04 20:48:45,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340400465] [2024-11-04 20:48:45,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:45,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-04 20:48:45,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:45,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-04 20:48:45,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-04 20:48:45,452 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 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) [2024-11-04 20:48:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:45,607 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2024-11-04 20:48:45,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-04 20:48:45,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 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 87 [2024-11-04 20:48:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:45,608 INFO L225 Difference]: With dead ends: 136 [2024-11-04 20:48:45,609 INFO L226 Difference]: Without dead ends: 75 [2024-11-04 20:48:45,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-04 20:48:45,609 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 32 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:45,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 410 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:48:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-04 20:48:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2024-11-04 20:48:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:48:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2024-11-04 20:48:45,617 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 87 [2024-11-04 20:48:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:45,617 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2024-11-04 20:48:45,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 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) [2024-11-04 20:48:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2024-11-04 20:48:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-04 20:48:45,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:45,618 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:48:45,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-04 20:48:45,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:45,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:45,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:45,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1005701739, now seen corresponding path program 1 times [2024-11-04 20:48:45,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:45,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1401498856] [2024-11-04 20:48:45,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:45,822 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:45,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:45,824 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:48:45,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-04 20:48:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:46,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:48:46,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-04 20:48:46,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-04 20:48:46,295 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:46,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1401498856] [2024-11-04 20:48:46,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1401498856] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:46,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:46,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-04 20:48:46,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829981296] [2024-11-04 20:48:46,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:46,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:48:46,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:46,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:48:46,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:48:46,297 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:48:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:46,335 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2024-11-04 20:48:46,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:48:46,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 96 [2024-11-04 20:48:46,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:46,337 INFO L225 Difference]: With dead ends: 119 [2024-11-04 20:48:46,337 INFO L226 Difference]: Without dead ends: 70 [2024-11-04 20:48:46,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:48:46,337 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:46,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 440 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:48:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-04 20:48:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-04 20:48:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-04 20:48:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2024-11-04 20:48:46,350 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 96 [2024-11-04 20:48:46,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:46,351 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2024-11-04 20:48:46,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:48:46,351 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2024-11-04 20:48:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:48:46,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:46,352 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:48:46,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-04 20:48:46,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:46,552 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:46,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:46,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1128444350, now seen corresponding path program 3 times [2024-11-04 20:48:46,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:46,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1047156357] [2024-11-04 20:48:46,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:46,554 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:46,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:46,555 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:48:46,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-04 20:48:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:47,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-04 20:48:47,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:47,264 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2024-11-04 20:48:47,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2024-11-04 20:48:47,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-11-04 20:48:47,434 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2024-11-04 20:48:47,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2024-11-04 20:48:47,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-11-04 20:48:47,480 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-04 20:48:47,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-11-04 20:48:47,552 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-04 20:48:47,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-11-04 20:48:47,634 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-04 20:48:47,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2024-11-04 20:48:47,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-04 20:48:47,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 [2024-11-04 20:48:47,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-04 20:48:47,863 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_2) .cse0))) (and (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0))) (= (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (store .cse1 .cse2 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) .cse0) .cse1))) (= .cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (= v_DerPreprocessor_2 (store .cse3 .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)))) (and (= (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_2) .cse4) (select |c_#memory_$Pointer$#1.base| .cse4)) (= .cse4 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|))))) is different from true [2024-11-04 20:48:48,235 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_is_valid_#in~list#1.offset| |c_aws_linked_list_is_valid_~list#1.offset|) (or (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_2) .cse0))) (and (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0))) (= (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (store .cse1 .cse2 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) .cse0) .cse1))) (= .cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (= v_DerPreprocessor_2 (store .cse3 .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)))) (and (= (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_2) .cse4) (select |c_#memory_$Pointer$#1.base| .cse4)) (= .cse4 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|))))) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_~list#1.base|) (let ((.cse6 (= (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_is_valid_~list#1.base|) |c_aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))) (.cse5 (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_~list#1.base|) |c_aws_linked_list_is_valid_~list#1.offset|)))) (or (and |c_aws_linked_list_is_valid_#t~short297#1| (or (not .cse5) (not .cse6))) (and .cse6 .cse5 (not |c_aws_linked_list_is_valid_#t~short297#1|))))) is different from true [2024-11-04 20:48:49,070 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64))))) (or (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_2) .cse0))) (and (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0))) (= (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (store .cse1 .cse2 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) .cse0) .cse1))) (= .cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (= v_DerPreprocessor_2 (store .cse3 .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)))) (and (= (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_2) .cse4) (select |c_#memory_$Pointer$#1.base| .cse4)) (= .cse4 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|)))))) is different from true [2024-11-04 20:48:49,349 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64))))) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |c_aws_linked_list_is_valid_#in~list#1.offset|) (or (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_2) .cse0))) (and (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0))) (= (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (store .cse1 .cse2 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) .cse0) .cse1))) (= .cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (= v_DerPreprocessor_2 (store .cse3 .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)))) (and (= (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_2) .cse4) (select |c_#memory_$Pointer$#1.base| .cse4)) (= .cse4 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|))))) (or (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))))) is different from true [2024-11-04 20:48:49,410 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (and (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64))))) (= |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| .cse0) (or (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse3 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse3))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_2) .cse1))) (and (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse1))) (= (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (store .cse2 .cse3 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse3))) .cse1) .cse2))) (= .cse4 (select |c_#memory_$Pointer$#1.base| .cse1)) (= v_DerPreprocessor_2 (store .cse4 .cse3 .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)))) (and (= (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_2) .cse5) (select |c_#memory_$Pointer$#1.base| .cse5)) (= .cse5 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|))))) (= |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base| .cse6) (or (not (= (_ bv0 64) .cse0)) (not (= (_ bv0 64) .cse6))))) is different from true [2024-11-04 20:48:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 1 not checked. [2024-11-04 20:48:49,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-04 20:48:49,910 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:49,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1047156357] [2024-11-04 20:48:49,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1047156357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 20:48:49,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 20:48:49,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2024-11-04 20:48:49,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191479311] [2024-11-04 20:48:49,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 20:48:49,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-04 20:48:49,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:49,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-04 20:48:49,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=171, Unknown=12, NotChecked=150, Total=380 [2024-11-04 20:48:49,912 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 18 states have internal predecessors, (107), 6 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-04 20:48:50,620 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_is_valid_#in~list#1.offset| |c_aws_linked_list_is_valid_~list#1.offset|) (or (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_2) .cse0))) (and (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0))) (= (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (store .cse1 .cse2 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) .cse0) .cse1))) (= .cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (= v_DerPreprocessor_2 (store .cse3 .cse2 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)))) (and (= (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_2) .cse4) (select |c_#memory_$Pointer$#1.base| .cse4)) (= .cse4 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|))))) (or (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_~list#1.base|) |c_aws_linked_list_is_valid_~list#1.offset|))) (not |c_aws_linked_list_is_valid_#t~short295#1|) (not (= (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_is_valid_~list#1.base|) |c_aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_~list#1.base|)) is different from true [2024-11-04 20:48:56,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:48:56,331 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (and (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64))))) (= |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| .cse0) (or (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse3 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse3))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_2) .cse1))) (and (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse1))) (= (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (store .cse2 .cse3 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse3))) .cse1) .cse2))) (= .cse4 (select |c_#memory_$Pointer$#1.base| .cse1)) (= v_DerPreprocessor_2 (store .cse4 .cse3 .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)))) (and (= (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_2) .cse5) (select |c_#memory_$Pointer$#1.base| .cse5)) (= .cse5 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_31|))))) (= |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base| .cse6) (or (not (= |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| (_ bv0 64))) (not (= (_ bv0 64) |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|))) (or (not (= (_ bv0 64) .cse0)) (not (= (_ bv0 64) .cse6))))) is different from true [2024-11-04 20:48:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:57,768 INFO L93 Difference]: Finished difference Result 180 states and 244 transitions. [2024-11-04 20:48:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-04 20:48:57,769 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 18 states have internal predecessors, (107), 6 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 98 [2024-11-04 20:48:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:57,770 INFO L225 Difference]: With dead ends: 180 [2024-11-04 20:48:57,770 INFO L226 Difference]: Without dead ends: 120 [2024-11-04 20:48:57,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=80, Invalid=313, Unknown=15, NotChecked=294, Total=702 [2024-11-04 20:48:57,771 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 64 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 9 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 962 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:57,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 558 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 436 Invalid, 37 Unknown, 962 Unchecked, 7.2s Time] [2024-11-04 20:48:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-04 20:48:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2024-11-04 20:48:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 86 states have internal predecessors, (110), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-04 20:48:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 144 transitions. [2024-11-04 20:48:57,782 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 144 transitions. Word has length 98 [2024-11-04 20:48:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:57,782 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 144 transitions. [2024-11-04 20:48:57,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 18 states have internal predecessors, (107), 6 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-04 20:48:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 144 transitions. [2024-11-04 20:48:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:48:57,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:57,783 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:48:57,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-11-04 20:48:57,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:57,983 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:57,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:57,984 INFO L85 PathProgramCache]: Analyzing trace with hash 604075650, now seen corresponding path program 1 times [2024-11-04 20:48:57,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:57,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1076351762] [2024-11-04 20:48:57,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:57,984 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:57,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:57,986 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:48:57,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-04 20:48:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:58,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-04 20:48:58,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-04 20:48:58,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:58,261 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-04 20:48:58,262 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:58,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1076351762] [2024-11-04 20:48:58,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1076351762] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:58,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:58,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-04 20:48:58,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827824096] [2024-11-04 20:48:58,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:58,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-04 20:48:58,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:58,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-04 20:48:58,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-04 20:48:58,263 INFO L87 Difference]: Start difference. First operand 109 states and 144 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-04 20:48:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:58,288 INFO L93 Difference]: Finished difference Result 179 states and 242 transitions. [2024-11-04 20:48:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-04 20:48:58,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2024-11-04 20:48:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:58,289 INFO L225 Difference]: With dead ends: 179 [2024-11-04 20:48:58,289 INFO L226 Difference]: Without dead ends: 111 [2024-11-04 20:48:58,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-04 20:48:58,290 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:58,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:48:58,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-04 20:48:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-11-04 20:48:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 86 states have internal predecessors, (108), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-04 20:48:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 142 transitions. [2024-11-04 20:48:58,299 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 142 transitions. Word has length 98 [2024-11-04 20:48:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:58,300 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 142 transitions. [2024-11-04 20:48:58,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-04 20:48:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2024-11-04 20:48:58,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:48:58,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:58,300 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:48:58,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-04 20:48:58,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:58,501 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:58,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:58,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1924312770, now seen corresponding path program 1 times [2024-11-04 20:48:58,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:58,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2078247965] [2024-11-04 20:48:58,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:58,502 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:58,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:58,507 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:48:58,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-04 20:48:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:58,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-04 20:48:58,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-04 20:48:58,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-04 20:48:58,767 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:58,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2078247965] [2024-11-04 20:48:58,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2078247965] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:58,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:58,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-04 20:48:58,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825672313] [2024-11-04 20:48:58,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:58,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-04 20:48:58,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:58,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-04 20:48:58,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-04 20:48:58,768 INFO L87 Difference]: Start difference. First operand 109 states and 142 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-04 20:48:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:58,799 INFO L93 Difference]: Finished difference Result 195 states and 262 transitions. [2024-11-04 20:48:58,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-04 20:48:58,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2024-11-04 20:48:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:58,800 INFO L225 Difference]: With dead ends: 195 [2024-11-04 20:48:58,800 INFO L226 Difference]: Without dead ends: 104 [2024-11-04 20:48:58,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-04 20:48:58,801 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:58,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:48:58,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-04 20:48:58,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-11-04 20:48:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 78 states have internal predecessors, (94), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-04 20:48:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2024-11-04 20:48:58,810 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 98 [2024-11-04 20:48:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:58,810 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2024-11-04 20:48:58,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-04 20:48:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2024-11-04 20:48:58,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-04 20:48:58,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:58,811 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:48:58,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-04 20:48:59,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:59,012 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:59,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:59,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1438193982, now seen corresponding path program 1 times [2024-11-04 20:48:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:59,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [578280255] [2024-11-04 20:48:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:59,012 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:59,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:59,018 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:48:59,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-04 20:48:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:59,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-04 20:48:59,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:59,565 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2024-11-04 20:48:59,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2024-11-04 20:48:59,577 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 11 [2024-11-04 20:48:59,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-04 20:48:59,648 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 9 treesize of output 7 [2024-11-04 20:48:59,716 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2024-11-04 20:48:59,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2024-11-04 20:48:59,724 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 11 [2024-11-04 20:48:59,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-04 20:48:59,758 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 55 treesize of output 20 [2024-11-04 20:48:59,813 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|)) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse1))) (and (= (store .cse0 (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) v_DerPreprocessor_6) (= .cse0 (select |c_#memory_$Pointer$#1.offset| .cse1))))))) is different from true [2024-11-04 20:48:59,834 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_is_valid_#in~list#1.offset| |c_aws_linked_list_is_valid_~list#1.offset|) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_~list#1.base|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|)) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse1))) (and (= (store .cse0 (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) v_DerPreprocessor_6) (= .cse0 (select |c_#memory_$Pointer$#1.offset| .cse1)))))))) is different from true [2024-11-04 20:49:00,224 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_2| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_2| (_ BitVec 64))) (let ((.cse0 (bvadd (_ bv16 64) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_2|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_2|) .cse0)) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_2|) .cse0))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|)) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse2))) (and (= (store .cse1 (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) v_DerPreprocessor_6) (= .cse1 (select |c_#memory_$Pointer$#1.offset| .cse2)))))))) is different from true [2024-11-04 20:49:18,199 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_aws_linked_list_rend_~list#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_rend_~list#1.base|))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv16 64))) (= (select .cse0 (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|) (= (select .cse0 (_ bv16 64)) (_ bv0 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (= (_ bv0 64) (select .cse1 (_ bv16 64))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select .cse4 (_ bv24 64)))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_6) .cse3))) (and (= .cse2 (select |c_#memory_$Pointer$#1.offset| .cse3)) (= v_DerPreprocessor_6 (store .cse2 (_ bv24 64) (select .cse1 (_ bv24 64)))))))) (= (select .cse4 (_ bv16 64)) (_ bv0 64)))))) (= (_ bv0 64) (select .cse5 (_ bv16 64))) (= (select .cse6 (_ bv16 64)) (_ bv0 64)) (let ((.cse8 (select .cse5 (_ bv24 64)))) (or (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_DerPreprocessor_5) |c_ULTIMATE.start_aws_linked_list_rend_~list#1.base| v_DerPreprocessor_6) .cse8))) (and (= v_DerPreprocessor_6 (store .cse7 (_ bv24 64) (select .cse6 (_ bv24 64)))) (= .cse7 (select |c_#memory_$Pointer$#1.offset| .cse8))))) (= .cse8 |c_ULTIMATE.start_aws_linked_list_rend_~list#1.base|))) (= |c_ULTIMATE.start_aws_linked_list_rend_~list#1.offset| (_ bv0 64)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6| (_ BitVec 64))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|) (_ bv16 64))) (= (_ bv0 64) (select .cse9 (_ bv16 64))) (= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6| (select .cse9 (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6| (_ BitVec 64))) (let ((.cse12 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|)) (.cse13 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|))) (and (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse11 (select .cse13 (_ bv24 64)))) (let ((.cse10 (select (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6| v_DerPreprocessor_6) .cse11))) (and (= .cse10 (select |c_#memory_$Pointer$#1.offset| .cse11)) (= v_DerPreprocessor_6 (store .cse10 (_ bv24 64) (select .cse12 (_ bv24 64)))))))) (= (_ bv0 64) (select .cse12 (_ bv16 64))) (= (_ bv0 64) (select .cse13 (_ bv16 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))) (and (= (_ bv0 64) (select .cse14 (_ bv16 64))) (= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| (select .cse14 (_ bv24 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|) (_ bv16 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (.cse17 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))) (and (= (_ bv0 64) (select .cse15 (_ bv16 64))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse18 (select .cse15 (_ bv24 64)))) (let ((.cse16 (select (store (store |c_#memory_$Pointer$#1.offset| .cse18 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| v_DerPreprocessor_6) .cse18))) (and (= (store .cse16 (_ bv24 64) (select .cse17 (_ bv24 64))) v_DerPreprocessor_6) (= (select |c_#memory_$Pointer$#1.offset| .cse18) .cse16))))) (= (_ bv0 64) (select .cse17 (_ bv16 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|)) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse20 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (let ((.cse19 (select (store (store |c_#memory_$Pointer$#1.offset| .cse20 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse20))) (and (= (store .cse19 (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) v_DerPreprocessor_6) (= .cse19 (select |c_#memory_$Pointer$#1.offset| .cse20))))))))) is different from true [2024-11-04 20:49:31,953 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (bvadd (_ bv16 64) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (or (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) .cse0))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) .cse0))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv16 64))) (= (select .cse1 (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|) (= (select .cse1 (_ bv16 64)) (_ bv0 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (= (_ bv0 64) (select .cse2 (_ bv16 64))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select .cse5 (_ bv24 64)))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_6) .cse4))) (and (= .cse3 (select |c_#memory_$Pointer$#1.offset| .cse4)) (= v_DerPreprocessor_6 (store .cse3 (_ bv24 64) (select .cse2 (_ bv24 64)))))))) (= (select .cse5 (_ bv16 64)) (_ bv0 64)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6| (_ BitVec 64))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|) (_ bv16 64))) (= (_ bv0 64) (select .cse6 (_ bv16 64))) (= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6| (select .cse6 (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6| (_ BitVec 64))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|)) (.cse10 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6|))) (and (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (select .cse10 (_ bv24 64)))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_6| v_DerPreprocessor_6) .cse8))) (and (= .cse7 (select |c_#memory_$Pointer$#1.offset| .cse8)) (= v_DerPreprocessor_6 (store .cse7 (_ bv24 64) (select .cse9 (_ bv24 64)))))))) (= (_ bv0 64) (select .cse9 (_ bv16 64))) (= (_ bv0 64) (select .cse10 (_ bv16 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))) (and (= (_ bv0 64) (select .cse11 (_ bv16 64))) (= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| (select .cse11 (_ bv24 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|) (_ bv16 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (.cse14 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))) (and (= (_ bv0 64) (select .cse12 (_ bv16 64))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse15 (select .cse12 (_ bv24 64)))) (let ((.cse13 (select (store (store |c_#memory_$Pointer$#1.offset| .cse15 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| v_DerPreprocessor_6) .cse15))) (and (= (store .cse13 (_ bv24 64) (select .cse14 (_ bv24 64))) v_DerPreprocessor_6) (= (select |c_#memory_$Pointer$#1.offset| .cse15) .cse13))))) (= (_ bv0 64) (select .cse14 (_ bv16 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|)) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (let ((.cse16 (select (store (store |c_#memory_$Pointer$#1.offset| .cse17 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse17))) (and (= (store .cse16 (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) v_DerPreprocessor_6) (= .cse16 (select |c_#memory_$Pointer$#1.offset| .cse17))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_7| (_ BitVec 64))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_7|))) (and (= (_ bv0 64) (select .cse18 (_ bv16 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_7|) (_ bv16 64))) (= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_7| (select .cse18 (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_7| (_ BitVec 64))) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_7|)) (.cse21 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_7|))) (and (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse20 (select .cse22 (_ bv24 64)))) (let ((.cse19 (select (store (store |c_#memory_$Pointer$#1.offset| .cse20 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_7| v_DerPreprocessor_6) .cse20))) (and (= .cse19 (select |c_#memory_$Pointer$#1.offset| .cse20)) (= v_DerPreprocessor_6 (store .cse19 (_ bv24 64) (select .cse21 (_ bv24 64)))))))) (= (_ bv0 64) (select .cse22 (_ bv16 64))) (= (_ bv0 64) (select .cse21 (_ bv16 64)))))))) is different from true [2024-11-04 20:49:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 27 not checked. [2024-11-04 20:49:32,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:49:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-04 20:49:34,030 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:49:34,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [578280255] [2024-11-04 20:49:34,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [578280255] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 20:49:34,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 20:49:34,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10] total 29 [2024-11-04 20:49:34,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601695615] [2024-11-04 20:49:34,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 20:49:34,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-04 20:49:34,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:49:34,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-04 20:49:34,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=434, Unknown=43, NotChecked=240, Total=812 [2024-11-04 20:49:34,032 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 29 states, 26 states have (on average 5.269230769230769) internal successors, (137), 23 states have internal predecessors, (137), 13 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-04 20:49:45,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:49:50,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:49:54,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:49:55,116 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (bvadd (_ bv16 64) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (let ((.cse0 (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) .cse9))) (.cse1 (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) .cse9))) (.cse8 (bvadd (_ bv16 64) |c_aws_linked_list_is_valid_~list#1.offset|))) (let ((.cse4 (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_is_valid_~list#1.base|) .cse8))) (.cse5 (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_~list#1.base|) .cse8))) (.cse2 (not .cse1)) (.cse3 (not .cse0))) (and (or (and |c_aws_linked_list_is_valid_#t~short301#1| .cse0 .cse1) (and (or .cse2 .cse3) (not |c_aws_linked_list_is_valid_#t~short301#1|))) (or (not .cse4) (and .cse0 .cse1) (not .cse5)) (or (and .cse4 .cse5) .cse2 .cse3) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|)) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse7))) (and (= (store .cse6 (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) v_DerPreprocessor_6) (= .cse6 (select |c_#memory_$Pointer$#1.offset| .cse7))))))))))) is different from true [2024-11-04 20:50:04,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:50:08,860 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv16 64) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv16 64))) (= (select .cse0 (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|) (= (select .cse0 (_ bv16 64)) (_ bv0 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (= (_ bv0 64) (select .cse1 (_ bv16 64))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select .cse4 (_ bv24 64)))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_6) .cse3))) (and (= .cse2 (select |c_#memory_$Pointer$#1.offset| .cse3)) (= v_DerPreprocessor_6 (store .cse2 (_ bv24 64) (select .cse1 (_ bv24 64)))))))) (= (select .cse4 (_ bv16 64)) (_ bv0 64)))))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) .cse5)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))) (and (= (_ bv0 64) (select .cse6 (_ bv16 64))) (= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| (select .cse6 (_ bv24 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|) (_ bv16 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5|))) (and (= (_ bv0 64) (select .cse7 (_ bv16 64))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse10 (select .cse7 (_ bv24 64)))) (let ((.cse8 (select (store (store |c_#memory_$Pointer$#1.offset| .cse10 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_5| v_DerPreprocessor_6) .cse10))) (and (= (store .cse8 (_ bv24 64) (select .cse9 (_ bv24 64))) v_DerPreprocessor_6) (= (select |c_#memory_$Pointer$#1.offset| .cse10) .cse8))))) (= (_ bv0 64) (select .cse9 (_ bv16 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|)) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (let ((.cse11 (select (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse12))) (and (= (store .cse11 (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) v_DerPreprocessor_6) (= .cse11 (select |c_#memory_$Pointer$#1.offset| .cse12))))))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) .cse5)))) is different from true