/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_begin_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-04 20:46:14,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-04 20:46:14,802 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:46:14,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-04 20:46:14,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-04 20:46:14,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-04 20:46:14,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-04 20:46:14,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-04 20:46:14,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-04 20:46:14,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-04 20:46:14,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-04 20:46:14,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-04 20:46:14,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-04 20:46:14,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-04 20:46:14,840 INFO L153 SettingsManager]: * Use SBE=true [2024-11-04 20:46:14,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-04 20:46:14,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-04 20:46:14,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-04 20:46:14,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-04 20:46:14,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-04 20:46:14,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-04 20:46:14,842 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-04 20:46:14,843 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-04 20:46:14,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-04 20:46:14,843 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-04 20:46:14,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-04 20:46:14,844 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-04 20:46:14,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-04 20:46:14,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-04 20:46:14,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-04 20:46:14,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-04 20:46:14,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 20:46:14,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-04 20:46:14,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-04 20:46:14,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-04 20:46:14,847 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-04 20:46:14,847 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:14,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-04 20:46:14,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-04 20:46:14,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-04 20:46:14,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-04 20:46:14,850 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:46:15,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-04 20:46:15,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-04 20:46:15,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-04 20:46:15,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-04 20:46:15,132 INFO L274 PluginConnector]: CDTParser initialized [2024-11-04 20:46:15,132 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_begin_harness.i [2024-11-04 20:46:16,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-04 20:46:17,070 INFO L384 CDTParser]: Found 1 translation units. [2024-11-04 20:46:17,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness.i [2024-11-04 20:46:17,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8fbac2c/17a449ef70b947e587ec0875e731cf05/FLAGa7b94939d [2024-11-04 20:46:17,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8fbac2c/17a449ef70b947e587ec0875e731cf05 [2024-11-04 20:46:17,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-04 20:46:17,204 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-04 20:46:17,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-04 20:46:17,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-04 20:46:17,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-04 20:46:17,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 08:46:17" (1/1) ... [2024-11-04 20:46:17,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5db6716d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:17, skipping insertion in model container [2024-11-04 20:46:17,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 08:46:17" (1/1) ... [2024-11-04 20:46:17,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 20:46:17,610 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_begin_harness.i[4495,4508] [2024-11-04 20:46:17,622 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_begin_harness.i[4555,4568] [2024-11-04 20:46:18,224 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:46:18,374 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:46:18,374 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:46:18,375 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:46:18,394 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:46:18,396 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,399 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,399 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,400 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:46:18,400 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,401 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,403 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:46:18,404 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:46:18,405 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:46:18,406 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:46:18,414 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,414 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:46:18,414 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,415 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:46:18,416 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,416 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:46:18,417 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,417 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:46:18,418 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,419 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:46:18,419 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,419 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:46:18,420 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,420 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,636 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:46:18,637 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:46:18,637 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:46:18,638 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:46:18,737 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:46:18,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:46:18,773 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-04 20:46:18,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 20:46:18,835 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_begin_harness.i[4495,4508] [2024-11-04 20:46:18,836 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_begin_harness.i[4555,4568] [2024-11-04 20:46:18,868 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:46:18,888 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:46:18,888 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:46:18,889 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:46:18,896 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:46:18,897 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,897 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,898 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,898 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:46:18,898 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,899 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,900 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:46:18,900 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:46:18,902 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:46:18,902 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:46:18,906 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,906 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:46:18,906 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,906 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:46:18,907 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,908 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:46:18,908 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,908 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:46:18,909 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,909 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:46:18,909 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,910 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:46:18,910 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,910 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:18,973 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:46:18,974 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:46:18,974 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:46:18,975 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:46:19,019 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:46:19,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:46:19,031 INFO L200 MainTranslator]: Completed pre-run [2024-11-04 20:46:19,051 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_begin_harness.i[4495,4508] [2024-11-04 20:46:19,052 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_begin_harness.i[4555,4568] [2024-11-04 20:46:19,110 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:19,113 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:19,113 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:19,113 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:19,114 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:19,121 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:19,121 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:19,123 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:19,126 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:19,128 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:19,128 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:19,128 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:19,129 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:19,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:46:19,443 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-04 20:46:19,452 INFO L204 MainTranslator]: Completed translation [2024-11-04 20:46:19,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:19 WrapperNode [2024-11-04 20:46:19,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-04 20:46:19,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-04 20:46:19,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-04 20:46:19,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-04 20:46:19,460 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:46:19" (1/1) ... [2024-11-04 20:46:19,533 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:46:19" (1/1) ... [2024-11-04 20:46:19,588 INFO L138 Inliner]: procedures = 687, calls = 1039, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 144 [2024-11-04 20:46:19,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-04 20:46:19,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-04 20:46:19,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-04 20:46:19,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-04 20:46:19,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:19" (1/1) ... [2024-11-04 20:46:19,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:19" (1/1) ... [2024-11-04 20:46:19,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:19" (1/1) ... [2024-11-04 20:46:19,668 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2024-11-04 20:46:19,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:19" (1/1) ... [2024-11-04 20:46:19,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:19" (1/1) ... [2024-11-04 20:46:19,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:19" (1/1) ... [2024-11-04 20:46:19,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:19" (1/1) ... [2024-11-04 20:46:19,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:19" (1/1) ... [2024-11-04 20:46:19,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:19" (1/1) ... [2024-11-04 20:46:19,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-04 20:46:19,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-04 20:46:19,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-04 20:46:19,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-04 20:46:19,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:19" (1/1) ... [2024-11-04 20:46:19,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 20:46:19,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 20:46:19,757 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:46:19,760 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:46:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-04 20:46:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-04 20:46:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-04 20:46:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-04 20:46:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-04 20:46:19,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-04 20:46:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-04 20:46:19,786 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-04 20:46:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-04 20:46:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-04 20:46:19,786 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-04 20:46:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-04 20:46:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-04 20:46:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-04 20:46:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-04 20:46:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-04 20:46:19,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-04 20:46:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-04 20:46:19,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-04 20:46:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-04 20:46:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-04 20:46:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-04 20:46:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-04 20:46:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-04 20:46:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-04 20:46:19,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-04 20:46:19,788 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-04 20:46:19,788 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-04 20:46:20,075 INFO L238 CfgBuilder]: Building ICFG [2024-11-04 20:46:20,077 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-04 20:46:20,408 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-04 20:46:20,408 INFO L287 CfgBuilder]: Performing block encoding [2024-11-04 20:46:20,425 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-04 20:46:20,425 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-04 20:46:20,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 08:46:20 BoogieIcfgContainer [2024-11-04 20:46:20,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-04 20:46:20,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-04 20:46:20,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-04 20:46:20,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-04 20:46:20,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 08:46:17" (1/3) ... [2024-11-04 20:46:20,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2daa8ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 08:46:20, skipping insertion in model container [2024-11-04 20:46:20,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:19" (2/3) ... [2024-11-04 20:46:20,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2daa8ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 08:46:20, skipping insertion in model container [2024-11-04 20:46:20,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 08:46:20" (3/3) ... [2024-11-04 20:46:20,436 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_begin_harness.i [2024-11-04 20:46:20,452 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-04 20:46:20,453 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-04 20:46:20,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-04 20:46:20,515 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;@5dc5c1c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-04 20:46:20,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-04 20:46:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 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:46:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-04 20:46:20,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:20,528 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:46:20,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:20,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:20,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1062572114, now seen corresponding path program 1 times [2024-11-04 20:46:20,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:20,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545259970] [2024-11-04 20:46:20,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:20,545 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:20,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:20,547 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:46:20,548 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:46:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:20,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-04 20:46:20,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:20,890 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:46:20,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:20,965 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:46:20,967 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:20,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [545259970] [2024-11-04 20:46:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [545259970] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-04 20:46:20,968 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-04 20:46:20,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-04 20:46:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320196952] [2024-11-04 20:46:20,972 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:20,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-04 20:46:20,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:21,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-04 20:46:21,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-04 20:46:21,006 INFO L87 Difference]: Start difference. First operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 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:46:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:21,032 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2024-11-04 20:46:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-04 20:46:21,034 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:46:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:21,041 INFO L225 Difference]: With dead ends: 130 [2024-11-04 20:46:21,041 INFO L226 Difference]: Without dead ends: 64 [2024-11-04 20:46:21,045 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:46:21,049 INFO L432 NwaCegarLoop]: 88 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, 88 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:46:21,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-04 20:46:21,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-04 20:46:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 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:46:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2024-11-04 20:46:21,105 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 68 [2024-11-04 20:46:21,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:21,106 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2024-11-04 20:46:21,106 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:46:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-11-04 20:46:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-04 20:46:21,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:21,111 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:46:21,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Ended with exit code 0 [2024-11-04 20:46:21,312 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:46:21,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:21,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:21,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1946087212, now seen corresponding path program 1 times [2024-11-04 20:46:21,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:21,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2023468102] [2024-11-04 20:46:21,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:21,314 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:21,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:21,316 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:46:21,317 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:46:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:21,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-04 20:46:21,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:21,854 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:46:21,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:21,970 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:46:21,970 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:21,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2023468102] [2024-11-04 20:46:21,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2023468102] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:21,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:21,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-04 20:46:21,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652395905] [2024-11-04 20:46:21,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:21,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:46:21,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:21,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:46:21,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:21,975 INFO L87 Difference]: Start difference. First operand 64 states and 83 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:46:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:22,059 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2024-11-04 20:46:22,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:46:22,060 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:46:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:22,063 INFO L225 Difference]: With dead ends: 116 [2024-11-04 20:46:22,063 INFO L226 Difference]: Without dead ends: 66 [2024-11-04 20:46:22,067 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:46:22,068 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 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.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:22,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:46:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-04 20:46:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-04 20:46:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 48 states have internal predecessors, (59), 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:46:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2024-11-04 20:46:22,087 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 68 [2024-11-04 20:46:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:22,087 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2024-11-04 20:46:22,088 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:46:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-11-04 20:46:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-04 20:46:22,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:22,094 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:46:22,103 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:46:22,294 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:46:22,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:22,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:22,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1195332088, now seen corresponding path program 1 times [2024-11-04 20:46:22,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:22,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1828953883] [2024-11-04 20:46:22,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:22,296 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:22,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:22,297 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:46:22,298 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:46:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:22,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:46:22,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:22,607 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:46:22,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:22,820 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:46:22,820 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:22,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1828953883] [2024-11-04 20:46:22,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1828953883] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:22,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:22,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-11-04 20:46:22,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742630459] [2024-11-04 20:46:22,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:22,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:46:22,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:22,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:46:22,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:22,824 INFO L87 Difference]: Start difference. First operand 66 states and 87 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:46:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:22,979 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2024-11-04 20:46:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:46:22,979 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:46:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:22,981 INFO L225 Difference]: With dead ends: 123 [2024-11-04 20:46:22,981 INFO L226 Difference]: Without dead ends: 71 [2024-11-04 20:46:22,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:22,982 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 21 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:22,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 300 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:46:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-04 20:46:22,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-04 20:46:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 51 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:46:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-04 20:46:23,000 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 70 [2024-11-04 20:46:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:23,001 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-04 20:46:23,001 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:46:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-04 20:46:23,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-04 20:46:23,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:23,005 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:46:23,010 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:46:23,205 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:46:23,206 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:23,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:23,206 INFO L85 PathProgramCache]: Analyzing trace with hash -316025515, now seen corresponding path program 1 times [2024-11-04 20:46:23,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:23,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [340720925] [2024-11-04 20:46:23,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:23,207 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:23,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:23,213 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:46:23,215 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:46:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:23,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-04 20:46:23,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:23,525 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:46:23,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:23,706 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:46:23,707 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:23,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [340720925] [2024-11-04 20:46:23,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [340720925] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:23,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:23,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-11-04 20:46:23,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481217260] [2024-11-04 20:46:23,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:23,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:46:23,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:23,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:46:23,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-04 20:46:23,709 INFO L87 Difference]: Start difference. First operand 69 states and 91 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:46:23,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:23,919 INFO L93 Difference]: Finished difference Result 135 states and 183 transitions. [2024-11-04 20:46:23,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-04 20:46:23,919 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:46:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:23,921 INFO L225 Difference]: With dead ends: 135 [2024-11-04 20:46:23,922 INFO L226 Difference]: Without dead ends: 80 [2024-11-04 20:46:23,922 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:46:23,923 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 30 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:23,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 354 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-04 20:46:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-04 20:46:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2024-11-04 20:46:23,937 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:46:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-04 20:46:23,938 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 72 [2024-11-04 20:46:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:23,939 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-04 20:46:23,939 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:46:23,939 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-04 20:46:23,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-04 20:46:23,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:23,940 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:46:23,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-04 20:46:24,141 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:46:24,141 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:24,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:24,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1928092350, now seen corresponding path program 1 times [2024-11-04 20:46:24,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:24,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [618505806] [2024-11-04 20:46:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:24,142 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:24,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:24,143 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:46:24,144 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:46:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:24,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-04 20:46:24,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:24,425 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:46:24,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:24,474 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:46:24,474 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:24,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [618505806] [2024-11-04 20:46:24,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [618505806] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:24,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:24,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 7 [2024-11-04 20:46:24,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768100080] [2024-11-04 20:46:24,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:24,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:46:24,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:24,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:46:24,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:24,477 INFO L87 Difference]: Start difference. First operand 71 states and 94 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:46:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:24,585 INFO L93 Difference]: Finished difference Result 135 states and 185 transitions. [2024-11-04 20:46:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:46:24,586 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:46:24,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:24,589 INFO L225 Difference]: With dead ends: 135 [2024-11-04 20:46:24,589 INFO L226 Difference]: Without dead ends: 78 [2024-11-04 20:46:24,589 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:46:24,590 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:24,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 230 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:46:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-04 20:46:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-11-04 20:46:24,607 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:46:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2024-11-04 20:46:24,609 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 73 [2024-11-04 20:46:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:24,610 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2024-11-04 20:46:24,610 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:46:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2024-11-04 20:46:24,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-04 20:46:24,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:24,612 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:46:24,618 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:46:24,817 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:46:24,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:24,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:24,818 INFO L85 PathProgramCache]: Analyzing trace with hash 137287748, now seen corresponding path program 1 times [2024-11-04 20:46:24,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:24,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1348997732] [2024-11-04 20:46:24,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:24,819 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:24,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:24,822 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:46:24,823 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:46:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:25,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:46:25,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:25,252 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:46:25,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:25,328 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:46:25,328 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:25,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1348997732] [2024-11-04 20:46:25,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1348997732] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:25,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:25,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-04 20:46:25,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962898626] [2024-11-04 20:46:25,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:25,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:46:25,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:25,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:46:25,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:25,330 INFO L87 Difference]: Start difference. First operand 72 states and 95 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:46:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:25,378 INFO L93 Difference]: Finished difference Result 136 states and 183 transitions. [2024-11-04 20:46:25,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:46:25,379 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:46:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:25,380 INFO L225 Difference]: With dead ends: 136 [2024-11-04 20:46:25,380 INFO L226 Difference]: Without dead ends: 78 [2024-11-04 20:46:25,381 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:46:25,381 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 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:46:25,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-04 20:46:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2024-11-04 20:46:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 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:46:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2024-11-04 20:46:25,395 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 81 [2024-11-04 20:46:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:25,395 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2024-11-04 20:46:25,395 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:46:25,395 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2024-11-04 20:46:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-04 20:46:25,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:25,396 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:46:25,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-04 20:46:25,596 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:46:25,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:25,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:25,597 INFO L85 PathProgramCache]: Analyzing trace with hash 431382673, now seen corresponding path program 1 times [2024-11-04 20:46:25,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:25,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [886495765] [2024-11-04 20:46:25,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:25,598 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:25,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:25,600 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:46:25,601 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:46:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:26,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-04 20:46:26,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:26,047 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:46:26,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:26,109 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:46:26,110 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:26,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [886495765] [2024-11-04 20:46:26,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [886495765] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:26,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:26,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-04 20:46:26,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857918820] [2024-11-04 20:46:26,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:26,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:46:26,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:26,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:46:26,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:26,112 INFO L87 Difference]: Start difference. First operand 73 states and 96 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:46:26,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:26,153 INFO L93 Difference]: Finished difference Result 127 states and 169 transitions. [2024-11-04 20:46:26,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:46:26,154 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:46:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:26,155 INFO L225 Difference]: With dead ends: 127 [2024-11-04 20:46:26,155 INFO L226 Difference]: Without dead ends: 75 [2024-11-04 20:46:26,156 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:46:26,156 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 381 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:46:26,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 381 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:26,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-04 20:46:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-04 20:46:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 57 states have internal predecessors, (67), 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:46:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2024-11-04 20:46:26,172 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 83 [2024-11-04 20:46:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:26,172 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2024-11-04 20:46:26,172 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:46:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2024-11-04 20:46:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-04 20:46:26,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:26,173 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:46:26,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-04 20:46:26,373 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:46:26,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:26,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:26,375 INFO L85 PathProgramCache]: Analyzing trace with hash -425725907, now seen corresponding path program 1 times [2024-11-04 20:46:26,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:26,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1795036547] [2024-11-04 20:46:26,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:26,375 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:26,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:26,378 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:46:26,380 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:46:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:26,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-04 20:46:26,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:26,682 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:46:26,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:26,825 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:46:26,825 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:26,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1795036547] [2024-11-04 20:46:26,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1795036547] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:26,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:26,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-11-04 20:46:26,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591501162] [2024-11-04 20:46:26,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:26,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:46:26,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:26,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:46:26,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-04 20:46:26,827 INFO L87 Difference]: Start difference. First operand 75 states and 99 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:46:26,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:26,966 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2024-11-04 20:46:26,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:46:26,967 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:46:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:26,968 INFO L225 Difference]: With dead ends: 138 [2024-11-04 20:46:26,968 INFO L226 Difference]: Without dead ends: 77 [2024-11-04 20:46:26,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-04 20:46:26,969 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:26,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 363 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:46:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-04 20:46:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-11-04 20:46:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 57 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:46:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2024-11-04 20:46:26,985 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 85 [2024-11-04 20:46:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:26,986 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2024-11-04 20:46:26,986 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:46:26,986 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2024-11-04 20:46:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-04 20:46:26,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:26,987 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:46:26,992 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:46:27,187 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:46:27,188 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:27,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:27,188 INFO L85 PathProgramCache]: Analyzing trace with hash 439771770, now seen corresponding path program 2 times [2024-11-04 20:46:27,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:27,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1488774438] [2024-11-04 20:46:27,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:27,189 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:27,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:27,191 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:46:27,192 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:46:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:27,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-04 20:46:27,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:27,508 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:46:27,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:27,723 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:46:27,723 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:27,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1488774438] [2024-11-04 20:46:27,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1488774438] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:27,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:27,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2024-11-04 20:46:27,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183318413] [2024-11-04 20:46:27,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:27,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-04 20:46:27,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:27,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-04 20:46:27,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-04 20:46:27,726 INFO L87 Difference]: Start difference. First operand 75 states and 98 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:46:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:27,912 INFO L93 Difference]: Finished difference Result 138 states and 179 transitions. [2024-11-04 20:46:27,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-04 20:46:27,913 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:46:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:27,914 INFO L225 Difference]: With dead ends: 138 [2024-11-04 20:46:27,914 INFO L226 Difference]: Without dead ends: 76 [2024-11-04 20:46:27,915 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:46:27,915 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 31 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:27,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 408 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:46:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-04 20:46:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2024-11-04 20:46:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.24) internal successors, (62), 53 states have internal predecessors, (62), 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:46:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2024-11-04 20:46:27,925 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 87 [2024-11-04 20:46:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:27,925 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2024-11-04 20:46:27,925 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:46:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2024-11-04 20:46:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-04 20:46:27,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:27,926 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:46:27,932 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:46:28,127 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:46:28,127 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:28,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:28,128 INFO L85 PathProgramCache]: Analyzing trace with hash -959329865, now seen corresponding path program 1 times [2024-11-04 20:46:28,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:28,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [496027050] [2024-11-04 20:46:28,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:28,129 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:28,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:28,130 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:46:28,131 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:46:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:28,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:46:28,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:28,584 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:46:28,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:28,664 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:46:28,665 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:28,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [496027050] [2024-11-04 20:46:28,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [496027050] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:28,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:28,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-04 20:46:28,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071928610] [2024-11-04 20:46:28,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:28,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:46:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:28,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:46:28,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:28,667 INFO L87 Difference]: Start difference. First operand 71 states and 92 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:46:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:28,718 INFO L93 Difference]: Finished difference Result 121 states and 158 transitions. [2024-11-04 20:46:28,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:46:28,719 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:46:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:28,720 INFO L225 Difference]: With dead ends: 121 [2024-11-04 20:46:28,720 INFO L226 Difference]: Without dead ends: 71 [2024-11-04 20:46:28,720 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:46:28,721 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 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, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:28,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-04 20:46:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-04 20:46:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 51 states have internal predecessors, (61), 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:46:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2024-11-04 20:46:28,734 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 96 [2024-11-04 20:46:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:28,734 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2024-11-04 20:46:28,734 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:46:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2024-11-04 20:46:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:46:28,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:28,735 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:46:28,744 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:46:28,936 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:46:28,937 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:28,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:28,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1252523644, now seen corresponding path program 3 times [2024-11-04 20:46:28,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:28,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2064977886] [2024-11-04 20:46:28,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:28,938 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:28,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:28,940 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:46:28,941 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:46:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:29,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-04 20:46:29,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:29,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2024-11-04 20:46:29,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2024-11-04 20:46:29,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-04 20:46:29,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-04 20:46:29,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-11-04 20:46:29,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-11-04 20:46:29,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-04 20:46:29,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-04 20:46:29,745 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (.cse1 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select .cse3 .cse1))) (and (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse1 (select .cse2 .cse1)) .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse1 .cse0) .cse3) (not (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))))) is different from true [2024-11-04 20:46:30,154 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_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (.cse1 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select .cse3 .cse1))) (and (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse1 (select .cse2 .cse1)) .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse1 .cse0) .cse3) (not (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))))) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_~list#1.base|) (let ((.cse4 (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_is_valid_~list#1.base|) |c_aws_linked_list_is_valid_~list#1.offset|))) (.cse5 (= (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_~list#1.base|) |c_aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (or (and .cse4 (not |c_aws_linked_list_is_valid_#t~short297#1|) .cse5) (and (or (not .cse4) (not .cse5)) |c_aws_linked_list_is_valid_#t~short297#1|)))) is different from true [2024-11-04 20:46:31,048 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (.cse1 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select .cse3 .cse1))) (and (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse1 (select .cse2 .cse1)) .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse1 .cse0) .cse3) (not (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))))) (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 (= (select (select |c_#memory_$Pointer$#2.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|) (_ bv0 64)))) (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$#2.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|)))))) is different from true [2024-11-04 20:46:31,327 WARN L873 $PredicateComparison]: unable to prove that (and (= |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_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (.cse1 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select .cse3 .cse1))) (and (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse1 (select .cse2 .cse1)) .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse1 .cse0) .cse3) (not (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))))) (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 (= (select (select |c_#memory_$Pointer$#2.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|) (_ bv0 64)))) (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$#2.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|))))) (or (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|) (_ bv0 64))))) is different from true [2024-11-04 20:46:31,400 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (and (= .cse0 |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse1 (select .cse4 .cse2))) (and (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 (select .cse3 .cse2)) .cse3)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 .cse1) .cse4) (not (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| .cse1)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))))) (= |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| .cse5) (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 (= (select (select |c_#memory_$Pointer$#2.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|) (_ bv0 64)))) (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$#2.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|))))) (or (not (= (_ bv0 64) .cse5)) (not (= .cse0 (_ bv0 64)))))) is different from true [2024-11-04 20:46:31,404 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:46:31,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:32,028 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:46:32,028 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:32,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2064977886] [2024-11-04 20:46:32,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2064977886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 20:46:32,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 20:46:32,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2024-11-04 20:46:32,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192729919] [2024-11-04 20:46:32,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 20:46:32,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-04 20:46:32,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:32,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-04 20:46:32,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=176, Unknown=7, NotChecked=150, Total=380 [2024-11-04 20:46:32,031 INFO L87 Difference]: Start difference. First operand 69 states and 88 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:46:33,519 WARN L873 $PredicateComparison]: unable to prove that (and (or (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.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|))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |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.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_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (.cse1 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select .cse3 .cse1))) (and (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse1 (select .cse2 .cse1)) .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse1 .cse0) .cse3) (not (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))))) (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 (= (select (select |c_#memory_$Pointer$#2.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|) (_ bv0 64)))) (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$#2.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|))))) (or (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|) (_ bv0 64))))) is different from true [2024-11-04 20:46:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:35,000 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2024-11-04 20:46:35,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-04 20:46:35,001 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:46:35,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:35,003 INFO L225 Difference]: With dead ends: 179 [2024-11-04 20:46:35,003 INFO L226 Difference]: Without dead ends: 119 [2024-11-04 20:46:35,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=87, Invalid=389, Unknown=10, NotChecked=270, Total=756 [2024-11-04 20:46:35,004 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 64 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 7 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 941 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:35,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 484 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 381 Invalid, 53 Unknown, 941 Unchecked, 2.2s Time] [2024-11-04 20:46:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-04 20:46:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 106. [2024-11-04 20:46:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 84 states have internal predecessors, (107), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2024-11-04 20:46:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2024-11-04 20:46:35,022 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 98 [2024-11-04 20:46:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:35,023 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2024-11-04 20:46:35,023 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:46:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2024-11-04 20:46:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:46:35,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:35,024 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:46:35,034 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:46:35,224 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:46:35,225 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:35,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:35,225 INFO L85 PathProgramCache]: Analyzing trace with hash 479996356, now seen corresponding path program 1 times [2024-11-04 20:46:35,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:35,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1216214475] [2024-11-04 20:46:35,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:35,226 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:35,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:35,227 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:46:35,228 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:46:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:35,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-04 20:46:35,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:35,462 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:46:35,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:35,505 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:46:35,506 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:35,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1216214475] [2024-11-04 20:46:35,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1216214475] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:35,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:35,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-04 20:46:35,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673147288] [2024-11-04 20:46:35,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:35,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-04 20:46:35,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:35,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-04 20:46:35,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-04 20:46:35,508 INFO L87 Difference]: Start difference. First operand 106 states and 139 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:46:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:35,536 INFO L93 Difference]: Finished difference Result 177 states and 238 transitions. [2024-11-04 20:46:35,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-04 20:46:35,537 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:46:35,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:35,538 INFO L225 Difference]: With dead ends: 177 [2024-11-04 20:46:35,538 INFO L226 Difference]: Without dead ends: 108 [2024-11-04 20:46:35,539 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:46:35,539 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 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:46:35,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-04 20:46:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2024-11-04 20:46:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 84 states have internal predecessors, (105), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2024-11-04 20:46:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 137 transitions. [2024-11-04 20:46:35,554 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 137 transitions. Word has length 98 [2024-11-04 20:46:35,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:35,555 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 137 transitions. [2024-11-04 20:46:35,555 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:46:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2024-11-04 20:46:35,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:46:35,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:35,555 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:46:35,560 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:46:35,756 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:46:35,756 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:35,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:35,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1800233476, now seen corresponding path program 1 times [2024-11-04 20:46:35,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:35,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [475672096] [2024-11-04 20:46:35,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:35,757 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:35,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:35,758 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:46:35,760 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:46:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:36,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-04 20:46:36,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:36,026 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:46:36,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:36,073 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:46:36,074 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:36,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [475672096] [2024-11-04 20:46:36,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [475672096] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:36,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:36,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-04 20:46:36,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247785971] [2024-11-04 20:46:36,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:36,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-04 20:46:36,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:36,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-04 20:46:36,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-04 20:46:36,076 INFO L87 Difference]: Start difference. First operand 106 states and 137 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:46:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:36,116 INFO L93 Difference]: Finished difference Result 189 states and 252 transitions. [2024-11-04 20:46:36,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-04 20:46:36,116 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:46:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:36,117 INFO L225 Difference]: With dead ends: 189 [2024-11-04 20:46:36,117 INFO L226 Difference]: Without dead ends: 101 [2024-11-04 20:46:36,118 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:46:36,120 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 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:46:36,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-04 20:46:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-04 20:46:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 76 states have internal predecessors, (91), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2024-11-04 20:46:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 123 transitions. [2024-11-04 20:46:36,131 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 123 transitions. Word has length 98 [2024-11-04 20:46:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:36,131 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 123 transitions. [2024-11-04 20:46:36,132 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:46:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2024-11-04 20:46:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-04 20:46:36,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:36,133 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:46:36,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-11-04 20:46:36,333 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:46:36,333 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:36,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:36,334 INFO L85 PathProgramCache]: Analyzing trace with hash -596272544, now seen corresponding path program 1 times [2024-11-04 20:46:36,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:36,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1037407412] [2024-11-04 20:46:36,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:36,334 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:36,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:36,336 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:46:36,337 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:46:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:36,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-04 20:46:36,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:36,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-04 20:46:36,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-04 20:46:36,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 21 [2024-11-04 20:46:36,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-04 20:46:36,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-04 20:46:36,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-04 20:46:36,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-04 20:46:36,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-04 20:46:36,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-04 20:46:36,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-11-04 20:46:37,035 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|))) (= .cse0 (let ((.cse1 (select .cse0 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse1))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|))) is different from true [2024-11-04 20:46:37,279 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|))) (= .cse0 (let ((.cse1 (select .cse0 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse1))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|))) (let ((.cse4 (bvadd (_ bv16 64) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (let ((.cse2 (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) .cse4))) (.cse3 (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) .cse4)))) (or (and |c_aws_linked_list_is_valid_#t~short301#1| .cse2 .cse3) (and (not |c_aws_linked_list_is_valid_#t~short301#1|) (or (not .cse2) (not .cse3))))))) is different from true [2024-11-04 20:46:37,314 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv16 64) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|))) (= .cse0 (let ((.cse1 (select .cse0 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse1))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) .cse2)) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) .cse2)))) is different from true [2024-11-04 20:47:07,677 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_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (and (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse0 (let ((.cse1 (select .cse0 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|) (_ bv24 64) .cse1)))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|) (_ bv16 64))) (= (_ bv0 64) (select .cse0 (_ bv16 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|) (_ bv16 64))) (= (_ bv0 64) (select .cse2 (_ bv16 64))) (= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (select .cse2 (_ bv24 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|))) (= .cse3 (let ((.cse4 (select .cse3 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_5) .cse4 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_7| (_ BitVec 64))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_7|))) (and (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse5 (let ((.cse6 (select .cse5 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_7| v_DerPreprocessor_5) .cse6 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_7|) (_ bv24 64) .cse6)))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_7|) (_ bv16 64))) (= (_ bv0 64) (select .cse5 (_ bv16 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_7| (_ BitVec 64))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_7|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_7|) (_ bv16 64))) (= (_ bv0 64) (select .cse7 (_ bv16 64))) (= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_7| (select .cse7 (_ bv24 64))))))) (= |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_begin_~list#1.base_BEFORE_CALL_6| (_ BitVec 64))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|) (_ bv16 64))) (= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| (select .cse8 (_ bv24 64))) (= (_ bv0 64) (select .cse8 (_ bv16 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| (_ BitVec 64))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|) (_ bv16 64))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= (let ((.cse9 (select .cse10 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| v_DerPreprocessor_5) .cse9 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|) (_ bv24 64) .cse9)) .cse10)) (= (_ bv0 64) (select .cse10 (_ bv16 64))))))) (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 ((.cse11 (bvadd (_ bv16 64) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_2|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_2|) .cse11)) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_2|) .cse11))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv16 64)) (_ bv0 64)) (= (_ bv0 64) (select .cse12 (_ bv16 64))) (= (select .cse12 (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv16 64)) (_ bv0 64)) (= (_ bv0 64) (select .cse13 (_ bv16 64))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= (let ((.cse14 (select .cse13 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_5) .cse14 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64) .cse14)) .cse13))))))) is different from true [2024-11-04 20:47:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 23 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 26 not checked. [2024-11-04 20:47:18,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:47:20,365 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:47:20,365 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:47:20,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1037407412] [2024-11-04 20:47:20,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1037407412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 20:47:20,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 20:47:20,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 30 [2024-11-04 20:47:20,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364253676] [2024-11-04 20:47:20,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 20:47:20,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-04 20:47:20,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:47:20,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-04 20:47:20,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=511, Unknown=40, NotChecked=204, Total=870 [2024-11-04 20:47:20,368 INFO L87 Difference]: Start difference. First operand 98 states and 123 transitions. Second operand has 30 states, 27 states have (on average 5.111111111111111) internal successors, (138), 24 states have internal predecessors, (138), 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:47:24,379 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:47:28,395 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:47:32,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:47:36,442 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:47:40,716 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:47:45,736 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:47:50,461 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]