/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_remove_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 05:24:12,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 05:24:12,414 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:24:12,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 05:24:12,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 05:24:12,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 05:24:12,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 05:24:12,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 05:24:12,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 05:24:12,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 05:24:12,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 05:24:12,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 05:24:12,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 05:24:12,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 05:24:12,455 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 05:24:12,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 05:24:12,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 05:24:12,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 05:24:12,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 05:24:12,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 05:24:12,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 05:24:12,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 05:24:12,458 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 05:24:12,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 05:24:12,458 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 05:24:12,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 05:24:12,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 05:24:12,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 05:24:12,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 05:24:12,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 05:24:12,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 05:24:12,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 05:24:12,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 05:24:12,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 05:24:12,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 05:24:12,461 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 05:24:12,462 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 05:24:12,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 05:24:12,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 05:24:12,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 05:24:12,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 05:24:12,463 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:24:12,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 05:24:12,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 05:24:12,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 05:24:12,694 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 05:24:12,694 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 05:24:12,695 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_remove_harness.i [2024-11-06 05:24:14,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 05:24:14,416 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 05:24:14,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness.i [2024-11-06 05:24:14,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88bc814d5/368052d26d7a4c2698305d065f2196de/FLAGfabc628e8 [2024-11-06 05:24:14,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88bc814d5/368052d26d7a4c2698305d065f2196de [2024-11-06 05:24:14,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 05:24:14,461 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 05:24:14,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 05:24:14,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 05:24:14,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 05:24:14,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 05:24:14" (1/1) ... [2024-11-06 05:24:14,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab784b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:14, skipping insertion in model container [2024-11-06 05:24:14,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 05:24:14" (1/1) ... [2024-11-06 05:24:14,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 05:24:14,825 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_remove_harness.i[4496,4509] [2024-11-06 05:24:14,833 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_remove_harness.i[4556,4569] [2024-11-06 05:24:15,387 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:24:15,483 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:24:15,483 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:24:15,484 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:24:15,492 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:24:15,495 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:15,496 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:15,498 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:15,499 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:24:15,499 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:15,500 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:15,502 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:24:15,502 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:24:15,504 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:24:15,505 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:24:15,517 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:15,518 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:24:15,518 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:15,518 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:24:15,520 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:15,521 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:24:15,521 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:15,553 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:24:15,555 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:15,556 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:24:15,556 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:15,557 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:24:15,557 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:15,557 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:15,845 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:24:15,845 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:24:15,846 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:24:15,848 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:24:15,950 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:24:15,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:24:15,982 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-06 05:24:16,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 05:24:16,015 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_remove_harness.i[4496,4509] [2024-11-06 05:24:16,016 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_remove_harness.i[4556,4569] [2024-11-06 05:24:16,036 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:24:16,061 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:24:16,061 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:24:16,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:24:16,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:24:16,071 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,076 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,076 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,077 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:24:16,077 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,078 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,085 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:24:16,086 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:24:16,087 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:24:16,088 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:24:16,093 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,093 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:24:16,094 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,094 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:24:16,095 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,095 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:24:16,096 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,096 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:24:16,097 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,097 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:24:16,098 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,098 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:24:16,098 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,098 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,142 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:24:16,142 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:24:16,143 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:24:16,143 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:24:16,183 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:24:16,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:24:16,203 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 05:24:16,218 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_remove_harness.i[4496,4509] [2024-11-06 05:24:16,219 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_remove_harness.i[4556,4569] [2024-11-06 05:24:16,276 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,277 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,277 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,278 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,278 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,288 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,288 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,289 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,290 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,290 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,291 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,291 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,292 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:16,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:24:16,558 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-06 05:24:16,566 INFO L204 MainTranslator]: Completed translation [2024-11-06 05:24:16,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:16 WrapperNode [2024-11-06 05:24:16,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 05:24:16,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 05:24:16,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 05:24:16,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 05:24:16,574 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:24:16" (1/1) ... [2024-11-06 05:24:16,648 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:24:16" (1/1) ... [2024-11-06 05:24:16,690 INFO L138 Inliner]: procedures = 687, calls = 1048, calls flagged for inlining = 49, calls inlined = 4, statements flattened = 88 [2024-11-06 05:24:16,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 05:24:16,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 05:24:16,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 05:24:16,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 05:24:16,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:16" (1/1) ... [2024-11-06 05:24:16,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:16" (1/1) ... [2024-11-06 05:24:16,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:16" (1/1) ... [2024-11-06 05:24:16,738 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 23, 5]. 77 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 7 writes are split as follows [0, 7, 0]. [2024-11-06 05:24:16,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:16" (1/1) ... [2024-11-06 05:24:16,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:16" (1/1) ... [2024-11-06 05:24:16,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:16" (1/1) ... [2024-11-06 05:24:16,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:16" (1/1) ... [2024-11-06 05:24:16,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:16" (1/1) ... [2024-11-06 05:24:16,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:16" (1/1) ... [2024-11-06 05:24:16,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 05:24:16,789 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 05:24:16,789 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 05:24:16,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 05:24:16,790 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:16" (1/1) ... [2024-11-06 05:24:16,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 05:24:16,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 05:24:16,820 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:24:16,826 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:24:16,851 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2024-11-06 05:24:16,851 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2024-11-06 05:24:16,851 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2024-11-06 05:24:16,851 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2024-11-06 05:24:16,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 05:24:16,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 05:24:16,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 05:24:16,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 05:24:16,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 05:24:16,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 05:24:16,852 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-06 05:24:16,852 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-06 05:24:16,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 05:24:16,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 05:24:16,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 05:24:16,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-06 05:24:16,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 05:24:16,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 05:24:16,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-06 05:24:16,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-06 05:24:16,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-06 05:24:16,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-06 05:24:16,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-06 05:24:16,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-06 05:24:16,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-06 05:24:16,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-06 05:24:16,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-06 05:24:16,854 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 05:24:16,854 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 05:24:16,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 05:24:16,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 05:24:16,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 05:24:16,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-06 05:24:16,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-06 05:24:16,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-06 05:24:16,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-06 05:24:16,854 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2024-11-06 05:24:16,854 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2024-11-06 05:24:17,132 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 05:24:17,134 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 05:24:17,557 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-06 05:24:17,557 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 05:24:17,572 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 05:24:17,573 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-06 05:24:17,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 05:24:17 BoogieIcfgContainer [2024-11-06 05:24:17,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 05:24:17,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 05:24:17,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 05:24:17,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 05:24:17,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 05:24:14" (1/3) ... [2024-11-06 05:24:17,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279ecfa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 05:24:17, skipping insertion in model container [2024-11-06 05:24:17,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:16" (2/3) ... [2024-11-06 05:24:17,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279ecfa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 05:24:17, skipping insertion in model container [2024-11-06 05:24:17,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 05:24:17" (3/3) ... [2024-11-06 05:24:17,581 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_remove_harness.i [2024-11-06 05:24:17,596 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 05:24:17,596 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 05:24:17,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 05:24:17,687 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;@3c17d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 05:24:17,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 05:24:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 50 states have internal predecessors, (62), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-06 05:24:17,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 05:24:17,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:17,701 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:24:17,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:17,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:17,708 INFO L85 PathProgramCache]: Analyzing trace with hash -262517723, now seen corresponding path program 1 times [2024-11-06 05:24:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:17,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535877217] [2024-11-06 05:24:17,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:24:17,723 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:24:17,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:17,727 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:24:17,733 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:24:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:24:17,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 05:24:17,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 05:24:18,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:24:18,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:18,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535877217] [2024-11-06 05:24:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535877217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:24:18,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:24:18,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 05:24:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822338852] [2024-11-06 05:24:18,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:24:18,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 05:24:18,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:18,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 05:24:18,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 05:24:18,048 INFO L87 Difference]: Start difference. First operand has 74 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 50 states have internal predecessors, (62), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-06 05:24:18,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:18,077 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2024-11-06 05:24:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 05:24:18,080 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-11-06 05:24:18,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:18,089 INFO L225 Difference]: With dead ends: 142 [2024-11-06 05:24:18,089 INFO L226 Difference]: Without dead ends: 69 [2024-11-06 05:24:18,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:24:18,097 INFO L432 NwaCegarLoop]: 91 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, 91 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:24:18,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:24:18,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-06 05:24:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-06 05:24:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-06 05:24:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2024-11-06 05:24:18,145 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 48 [2024-11-06 05:24:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:18,146 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2024-11-06 05:24:18,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-06 05:24:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2024-11-06 05:24:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-06 05:24:18,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:18,150 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:24:18,161 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 (2)] Ended with exit code 0 [2024-11-06 05:24:18,351 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:24:18,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:18,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1590307628, now seen corresponding path program 1 times [2024-11-06 05:24:18,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:18,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462019999] [2024-11-06 05:24:18,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:24:18,353 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:24:18,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:18,358 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:24:18,359 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:24:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:24:18,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 05:24:18,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 05:24:18,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:24:18,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:18,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462019999] [2024-11-06 05:24:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462019999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:24:18,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:24:18,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 05:24:18,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702731970] [2024-11-06 05:24:18,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:24:18,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 05:24:18,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:18,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 05:24:18,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:24:18,716 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 05:24:18,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:18,977 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2024-11-06 05:24:18,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 05:24:18,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-11-06 05:24:18,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:18,981 INFO L225 Difference]: With dead ends: 139 [2024-11-06 05:24:18,981 INFO L226 Difference]: Without dead ends: 78 [2024-11-06 05:24:18,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 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:24:18,983 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 25 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 05:24:18,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 351 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 05:24:18,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-06 05:24:19,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-06 05:24:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 50 states have internal predecessors, (58), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-06 05:24:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2024-11-06 05:24:19,006 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 54 [2024-11-06 05:24:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:19,006 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2024-11-06 05:24:19,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 05:24:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2024-11-06 05:24:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-06 05:24:19,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:19,008 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:24:19,018 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 (3)] Ended with exit code 0 [2024-11-06 05:24:19,213 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:24:19,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:19,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:19,214 INFO L85 PathProgramCache]: Analyzing trace with hash 653675670, now seen corresponding path program 1 times [2024-11-06 05:24:19,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:19,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859922605] [2024-11-06 05:24:19,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:24:19,216 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:24:19,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:19,218 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:24:19,220 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:24:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:24:19,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:24:19,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 05:24:19,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:24:19,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:19,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859922605] [2024-11-06 05:24:19,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859922605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:24:19,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:24:19,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 05:24:19,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507053657] [2024-11-06 05:24:19,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:24:19,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 05:24:19,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:19,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 05:24:19,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 05:24:19,445 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 05:24:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:19,480 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2024-11-06 05:24:19,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 05:24:19,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-11-06 05:24:19,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:19,483 INFO L225 Difference]: With dead ends: 131 [2024-11-06 05:24:19,483 INFO L226 Difference]: Without dead ends: 75 [2024-11-06 05:24:19,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 05:24:19,485 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:24:19,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:24:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-06 05:24:19,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-06 05:24:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-06 05:24:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2024-11-06 05:24:19,500 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 54 [2024-11-06 05:24:19,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:19,500 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2024-11-06 05:24:19,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 05:24:19,501 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2024-11-06 05:24:19,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 05:24:19,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:19,506 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:24:19,515 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 (4)] Ended with exit code 0 [2024-11-06 05:24:19,706 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:24:19,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:19,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:19,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1071557394, now seen corresponding path program 1 times [2024-11-06 05:24:19,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:19,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776285392] [2024-11-06 05:24:19,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:24:19,708 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:24:19,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:19,709 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:24:19,710 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:24:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:24:19,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 05:24:19,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 05:24:19,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:24:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 05:24:20,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:20,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776285392] [2024-11-06 05:24:20,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776285392] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:24:20,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:24:20,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-06 05:24:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820425527] [2024-11-06 05:24:20,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:24:20,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 05:24:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:20,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 05:24:20,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-06 05:24:20,123 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-06 05:24:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:20,226 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2024-11-06 05:24:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 05:24:20,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2024-11-06 05:24:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:20,229 INFO L225 Difference]: With dead ends: 136 [2024-11-06 05:24:20,229 INFO L226 Difference]: Without dead ends: 78 [2024-11-06 05:24:20,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-06 05:24:20,230 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:24:20,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:24:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-06 05:24:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-06 05:24:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 54 states have internal predecessors, (62), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-06 05:24:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2024-11-06 05:24:20,239 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 55 [2024-11-06 05:24:20,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:20,240 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2024-11-06 05:24:20,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-06 05:24:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2024-11-06 05:24:20,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 05:24:20,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:20,241 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:24:20,253 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:24:20,445 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:24:20,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:20,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:20,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1297615766, now seen corresponding path program 2 times [2024-11-06 05:24:20,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:20,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006607273] [2024-11-06 05:24:20,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:24:20,447 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:24:20,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:20,448 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:24:20,449 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:24:20,696 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 05:24:20,696 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:24:20,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 05:24:20,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 05:24:20,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:24:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 05:24:21,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:21,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006607273] [2024-11-06 05:24:21,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006607273] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:24:21,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:24:21,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-06 05:24:21,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855963250] [2024-11-06 05:24:21,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:24:21,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 05:24:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:21,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 05:24:21,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:24:21,055 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-06 05:24:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:21,395 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2024-11-06 05:24:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 05:24:21,396 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2024-11-06 05:24:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:21,397 INFO L225 Difference]: With dead ends: 142 [2024-11-06 05:24:21,397 INFO L226 Difference]: Without dead ends: 84 [2024-11-06 05:24:21,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2024-11-06 05:24:21,398 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:24:21,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 501 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:24:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-06 05:24:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-06 05:24:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 60 states have internal predecessors, (68), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-06 05:24:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2024-11-06 05:24:21,417 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 58 [2024-11-06 05:24:21,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:21,417 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2024-11-06 05:24:21,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-06 05:24:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2024-11-06 05:24:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-06 05:24:21,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:21,418 INFO L215 NwaCegarLoop]: trace histogram [10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:24:21,432 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 (6)] Forceful destruction successful, exit code 0 [2024-11-06 05:24:21,625 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:24:21,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:21,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:21,626 INFO L85 PathProgramCache]: Analyzing trace with hash 952539670, now seen corresponding path program 3 times [2024-11-06 05:24:21,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:21,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267609782] [2024-11-06 05:24:21,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 05:24:21,627 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:24:21,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:21,631 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:24:21,633 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:24:22,067 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-06 05:24:22,067 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:24:22,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 05:24:22,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 05:24:22,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:24:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 05:24:22,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:22,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267609782] [2024-11-06 05:24:22,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267609782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:24:22,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:24:22,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-06 05:24:22,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324675488] [2024-11-06 05:24:22,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:24:22,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-06 05:24:22,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:22,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-06 05:24:22,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=462, Unknown=0, NotChecked=0, Total=650 [2024-11-06 05:24:22,941 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-06 05:24:24,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:24,233 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2024-11-06 05:24:24,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-06 05:24:24,233 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2024-11-06 05:24:24,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:24,239 INFO L225 Difference]: With dead ends: 154 [2024-11-06 05:24:24,239 INFO L226 Difference]: Without dead ends: 96 [2024-11-06 05:24:24,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=398, Invalid=862, Unknown=0, NotChecked=0, Total=1260 [2024-11-06 05:24:24,244 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 05:24:24,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1163 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 05:24:24,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-06 05:24:24,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-06 05:24:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 72 states have internal predecessors, (81), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-06 05:24:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2024-11-06 05:24:24,256 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 64 [2024-11-06 05:24:24,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:24,257 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2024-11-06 05:24:24,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-06 05:24:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2024-11-06 05:24:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-06 05:24:24,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:24,259 INFO L215 NwaCegarLoop]: trace histogram [16, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:24:24,271 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 (7)] Forceful destruction successful, exit code 0 [2024-11-06 05:24:24,459 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:24:24,460 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:24,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:24,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2119153514, now seen corresponding path program 4 times [2024-11-06 05:24:24,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:24,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205540811] [2024-11-06 05:24:24,461 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-06 05:24:24,461 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:24:24,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:24,462 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:24:24,463 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:24:24,829 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-06 05:24:24,829 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:24:24,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-06 05:24:24,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:24,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-06 05:24:24,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:25,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:25,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:25,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:25,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:25,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:25,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:25,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:25,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:25,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:25,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:25,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:25,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:25,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:25,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-06 05:24:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 05:24:26,467 INFO L311 TraceCheckSpWp]: Computing backward predicates...