/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 --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 05:22:14,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 05:22:15,038 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-06 05:22:15,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 05:22:15,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 05:22:15,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 05:22:15,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 05:22:15,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 05:22:15,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 05:22:15,068 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 05:22:15,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 05:22:15,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 05:22:15,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 05:22:15,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 05:22:15,070 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 05:22:15,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 05:22:15,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 05:22:15,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 05:22:15,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 05:22:15,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 05:22:15,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 05:22:15,076 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 05:22:15,076 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 05:22:15,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 05:22:15,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 05:22:15,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 05:22:15,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 05:22:15,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 05:22:15,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 05:22:15,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 05:22:15,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 05:22:15,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 05:22:15,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 05:22:15,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 05:22:15,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 05:22:15,079 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 05:22:15,080 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 05:22:15,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 05:22:15,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 05:22:15,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 05:22:15,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 05:22:15,081 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 05:22:15,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 05:22:15,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 05:22:15,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 05:22:15,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 05:22:15,338 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 05:22:15,339 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_init_harness.i [2024-11-06 05:22:16,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 05:22:17,215 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 05:22:17,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness.i [2024-11-06 05:22:17,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8727f4f9c/3a581035829e46639e99599716fd6da8/FLAGe344e6c0c [2024-11-06 05:22:17,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8727f4f9c/3a581035829e46639e99599716fd6da8 [2024-11-06 05:22:17,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 05:22:17,392 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 05:22:17,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 05:22:17,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 05:22:17,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 05:22:17,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 05:22:17" (1/1) ... [2024-11-06 05:22:17,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64095d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:17, skipping insertion in model container [2024-11-06 05:22:17,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 05:22:17" (1/1) ... [2024-11-06 05:22:17,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 05:22:17,787 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_init_harness.i[4494,4507] [2024-11-06 05:22:17,798 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_init_harness.i[4554,4567] [2024-11-06 05:22:18,297 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-06 05:22:18,380 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-06 05:22:18,381 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-06 05:22:18,382 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-06 05:22:18,398 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-06 05:22:18,399 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:18,400 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:18,405 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22: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-06 05:22:18,405 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:18,406 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:18,413 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-06 05:22:18,413 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-06 05:22: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-06 05:22: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-06 05:22:18,429 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:18,430 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-06 05:22:18,432 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:18,433 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-06 05:22:18,434 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:18,435 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-06 05:22:18,435 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:18,435 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-06 05:22:18,439 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:18,440 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-06 05:22:18,440 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:18,441 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-06 05:22:18,441 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:18,441 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:18,762 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-06 05:22:18,763 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:18,763 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:18,764 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-06 05:22:18,912 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-06 05:22:18,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:22:18,949 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-06 05:22:18,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 05:22:18,993 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_init_harness.i[4494,4507] [2024-11-06 05:22:18,994 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_init_harness.i[4554,4567] [2024-11-06 05:22:19,022 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-06 05:22:19,040 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-06 05:22:19,040 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-06 05:22:19,040 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-06 05:22:19,046 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-06 05:22:19,047 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,047 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,048 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,048 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-06 05:22:19,048 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,049 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,054 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-06 05:22:19,054 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-06 05:22:19,055 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-06 05:22:19,055 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-06 05:22:19,062 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,062 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-06 05:22:19,063 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,063 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-06 05:22:19,067 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,067 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-06 05:22:19,068 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,068 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-06 05:22:19,069 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,070 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-06 05:22:19,070 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,071 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-06 05:22:19,071 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,071 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,118 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-06 05:22:19,119 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-06 05:22:19,123 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-06 05:22:19,124 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-06 05:22:19,155 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-06 05:22:19,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:22:19,176 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 05:22:19,196 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_init_harness.i[4494,4507] [2024-11-06 05:22:19,196 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_init_harness.i[4554,4567] [2024-11-06 05:22:19,234 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,235 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,235 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,235 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,236 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,243 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,243 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,246 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,246 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,247 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,248 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,248 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,249 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:19,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:22:19,473 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-06 05:22:19,482 INFO L204 MainTranslator]: Completed translation [2024-11-06 05:22:19,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:19 WrapperNode [2024-11-06 05:22:19,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 05:22:19,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 05:22:19,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 05:22:19,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 05:22:19,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:19" (1/1) ... [2024-11-06 05:22:19,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:19" (1/1) ... [2024-11-06 05:22:19,617 INFO L138 Inliner]: procedures = 687, calls = 1034, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 93 [2024-11-06 05:22:19,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 05:22:19,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 05:22:19,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 05:22:19,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 05:22:19,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:19" (1/1) ... [2024-11-06 05:22:19,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:19" (1/1) ... [2024-11-06 05:22:19,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:19" (1/1) ... [2024-11-06 05:22:19,659 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 4 writes are split as follows [0, 0, 4]. [2024-11-06 05:22:19,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:19" (1/1) ... [2024-11-06 05:22:19,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:19" (1/1) ... [2024-11-06 05:22:19,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:19" (1/1) ... [2024-11-06 05:22:19,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:19" (1/1) ... [2024-11-06 05:22:19,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:19" (1/1) ... [2024-11-06 05:22:19,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:19" (1/1) ... [2024-11-06 05:22:19,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 05:22:19,699 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 05:22:19,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 05:22:19,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 05:22:19,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:19" (1/1) ... [2024-11-06 05:22:19,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 05:22:19,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 05:22:19,732 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-06 05:22:19,734 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-06 05:22:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2024-11-06 05:22:19,760 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2024-11-06 05:22:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 05:22:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 05:22:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 05:22:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 05:22:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 05:22:19,760 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 05:22:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-06 05:22:19,761 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-06 05:22:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-06 05:22:19,761 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-06 05:22:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 05:22:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 05:22:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 05:22:19,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-06 05:22:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 05:22:19,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 05:22:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2024-11-06 05:22:19,763 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2024-11-06 05:22:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 05:22:19,763 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 05:22:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 05:22:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 05:22:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 05:22:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-06 05:22:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-06 05:22:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-06 05:22:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-06 05:22:20,016 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 05:22:20,018 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 05:22:20,296 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-06 05:22:20,296 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 05:22:20,312 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 05:22:20,312 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 05:22:20,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 05:22:20 BoogieIcfgContainer [2024-11-06 05:22:20,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 05:22:20,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 05:22:20,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 05:22:20,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 05:22:20,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 05:22:17" (1/3) ... [2024-11-06 05:22:20,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20df502a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 05:22:20, skipping insertion in model container [2024-11-06 05:22:20,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:19" (2/3) ... [2024-11-06 05:22:20,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20df502a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 05:22:20, skipping insertion in model container [2024-11-06 05:22:20,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 05:22:20" (3/3) ... [2024-11-06 05:22:20,321 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness.i [2024-11-06 05:22:20,336 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 05:22:20,336 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 05:22:20,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 05:22:20,414 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;@5c243959, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 05:22:20,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 05:22:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:22:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 05:22:20,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:20,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 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-06 05:22:20,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:20,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:20,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1017333715, now seen corresponding path program 1 times [2024-11-06 05:22:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:20,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632353719] [2024-11-06 05:22:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:20,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:20,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:20,445 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:20,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-06 05:22:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:20,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 05:22:20,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:20,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:20,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:20,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632353719] [2024-11-06 05:22:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632353719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:20,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:20,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 05:22:20,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983987708] [2024-11-06 05:22:20,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:20,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 05:22:20,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:20,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 05:22:20,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 05:22:20,733 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 05:22:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:20,758 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2024-11-06 05:22:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 05:22:20,761 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-06 05:22:20,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:20,768 INFO L225 Difference]: With dead ends: 117 [2024-11-06 05:22:20,768 INFO L226 Difference]: Without dead ends: 56 [2024-11-06 05:22:20,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 25 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-06 05:22:20,773 INFO L432 NwaCegarLoop]: 75 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, 75 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-06 05:22:20,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:22:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-06 05:22:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-06 05:22:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-06 05:22:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2024-11-06 05:22:20,816 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 26 [2024-11-06 05:22:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:20,816 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2024-11-06 05:22:20,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 05:22:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2024-11-06 05:22:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 05:22:20,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:20,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 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-06 05:22:20,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-06 05:22:21,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:21,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:21,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:21,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1834982165, now seen corresponding path program 1 times [2024-11-06 05:22:21,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:21,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828747161] [2024-11-06 05:22:21,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:21,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:21,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:21,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:21,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-06 05:22:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:21,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-06 05:22:21,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:21,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-06 05:22:21,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-06 05:22:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:22,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:22,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:22,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828747161] [2024-11-06 05:22:22,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828747161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:22,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:22,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-06 05:22:22,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396449116] [2024-11-06 05:22:22,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:22,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 05:22:22,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:22,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 05:22:22,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-06 05:22:22,347 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 05:22:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:23,651 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2024-11-06 05:22:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 05:22:23,651 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-06 05:22:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:23,654 INFO L225 Difference]: With dead ends: 114 [2024-11-06 05:22:23,654 INFO L226 Difference]: Without dead ends: 65 [2024-11-06 05:22:23,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-06 05:22:23,656 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 54 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:23,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 383 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 05:22:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-06 05:22:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-06 05:22:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-06 05:22:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2024-11-06 05:22:23,678 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 26 [2024-11-06 05:22:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:23,678 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-11-06 05:22:23,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 05:22:23,679 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2024-11-06 05:22:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 05:22:23,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:23,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 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-06 05:22:23,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-06 05:22:23,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:23,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:23,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:23,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1650638505, now seen corresponding path program 1 times [2024-11-06 05:22:23,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:23,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127530109] [2024-11-06 05:22:23,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:23,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:23,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:23,884 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:23,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-06 05:22:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:24,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-06 05:22:24,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:24,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-06 05:22:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:24,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:24,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:24,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127530109] [2024-11-06 05:22:24,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127530109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:24,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:24,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 05:22:24,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492202584] [2024-11-06 05:22:24,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:24,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 05:22:24,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:24,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 05:22:24,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-06 05:22:24,642 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 05:22:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:25,718 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2024-11-06 05:22:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 05:22:25,718 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-06 05:22:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:25,720 INFO L225 Difference]: With dead ends: 131 [2024-11-06 05:22:25,720 INFO L226 Difference]: Without dead ends: 79 [2024-11-06 05:22:25,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-06 05:22:25,722 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 106 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:25,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 376 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 05:22:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-06 05:22:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-11-06 05:22:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 55 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-06 05:22:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2024-11-06 05:22:25,740 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 26 [2024-11-06 05:22:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:25,740 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2024-11-06 05:22:25,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 05:22:25,742 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2024-11-06 05:22:25,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 05:22:25,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:25,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 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-06 05:22:25,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-06 05:22:25,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:25,944 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:25,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:25,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1257611495, now seen corresponding path program 1 times [2024-11-06 05:22:25,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:25,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629219863] [2024-11-06 05:22:25,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:25,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:25,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:25,949 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:25,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-06 05:22:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:26,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-06 05:22:26,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:26,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 7 [2024-11-06 05:22:26,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-06 05:22:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:26,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:26,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:26,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629219863] [2024-11-06 05:22:26,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629219863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:26,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:26,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 05:22:26,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395228395] [2024-11-06 05:22:26,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:26,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 05:22:26,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:26,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 05:22:26,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-06 05:22:26,883 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 05:22:28,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:28,291 INFO L93 Difference]: Finished difference Result 158 states and 211 transitions. [2024-11-06 05:22:28,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 05:22:28,292 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-06 05:22:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:28,294 INFO L225 Difference]: With dead ends: 158 [2024-11-06 05:22:28,294 INFO L226 Difference]: Without dead ends: 96 [2024-11-06 05:22:28,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-06 05:22:28,296 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 82 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:28,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 480 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 05:22:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-06 05:22:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2024-11-06 05:22:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.368421052631579) internal successors, (78), 59 states have internal predecessors, (78), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-06 05:22:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2024-11-06 05:22:28,320 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 26 [2024-11-06 05:22:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:28,320 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2024-11-06 05:22:28,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 05:22:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2024-11-06 05:22:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 05:22:28,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:28,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 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-06 05:22:28,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-06 05:22:28,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:28,523 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:28,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1515776933, now seen corresponding path program 1 times [2024-11-06 05:22:28,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:28,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643508197] [2024-11-06 05:22:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:28,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:28,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:28,526 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:28,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-06 05:22:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:28,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-06 05:22:28,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:28,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 17 [2024-11-06 05:22:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:29,218 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:29,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:29,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643508197] [2024-11-06 05:22:29,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643508197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:29,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:29,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 05:22:29,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288090643] [2024-11-06 05:22:29,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:29,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 05:22:29,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:29,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 05:22:29,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-06 05:22:29,221 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 05:22:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:30,362 INFO L93 Difference]: Finished difference Result 180 states and 245 transitions. [2024-11-06 05:22:30,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 05:22:30,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-06 05:22:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:30,364 INFO L225 Difference]: With dead ends: 180 [2024-11-06 05:22:30,364 INFO L226 Difference]: Without dead ends: 114 [2024-11-06 05:22:30,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-06 05:22:30,365 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 73 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:30,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 497 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 05:22:30,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-06 05:22:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 81. [2024-11-06 05:22:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 63 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-06 05:22:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2024-11-06 05:22:30,392 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 26 [2024-11-06 05:22:30,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:30,392 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2024-11-06 05:22:30,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 05:22:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2024-11-06 05:22:30,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 05:22:30,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:30,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 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-06 05:22:30,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-06 05:22:30,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:30,595 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:30,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:30,595 INFO L85 PathProgramCache]: Analyzing trace with hash 504659683, now seen corresponding path program 1 times [2024-11-06 05:22:30,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:30,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797447998] [2024-11-06 05:22:30,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:30,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:30,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:30,599 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:30,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-06 05:22:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:30,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 05:22:30,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:30,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:30,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:30,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:30,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797447998] [2024-11-06 05:22:30,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797447998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:30,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:30,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 05:22:30,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335864075] [2024-11-06 05:22:30,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:30,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 05:22:30,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:30,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 05:22:30,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:22:30,756 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 05:22:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:30,834 INFO L93 Difference]: Finished difference Result 177 states and 242 transitions. [2024-11-06 05:22:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 05:22:30,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-06 05:22:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:30,835 INFO L225 Difference]: With dead ends: 177 [2024-11-06 05:22:30,835 INFO L226 Difference]: Without dead ends: 74 [2024-11-06 05:22:30,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-06 05:22:30,838 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 36 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:30,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 385 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:22:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-06 05:22:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-06 05:22:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 56 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-06 05:22:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2024-11-06 05:22:30,854 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 26 [2024-11-06 05:22:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:30,854 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2024-11-06 05:22:30,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 05:22:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2024-11-06 05:22:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-06 05:22:30,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:30,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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-06 05:22:30,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-06 05:22:31,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:31,056 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:31,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1687611897, now seen corresponding path program 1 times [2024-11-06 05:22:31,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:31,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91892992] [2024-11-06 05:22:31,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:31,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:31,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:31,058 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:31,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-06 05:22:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:31,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 05:22:31,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:31,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:31,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:31,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91892992] [2024-11-06 05:22:31,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91892992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:31,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:31,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 05:22:31,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003619901] [2024-11-06 05:22:31,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:31,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 05:22:31,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:31,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 05:22:31,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 05:22:31,227 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 05:22:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:31,361 INFO L93 Difference]: Finished difference Result 149 states and 189 transitions. [2024-11-06 05:22:31,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 05:22:31,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-06 05:22:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:31,362 INFO L225 Difference]: With dead ends: 149 [2024-11-06 05:22:31,362 INFO L226 Difference]: Without dead ends: 80 [2024-11-06 05:22:31,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-06 05:22:31,364 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:31,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 360 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:22:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-06 05:22:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-11-06 05:22:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 56 states have internal predecessors, (70), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-06 05:22:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2024-11-06 05:22:31,380 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 28 [2024-11-06 05:22:31,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:31,380 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2024-11-06 05:22:31,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 05:22:31,380 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2024-11-06 05:22:31,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-06 05:22:31,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:31,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-06 05:22:31,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-06 05:22:31,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:31,582 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:31,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:31,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1850407916, now seen corresponding path program 1 times [2024-11-06 05:22:31,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:31,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64122190] [2024-11-06 05:22:31,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:31,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:31,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:31,585 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:31,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-06 05:22:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:31,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 05:22:31,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:31,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:31,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:31,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:31,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64122190] [2024-11-06 05:22:31,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64122190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:31,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:31,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 05:22:31,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947588362] [2024-11-06 05:22:31,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:31,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 05:22:31,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:31,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 05:22:31,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 05:22:31,781 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 05:22:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:31,964 INFO L93 Difference]: Finished difference Result 161 states and 205 transitions. [2024-11-06 05:22:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:22:31,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-06 05:22:31,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:31,965 INFO L225 Difference]: With dead ends: 161 [2024-11-06 05:22:31,966 INFO L226 Difference]: Without dead ends: 90 [2024-11-06 05:22:31,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:22:31,967 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 29 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:31,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 394 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:22:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-06 05:22:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2024-11-06 05:22:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 58 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-06 05:22:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2024-11-06 05:22:31,984 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 30 [2024-11-06 05:22:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:31,984 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2024-11-06 05:22:31,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 05:22:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2024-11-06 05:22:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 05:22:31,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:31,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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-06 05:22:31,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-06 05:22:32,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:32,186 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:32,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1395309347, now seen corresponding path program 1 times [2024-11-06 05:22:32,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:32,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81459063] [2024-11-06 05:22:32,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:32,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:32,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:32,189 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:32,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-06 05:22:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:32,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 05:22:32,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:32,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:32,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:32,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81459063] [2024-11-06 05:22:32,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81459063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:32,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:32,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 05:22:32,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590685589] [2024-11-06 05:22:32,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:32,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 05:22:32,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:32,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 05:22:32,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-06 05:22:32,377 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 05:22:32,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:32,549 INFO L93 Difference]: Finished difference Result 155 states and 199 transitions. [2024-11-06 05:22:32,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 05:22:32,550 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-06 05:22:32,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:32,551 INFO L225 Difference]: With dead ends: 155 [2024-11-06 05:22:32,551 INFO L226 Difference]: Without dead ends: 90 [2024-11-06 05:22:32,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-06 05:22:32,552 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:32,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 336 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:22:32,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-06 05:22:32,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-11-06 05:22:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 60 states have internal predecessors, (74), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-06 05:22:32,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2024-11-06 05:22:32,569 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 31 [2024-11-06 05:22:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:32,569 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2024-11-06 05:22:32,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 05:22:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2024-11-06 05:22:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 05:22:32,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:32,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 05:22:32,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-06 05:22:32,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:32,771 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:32,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1854431003, now seen corresponding path program 1 times [2024-11-06 05:22:32,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:32,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118843405] [2024-11-06 05:22:32,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:32,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:32,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:32,773 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:32,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-06 05:22:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:32,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-06 05:22:32,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:32,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-06 05:22:32,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-06 05:22:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:34,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:34,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:34,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118843405] [2024-11-06 05:22:34,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118843405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:34,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:34,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-06 05:22:34,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918816418] [2024-11-06 05:22:34,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:34,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-06 05:22:34,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:34,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-06 05:22:34,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-06 05:22:34,420 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 05:22:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:36,653 INFO L93 Difference]: Finished difference Result 168 states and 213 transitions. [2024-11-06 05:22:36,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 05:22:36,654 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2024-11-06 05:22:36,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:36,655 INFO L225 Difference]: With dead ends: 168 [2024-11-06 05:22:36,655 INFO L226 Difference]: Without dead ends: 101 [2024-11-06 05:22:36,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-11-06 05:22:36,656 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 70 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:36,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 469 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 05:22:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-06 05:22:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2024-11-06 05:22:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.278688524590164) internal successors, (78), 64 states have internal predecessors, (78), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-06 05:22:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2024-11-06 05:22:36,677 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 39 [2024-11-06 05:22:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:36,677 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2024-11-06 05:22:36,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 05:22:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2024-11-06 05:22:36,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 05:22:36,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:36,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 05:22:36,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-06 05:22:36,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:36,883 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:36,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:36,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1596265565, now seen corresponding path program 1 times [2024-11-06 05:22:36,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:36,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500654522] [2024-11-06 05:22:36,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:36,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:36,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:36,885 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:36,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-06 05:22:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:37,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-06 05:22:37,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:41,153 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_2| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_2| (_ 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_2|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_2|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_2| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_2| (_ BitVec 64))) (not (= (_ bv0 64) (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_2|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_2|))))) is different from true [2024-11-06 05:22:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:41,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:41,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:41,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500654522] [2024-11-06 05:22:41,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500654522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:41,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:41,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-06 05:22:41,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042081836] [2024-11-06 05:22:41,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:41,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:22:41,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:41,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:22:41,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=92, Unknown=1, NotChecked=18, Total=132 [2024-11-06 05:22:41,547 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 05:22:46,183 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-06 05:22:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:46,791 INFO L93 Difference]: Finished difference Result 188 states and 248 transitions. [2024-11-06 05:22:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 05:22:46,792 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-11-06 05:22:46,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:46,794 INFO L225 Difference]: With dead ends: 188 [2024-11-06 05:22:46,794 INFO L226 Difference]: Without dead ends: 113 [2024-11-06 05:22:46,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=44, Invalid=199, Unknown=1, NotChecked=28, Total=272 [2024-11-06 05:22:46,795 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 28 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:46,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 476 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 1 Unknown, 117 Unchecked, 5.0s Time] [2024-11-06 05:22:46,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-06 05:22:46,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2024-11-06 05:22:46,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.28) internal successors, (96), 79 states have internal predecessors, (96), 13 states have call successors, (13), 8 states have call predecessors, (13), 10 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-06 05:22:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 126 transitions. [2024-11-06 05:22:46,824 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 126 transitions. Word has length 39 [2024-11-06 05:22:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:46,824 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 126 transitions. [2024-11-06 05:22:46,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 05:22:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 126 transitions. [2024-11-06 05:22:46,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 05:22:46,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:46,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 05:22:46,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-06 05:22:47,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:47,026 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:47,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:47,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1687584481, now seen corresponding path program 1 times [2024-11-06 05:22:47,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:47,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881753308] [2024-11-06 05:22:47,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:47,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:47,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:47,029 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:47,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-06 05:22:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:47,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-06 05:22:47,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:47,244 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:47,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:47,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881753308] [2024-11-06 05:22:47,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881753308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:47,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:47,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 05:22:47,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268443846] [2024-11-06 05:22:47,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:47,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 05:22:47,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:47,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 05:22:47,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-06 05:22:47,246 INFO L87 Difference]: Start difference. First operand 99 states and 126 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 05:22:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:47,534 INFO L93 Difference]: Finished difference Result 229 states and 310 transitions. [2024-11-06 05:22:47,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 05:22:47,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-11-06 05:22:47,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:47,535 INFO L225 Difference]: With dead ends: 229 [2024-11-06 05:22:47,535 INFO L226 Difference]: Without dead ends: 111 [2024-11-06 05:22:47,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-06 05:22:47,537 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 37 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:47,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 503 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 05:22:47,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-06 05:22:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2024-11-06 05:22:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 80 states have internal predecessors, (95), 14 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-06 05:22:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 128 transitions. [2024-11-06 05:22:47,558 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 128 transitions. Word has length 39 [2024-11-06 05:22:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:47,558 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 128 transitions. [2024-11-06 05:22:47,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 05:22:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 128 transitions. [2024-11-06 05:22:47,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-06 05:22:47,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:47,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 05:22:47,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-06 05:22:47,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:47,760 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:47,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1045188466, now seen corresponding path program 1 times [2024-11-06 05:22:47,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:47,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366087767] [2024-11-06 05:22:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:47,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:47,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:47,762 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:47,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-06 05:22:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:47,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 05:22:47,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:52,026 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_4| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3| (_ 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_4|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_4| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3| (_ BitVec 64))) (not (= (_ bv0 64) (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_4|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3|))))) is different from true [2024-11-06 05:22:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:52,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:22:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:52,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:52,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366087767] [2024-11-06 05:22:52,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366087767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:22:52,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:22:52,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-06 05:22:52,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122709180] [2024-11-06 05:22:52,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:22:52,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:22:52,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:52,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:22:52,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-06 05:22:52,384 INFO L87 Difference]: Start difference. First operand 100 states and 128 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 05:22:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:52,884 INFO L93 Difference]: Finished difference Result 208 states and 278 transitions. [2024-11-06 05:22:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 05:22:52,884 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-11-06 05:22:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:52,886 INFO L225 Difference]: With dead ends: 208 [2024-11-06 05:22:52,886 INFO L226 Difference]: Without dead ends: 119 [2024-11-06 05:22:52,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2024-11-06 05:22:52,888 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:52,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 423 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 160 Unchecked, 0.4s Time] [2024-11-06 05:22:52,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-06 05:22:52,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2024-11-06 05:22:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 82 states have internal predecessors, (99), 14 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (16), 12 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-06 05:22:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2024-11-06 05:22:52,915 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 41 [2024-11-06 05:22:52,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:52,915 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2024-11-06 05:22:52,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 05:22:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2024-11-06 05:22:52,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 05:22:52,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:52,916 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 05:22:52,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-06 05:22:53,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:53,121 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:53,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:53,121 INFO L85 PathProgramCache]: Analyzing trace with hash 964483973, now seen corresponding path program 1 times [2024-11-06 05:22:53,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:53,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250826946] [2024-11-06 05:22:53,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:53,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:53,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:53,123 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:53,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-06 05:22:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:53,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 05:22:53,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-06 05:22:53,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:53,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:53,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250826946] [2024-11-06 05:22:53,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250826946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:53,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:53,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 05:22:53,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711443458] [2024-11-06 05:22:53,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:53,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 05:22:53,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:53,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 05:22:53,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 05:22:53,314 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 05:22:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:53,387 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2024-11-06 05:22:53,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 05:22:53,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-06 05:22:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:53,389 INFO L225 Difference]: With dead ends: 119 [2024-11-06 05:22:53,389 INFO L226 Difference]: Without dead ends: 117 [2024-11-06 05:22:53,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-06 05:22:53,390 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:53,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 454 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:22:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-06 05:22:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2024-11-06 05:22:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.25) internal successors, (105), 89 states have internal predecessors, (105), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2024-11-06 05:22:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2024-11-06 05:22:53,417 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 42 [2024-11-06 05:22:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:53,418 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2024-11-06 05:22:53,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 05:22:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2024-11-06 05:22:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 05:22:53,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:53,419 INFO L215 NwaCegarLoop]: trace histogram [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-06 05:22:53,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-06 05:22:53,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:53,623 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:53,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1440497479, now seen corresponding path program 1 times [2024-11-06 05:22:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:53,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070413388] [2024-11-06 05:22:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:53,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:53,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:53,627 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:53,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-06 05:22:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:53,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-06 05:22:53,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:53,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-06 05:22:53,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-06 05:22:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-06 05:22:54,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:22:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-06 05:22:55,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:55,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070413388] [2024-11-06 05:22:55,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070413388] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:22:55,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:22:55,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-06 05:22:55,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826580779] [2024-11-06 05:22:55,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:22:55,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-06 05:22:55,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:55,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-06 05:22:55,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-06 05:22:55,471 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 10 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 05:22:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:57,131 INFO L93 Difference]: Finished difference Result 237 states and 299 transitions. [2024-11-06 05:22:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 05:22:57,132 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 10 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 50 [2024-11-06 05:22:57,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:57,134 INFO L225 Difference]: With dead ends: 237 [2024-11-06 05:22:57,134 INFO L226 Difference]: Without dead ends: 136 [2024-11-06 05:22:57,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-11-06 05:22:57,135 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 65 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:57,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 559 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 05:22:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-06 05:22:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2024-11-06 05:22:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.240506329113924) internal successors, (98), 83 states have internal predecessors, (98), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-06 05:22:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2024-11-06 05:22:57,162 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 50 [2024-11-06 05:22:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:57,162 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2024-11-06 05:22:57,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 10 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 05:22:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2024-11-06 05:22:57,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 05:22:57,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:57,163 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:57,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-06 05:22:57,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:57,364 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:57,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:57,365 INFO L85 PathProgramCache]: Analyzing trace with hash -41969126, now seen corresponding path program 1 times [2024-11-06 05:22:57,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:57,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099777704] [2024-11-06 05:22:57,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:57,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:57,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:57,367 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:22:57,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-06 05:22:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:57,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-06 05:22:57,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:58,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:22:59,015 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-06 05:22:59,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 1 [2024-11-06 05:22:59,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 05:22:59,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-11-06 05:22:59,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 05:22:59,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 25 [2024-11-06 05:22:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 05:22:59,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:59,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099777704] [2024-11-06 05:22:59,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099777704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:22:59,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:22:59,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 24 [2024-11-06 05:22:59,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445521510] [2024-11-06 05:22:59,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:22:59,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-06 05:22:59,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:59,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-06 05:22:59,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2024-11-06 05:22:59,428 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 24 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 19 states have internal predecessors, (59), 10 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-06 05:23:01,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:01,548 INFO L93 Difference]: Finished difference Result 188 states and 236 transitions. [2024-11-06 05:23:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-06 05:23:01,549 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 19 states have internal predecessors, (59), 10 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 58 [2024-11-06 05:23:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:01,550 INFO L225 Difference]: With dead ends: 188 [2024-11-06 05:23:01,550 INFO L226 Difference]: Without dead ends: 138 [2024-11-06 05:23:01,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=176, Invalid=1384, Unknown=0, NotChecked=0, Total=1560 [2024-11-06 05:23:01,551 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 142 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:01,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 782 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 05:23:01,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-06 05:23:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2024-11-06 05:23:01,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.1875) internal successors, (114), 98 states have internal predecessors, (114), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 12 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-06 05:23:01,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2024-11-06 05:23:01,584 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 58 [2024-11-06 05:23:01,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:01,584 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2024-11-06 05:23:01,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 19 states have internal predecessors, (59), 10 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-06 05:23:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2024-11-06 05:23:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-06 05:23:01,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:01,585 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:23:01,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-06 05:23:01,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:23:01,790 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:01,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:01,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1239716043, now seen corresponding path program 1 times [2024-11-06 05:23:01,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:01,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398220662] [2024-11-06 05:23:01,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:01,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:23:01,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:01,792 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:23:01,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-06 05:23:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:02,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-06 05:23:02,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:02,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 05:23:02,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 05:23:02,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 05:23:02,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2024-11-06 05:23:02,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 05:23:02,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 05:23:02,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 05:23:02,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 19 [2024-11-06 05:23:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 05:23:05,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:23:05,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:05,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398220662] [2024-11-06 05:23:05,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398220662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:23:05,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:23:05,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-06 05:23:05,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240880184] [2024-11-06 05:23:05,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:05,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:23:05,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:05,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:23:05,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:23:05,007 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 12 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 7 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-06 05:23:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:06,441 INFO L93 Difference]: Finished difference Result 144 states and 164 transitions. [2024-11-06 05:23:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 05:23:06,442 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 7 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 78 [2024-11-06 05:23:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:06,443 INFO L225 Difference]: With dead ends: 144 [2024-11-06 05:23:06,443 INFO L226 Difference]: Without dead ends: 137 [2024-11-06 05:23:06,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:23:06,444 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:06,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 431 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 05:23:06,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-06 05:23:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 121. [2024-11-06 05:23:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.1473684210526316) internal successors, (109), 97 states have internal predecessors, (109), 13 states have call successors, (13), 12 states have call predecessors, (13), 12 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-06 05:23:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2024-11-06 05:23:06,485 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 78 [2024-11-06 05:23:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:06,485 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2024-11-06 05:23:06,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 7 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-06 05:23:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2024-11-06 05:23:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-06 05:23:06,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:06,486 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:23:06,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-06 05:23:06,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:23:06,691 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:06,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:06,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2049062669, now seen corresponding path program 1 times [2024-11-06 05:23:06,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:06,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015130654] [2024-11-06 05:23:06,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:06,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:23:06,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:06,695 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:23:06,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-06 05:23:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:06,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-06 05:23:06,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:11,099 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) (bvadd (_ bv24 64) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|))))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) (bvadd (_ bv24 64) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)))))) is different from true [2024-11-06 05:23:15,264 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_8| (_ BitVec 64)) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_8| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_8|) (bvadd (_ bv24 64) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_8|))))) (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_8| (_ BitVec 64)) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_8| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_8|) (bvadd (_ bv24 64) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_8|)))))) is different from true [2024-11-06 05:23:39,835 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_10| (_ BitVec 64)) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_10| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_10|) (bvadd (_ bv24 64) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_10|))))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_10| (_ BitVec 64)) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_10| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_10|) (bvadd (_ bv24 64) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_10|)) (_ bv0 64))))) is different from true [2024-11-06 05:23:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2024-11-06 05:23:48,999 INFO L311 TraceCheckSpWp]: Computing backward predicates...