/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver bitwuzla -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness_negated.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 13:58:57,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 13:58:57,812 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-05 13:58:57,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 13:58:57,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 13:58:57,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 13:58:57,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 13:58:57,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 13:58:57,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 13:58:57,846 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 13:58:57,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 13:58:57,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 13:58:57,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 13:58:57,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 13:58:57,847 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 13:58:57,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 13:58:57,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 13:58:57,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 13:58:57,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 13:58:57,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 13:58:57,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 13:58:57,852 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 13:58:57,852 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 13:58:57,852 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 13:58:57,852 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 13:58:57,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 13:58:57,853 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 13:58:57,853 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 13:58:57,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 13:58:57,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 13:58:57,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 13:58:57,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 13:58:57,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 13:58:57,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 13:58:57,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 13:58:57,854 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 13:58:57,854 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 13:58:57,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 13:58:57,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 13:58:57,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 13:58:57,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 13:58:57,856 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> bitwuzla [2024-11-05 13:58:58,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 13:58:58,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 13:58:58,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 13:58:58,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 13:58:58,091 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 13:58:58,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness_negated.i [2024-11-05 13:58:59,311 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 13:58:59,642 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 13:58:59,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness_negated.i [2024-11-05 13:58:59,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19191da92/c5cf67c6ba58447ab5c30b2ea486ffae/FLAG2a258a20f [2024-11-05 13:58:59,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19191da92/c5cf67c6ba58447ab5c30b2ea486ffae [2024-11-05 13:58:59,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 13:58:59,891 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 13:58:59,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 13:58:59,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 13:58:59,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 13:58:59,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 01:58:59" (1/1) ... [2024-11-05 13:58:59,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5d15e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:58:59, skipping insertion in model container [2024-11-05 13:58:59,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 01:58:59" (1/1) ... [2024-11-05 13:58:59,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 13:59:00,203 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness_negated.i[4494,4507] [2024-11-05 13:59:00,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness_negated.i[4554,4567] [2024-11-05 13:59:00,786 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-05 13:59:00,870 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-05 13:59:00,870 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-05 13:59:00,871 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-05 13:59:00,881 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-05 13:59:00,887 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:00,888 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:00,888 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:00,888 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:00,889 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:00,889 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:00,894 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-05 13:59:00,894 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-05 13:59:00,895 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-05 13:59:00,896 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:00,904 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:00,904 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-05 13:59:00,904 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:00,904 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-05 13:59:00,905 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:00,906 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:00,906 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:00,906 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:00,907 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:00,908 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:00,908 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:00,908 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:00,909 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:00,909 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,161 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-05 13:59:01,162 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-05 13:59:01,162 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-05 13:59:01,162 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-05 13:59:01,282 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-05 13:59:01,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 13:59:01,314 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-05 13:59:01,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 13:59:01,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness_negated.i[4494,4507] [2024-11-05 13:59:01,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness_negated.i[4554,4567] [2024-11-05 13:59:01,368 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-05 13:59:01,391 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-05 13:59:01,392 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-05 13:59:01,392 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-05 13:59:01,403 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:01,404 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,404 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,404 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,405 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:01,405 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,405 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,406 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:01,407 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-05 13:59:01,408 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-05 13:59:01,408 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-05 13:59:01,411 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,411 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-05 13:59:01,411 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,411 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-05 13:59:01,412 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,412 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-05 13:59:01,412 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,413 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:01,413 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,414 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:01,414 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,414 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 13:59:01,414 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,414 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,473 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-05 13:59:01,473 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-05 13:59:01,474 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-05 13:59:01,474 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-05 13:59:01,503 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-05 13:59:01,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 13:59:01,517 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 13:59:01,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness_negated.i[4494,4507] [2024-11-05 13:59:01,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness_negated.i[4554,4567] [2024-11-05 13:59:01,567 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,568 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,568 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,568 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,569 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,575 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,578 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,579 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,579 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,580 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,580 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,582 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,582 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 13:59:01,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 13:59:01,758 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-05 13:59:01,769 INFO L204 MainTranslator]: Completed translation [2024-11-05 13:59:01,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:01 WrapperNode [2024-11-05 13:59:01,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 13:59:01,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 13:59:01,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 13:59:01,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 13:59:01,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:01" (1/1) ... [2024-11-05 13:59:01,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:01" (1/1) ... [2024-11-05 13:59:01,871 INFO L138 Inliner]: procedures = 687, calls = 1034, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 93 [2024-11-05 13:59:01,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 13:59:01,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 13:59:01,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 13:59:01,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 13:59:01,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:01" (1/1) ... [2024-11-05 13:59:01,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:01" (1/1) ... [2024-11-05 13:59:01,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:01" (1/1) ... [2024-11-05 13:59:01,916 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 13, 5]. 65 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 4 writes are split as follows [0, 4, 0]. [2024-11-05 13:59:01,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:01" (1/1) ... [2024-11-05 13:59:01,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:01" (1/1) ... [2024-11-05 13:59:01,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:01" (1/1) ... [2024-11-05 13:59:01,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:01" (1/1) ... [2024-11-05 13:59:01,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:01" (1/1) ... [2024-11-05 13:59:01,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:01" (1/1) ... [2024-11-05 13:59:01,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 13:59:01,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 13:59:01,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 13:59:01,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 13:59:01,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:01" (1/1) ... [2024-11-05 13:59:01,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 13:59:01,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 13:59:01,993 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-05 13:59:01,996 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-05 13:59:02,021 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2024-11-05 13:59:02,021 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2024-11-05 13:59:02,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 13:59:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 13:59:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 13:59:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 13:59:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 13:59:02,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 13:59:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-05 13:59:02,023 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-05 13:59:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-05 13:59:02,023 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-05 13:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 13:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-05 13:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-05 13:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-05 13:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 13:59:02,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 13:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2024-11-05 13:59:02,024 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2024-11-05 13:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 13:59:02,024 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 13:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 13:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-05 13:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-05 13:59:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-05 13:59:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-05 13:59:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-05 13:59:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-05 13:59:02,284 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 13:59:02,287 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 13:59:02,551 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-05 13:59:02,551 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 13:59:02,563 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 13:59:02,564 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 13:59:02,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 01:59:02 BoogieIcfgContainer [2024-11-05 13:59:02,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 13:59:02,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 13:59:02,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 13:59:02,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 13:59:02,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 01:58:59" (1/3) ... [2024-11-05 13:59:02,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78801a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 01:59:02, skipping insertion in model container [2024-11-05 13:59:02,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:59:01" (2/3) ... [2024-11-05 13:59:02,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78801a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 01:59:02, skipping insertion in model container [2024-11-05 13:59:02,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 01:59:02" (3/3) ... [2024-11-05 13:59:02,572 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness_negated.i [2024-11-05 13:59:02,586 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 13:59:02,586 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 13:59:02,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 13:59:02,644 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;@34282f92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 13:59:02,644 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 13:59:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 13:59:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 13:59:02,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:02,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 13:59:02,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:02,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:02,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1017333715, now seen corresponding path program 1 times [2024-11-05 13:59:02,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:02,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1268738583] [2024-11-05 13:59:02,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:02,671 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:02,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:02,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:02,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Waiting until timeout for monitored process [2024-11-05 13:59:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 13:59:02,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 13:59:02,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 13:59:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 13:59:02,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 13:59:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 13:59:02,878 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 13:59:02,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1268738583] [2024-11-05 13:59:02,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1268738583] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 13:59:02,879 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 13:59:02,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-05 13:59:02,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134132521] [2024-11-05 13:59:02,881 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 13:59:02,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 13:59:02,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 13:59:02,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 13:59:02,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 13:59:02,904 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 13:59:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 13:59:02,926 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2024-11-05 13:59:02,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 13:59:02,927 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-11-05 13:59:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 13:59:02,932 INFO L225 Difference]: With dead ends: 117 [2024-11-05 13:59:02,933 INFO L226 Difference]: Without dead ends: 56 [2024-11-05 13:59:02,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-05 13:59:02,938 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 13:59:02,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 13:59:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-05 13:59:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-05 13:59:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-05 13:59:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2024-11-05 13:59:02,976 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 26 [2024-11-05 13:59:02,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 13:59:02,977 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2024-11-05 13:59:02,977 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 13:59:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2024-11-05 13:59:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 13:59:02,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:02,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 13:59:02,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Ended with exit code 0 [2024-11-05 13:59:03,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:03,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:03,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1834982165, now seen corresponding path program 1 times [2024-11-05 13:59:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:03,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [685522430] [2024-11-05 13:59:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:03,182 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:03,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:03,184 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:03,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Waiting until timeout for monitored process [2024-11-05 13:59:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 13:59:03,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 13:59:03,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 13:59:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 13:59:03,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 13:59:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 13:59:03,400 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 13:59:03,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [685522430] [2024-11-05 13:59:03,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [685522430] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 13:59:03,400 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 13:59:03,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2024-11-05 13:59:03,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683888402] [2024-11-05 13:59:03,401 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 13:59:03,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 13:59:03,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 13:59:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 13:59:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 13:59:03,403 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 13:59:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 13:59:03,475 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2024-11-05 13:59:03,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 13:59:03,476 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-05 13:59:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 13:59:03,478 INFO L225 Difference]: With dead ends: 66 [2024-11-05 13:59:03,478 INFO L226 Difference]: Without dead ends: 64 [2024-11-05 13:59:03,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-05 13:59:03,482 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 13:59:03,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 461 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 13:59:03,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-05 13:59:03,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-11-05 13:59:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-05 13:59:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2024-11-05 13:59:03,493 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 26 [2024-11-05 13:59:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 13:59:03,494 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2024-11-05 13:59:03,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 13:59:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2024-11-05 13:59:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-05 13:59:03,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:03,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 13:59:03,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Ended with exit code 0 [2024-11-05 13:59:03,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:03,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:03,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:03,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1687611897, now seen corresponding path program 1 times [2024-11-05 13:59:03,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:03,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1249567189] [2024-11-05 13:59:03,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:03,698 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:03,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:03,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:03,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Waiting until timeout for monitored process [2024-11-05 13:59:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 13:59:03,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 13:59:03,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 13:59:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 13:59:03,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 13:59:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 13:59:03,877 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 13:59:03,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1249567189] [2024-11-05 13:59:03,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1249567189] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 13:59:03,877 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 13:59:03,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2024-11-05 13:59:03,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189703240] [2024-11-05 13:59:03,878 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 13:59:03,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 13:59:03,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 13:59:03,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 13:59:03,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-05 13:59:03,879 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 13:59:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 13:59:03,924 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2024-11-05 13:59:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 13:59:03,925 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-05 13:59:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 13:59:03,926 INFO L225 Difference]: With dead ends: 74 [2024-11-05 13:59:03,926 INFO L226 Difference]: Without dead ends: 72 [2024-11-05 13:59:03,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-05 13:59:03,927 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 6 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 13:59:03,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 453 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 13:59:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-05 13:59:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2024-11-05 13:59:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-05 13:59:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2024-11-05 13:59:03,943 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 28 [2024-11-05 13:59:03,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 13:59:03,943 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2024-11-05 13:59:03,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 13:59:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2024-11-05 13:59:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-05 13:59:03,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:03,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 13:59:03,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Ended with exit code 0 [2024-11-05 13:59:04,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:04,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:04,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:04,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1850407916, now seen corresponding path program 1 times [2024-11-05 13:59:04,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:04,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1645941785] [2024-11-05 13:59:04,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:04,146 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:04,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:04,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:04,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Waiting until timeout for monitored process [2024-11-05 13:59:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 13:59:04,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 13:59:04,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 13:59:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 13:59:04,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 13:59:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 13:59:04,340 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 13:59:04,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1645941785] [2024-11-05 13:59:04,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1645941785] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 13:59:04,340 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 13:59:04,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2024-11-05 13:59:04,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231532887] [2024-11-05 13:59:04,341 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 13:59:04,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 13:59:04,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 13:59:04,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 13:59:04,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-05 13:59:04,342 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 13:59:04,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 13:59:04,413 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2024-11-05 13:59:04,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 13:59:04,415 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-05 13:59:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 13:59:04,416 INFO L225 Difference]: With dead ends: 77 [2024-11-05 13:59:04,416 INFO L226 Difference]: Without dead ends: 75 [2024-11-05 13:59:04,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-05 13:59:04,417 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 13:59:04,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 566 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 13:59:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-05 13:59:04,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2024-11-05 13:59:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 47 states have internal predecessors, (57), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-05 13:59:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2024-11-05 13:59:04,429 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 30 [2024-11-05 13:59:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 13:59:04,429 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-11-05 13:59:04,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 13:59:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2024-11-05 13:59:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-05 13:59:04,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:04,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 13:59:04,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Forceful destruction successful, exit code 0 [2024-11-05 13:59:04,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:04,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:04,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:04,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1395309347, now seen corresponding path program 1 times [2024-11-05 13:59:04,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:04,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1103284337] [2024-11-05 13:59:04,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:04,631 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:04,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:04,633 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:04,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (6)] Waiting until timeout for monitored process [2024-11-05 13:59:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 13:59:04,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 13:59:04,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 13:59:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 13:59:04,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 13:59:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 13:59:04,825 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 13:59:04,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1103284337] [2024-11-05 13:59:04,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1103284337] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 13:59:04,825 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 13:59:04,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 3] imperfect sequences [] total 9 [2024-11-05 13:59:04,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129453441] [2024-11-05 13:59:04,826 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 13:59:04,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 13:59:04,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 13:59:04,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 13:59:04,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-05 13:59:04,827 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 13:59:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 13:59:05,034 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2024-11-05 13:59:05,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 13:59:05,037 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2024-11-05 13:59:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 13:59:05,038 INFO L225 Difference]: With dead ends: 126 [2024-11-05 13:59:05,038 INFO L226 Difference]: Without dead ends: 73 [2024-11-05 13:59:05,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-05 13:59:05,038 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 26 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 13:59:05,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 347 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 13:59:05,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-05 13:59:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2024-11-05 13:59:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 49 states have internal predecessors, (60), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-05 13:59:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2024-11-05 13:59:05,050 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 31 [2024-11-05 13:59:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 13:59:05,050 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2024-11-05 13:59:05,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 13:59:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2024-11-05 13:59:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-05 13:59:05,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:05,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 13:59:05,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (6)] Ended with exit code 0 [2024-11-05 13:59:05,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:05,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:05,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:05,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1138780288, now seen corresponding path program 1 times [2024-11-05 13:59:05,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:05,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1142783000] [2024-11-05 13:59:05,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:05,255 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:05,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:05,256 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:05,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (7)] Waiting until timeout for monitored process [2024-11-05 13:59:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 13:59:05,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-05 13:59:05,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 13:59:05,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2024-11-05 13:59:05,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2024-11-05 13:59:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 13:59:06,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 13:59:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 13:59:06,739 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 13:59:06,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1142783000] [2024-11-05 13:59:06,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1142783000] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 13:59:06,739 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 13:59:06,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 6] imperfect sequences [] total 14 [2024-11-05 13:59:06,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989737157] [2024-11-05 13:59:06,739 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 13:59:06,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 13:59:06,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 13:59:06,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 13:59:06,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-05 13:59:06,740 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 14 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-05 13:59:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 13:59:07,777 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2024-11-05 13:59:07,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 13:59:07,778 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) Word has length 42 [2024-11-05 13:59:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 13:59:07,779 INFO L225 Difference]: With dead ends: 135 [2024-11-05 13:59:07,779 INFO L226 Difference]: Without dead ends: 76 [2024-11-05 13:59:07,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-11-05 13:59:07,780 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 64 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-05 13:59:07,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 426 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-05 13:59:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-05 13:59:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-05 13:59:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-05 13:59:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2024-11-05 13:59:07,792 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 42 [2024-11-05 13:59:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 13:59:07,792 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2024-11-05 13:59:07,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-05 13:59:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2024-11-05 13:59:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-05 13:59:07,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:07,793 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 13:59:07,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (7)] Ended with exit code 0 [2024-11-05 13:59:07,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:07,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:07,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:07,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1272793794, now seen corresponding path program 1 times [2024-11-05 13:59:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:07,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [833333771] [2024-11-05 13:59:07,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:07,997 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:07,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:07,998 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:07,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (8)] Waiting until timeout for monitored process [2024-11-05 13:59:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 13:59:08,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-05 13:59:08,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 13:59:08,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2024-11-05 13:59:08,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2024-11-05 13:59:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 13:59:09,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 13:59:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 13:59:09,621 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 13:59:09,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [833333771] [2024-11-05 13:59:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [833333771] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 13:59:09,621 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 13:59:09,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 19 [2024-11-05 13:59:09,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003732570] [2024-11-05 13:59:09,621 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 13:59:09,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-05 13:59:09,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 13:59:09,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-05 13:59:09,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-05 13:59:09,622 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand has 19 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-05 13:59:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 13:59:10,829 INFO L93 Difference]: Finished difference Result 144 states and 182 transitions. [2024-11-05 13:59:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 13:59:10,829 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) Word has length 42 [2024-11-05 13:59:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 13:59:10,830 INFO L225 Difference]: With dead ends: 144 [2024-11-05 13:59:10,830 INFO L226 Difference]: Without dead ends: 81 [2024-11-05 13:59:10,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-05 13:59:10,832 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 69 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-05 13:59:10,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 603 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-05 13:59:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-05 13:59:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-11-05 13:59:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 58 states have internal predecessors, (70), 11 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-05 13:59:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2024-11-05 13:59:10,847 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 42 [2024-11-05 13:59:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 13:59:10,848 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2024-11-05 13:59:10,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-05 13:59:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2024-11-05 13:59:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-05 13:59:10,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:10,848 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 13:59:10,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (8)] Ended with exit code 0 [2024-11-05 13:59:11,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:11,050 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:11,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:11,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1210754180, now seen corresponding path program 1 times [2024-11-05 13:59:11,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:11,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1366089954] [2024-11-05 13:59:11,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:11,051 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:11,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:11,052 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:11,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (9)] Waiting until timeout for monitored process [2024-11-05 13:59:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 13:59:11,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-05 13:59:11,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 13:59:11,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2024-11-05 13:59:11,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2024-11-05 13:59:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 13:59:11,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 13:59:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 13:59:12,254 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 13:59:12,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1366089954] [2024-11-05 13:59:12,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1366089954] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 13:59:12,254 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 13:59:12,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 7] imperfect sequences [] total 16 [2024-11-05 13:59:12,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356166879] [2024-11-05 13:59:12,255 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 13:59:12,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 13:59:12,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 13:59:12,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 13:59:12,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-05 13:59:12,256 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand has 16 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-05 13:59:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 13:59:13,583 INFO L93 Difference]: Finished difference Result 170 states and 216 transitions. [2024-11-05 13:59:13,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-05 13:59:13,584 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) Word has length 42 [2024-11-05 13:59:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 13:59:13,585 INFO L225 Difference]: With dead ends: 170 [2024-11-05 13:59:13,585 INFO L226 Difference]: Without dead ends: 104 [2024-11-05 13:59:13,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2024-11-05 13:59:13,586 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 96 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-05 13:59:13,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 547 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-05 13:59:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-05 13:59:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2024-11-05 13:59:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.338235294117647) internal successors, (91), 71 states have internal predecessors, (91), 12 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-11-05 13:59:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2024-11-05 13:59:13,605 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 42 [2024-11-05 13:59:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 13:59:13,605 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2024-11-05 13:59:13,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-05 13:59:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2024-11-05 13:59:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-05 13:59:13,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:13,606 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 13:59:13,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (9)] Ended with exit code 0 [2024-11-05 13:59:13,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:13,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:13,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:13,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1720227270, now seen corresponding path program 1 times [2024-11-05 13:59:13,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:13,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [555355487] [2024-11-05 13:59:13,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:13,808 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:13,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:13,809 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:13,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (10)] Waiting until timeout for monitored process [2024-11-05 13:59:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 13:59:13,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-05 13:59:13,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 13:59:13,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2024-11-05 13:59:13,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2024-11-05 13:59:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 13:59:14,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 13:59:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 13:59:15,449 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 13:59:15,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [555355487] [2024-11-05 13:59:15,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [555355487] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 13:59:15,450 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 13:59:15,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 16] imperfect sequences [] total 25 [2024-11-05 13:59:15,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46764805] [2024-11-05 13:59:15,450 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 13:59:15,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-05 13:59:15,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 13:59:15,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-05 13:59:15,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2024-11-05 13:59:15,451 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand has 25 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 10 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-05 13:59:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 13:59:17,405 INFO L93 Difference]: Finished difference Result 205 states and 271 transitions. [2024-11-05 13:59:17,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 13:59:17,405 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 10 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 42 [2024-11-05 13:59:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 13:59:17,406 INFO L225 Difference]: With dead ends: 205 [2024-11-05 13:59:17,406 INFO L226 Difference]: Without dead ends: 125 [2024-11-05 13:59:17,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2024-11-05 13:59:17,407 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 102 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-05 13:59:17,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1038 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-05 13:59:17,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-05 13:59:17,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 97. [2024-11-05 13:59:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 77 states have internal predecessors, (100), 12 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-11-05 13:59:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2024-11-05 13:59:17,430 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 42 [2024-11-05 13:59:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 13:59:17,431 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2024-11-05 13:59:17,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 10 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-05 13:59:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2024-11-05 13:59:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-05 13:59:17,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:17,432 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 13:59:17,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (10)] Ended with exit code 0 [2024-11-05 13:59:17,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:17,633 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:17,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:17,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1697595016, now seen corresponding path program 1 times [2024-11-05 13:59:17,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:17,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1941492931] [2024-11-05 13:59:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:17,633 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:17,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:17,635 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:17,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (11)] Waiting until timeout for monitored process [2024-11-05 13:59:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 13:59:17,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-05 13:59:17,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 13:59:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 13:59:17,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 13:59:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 13:59:17,919 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 13:59:17,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1941492931] [2024-11-05 13:59:17,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1941492931] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 13:59:17,919 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 13:59:17,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2024-11-05 13:59:17,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664826259] [2024-11-05 13:59:17,919 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 13:59:17,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-05 13:59:17,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 13:59:17,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-05 13:59:17,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-05 13:59:17,920 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-05 13:59:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 13:59:18,015 INFO L93 Difference]: Finished difference Result 218 states and 293 transitions. [2024-11-05 13:59:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 13:59:18,016 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 42 [2024-11-05 13:59:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 13:59:18,017 INFO L225 Difference]: With dead ends: 218 [2024-11-05 13:59:18,017 INFO L226 Difference]: Without dead ends: 90 [2024-11-05 13:59:18,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-05 13:59:18,018 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 45 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 13:59:18,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 396 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 13:59:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-05 13:59:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-05 13:59:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 70 states have internal predecessors, (88), 12 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-11-05 13:59:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2024-11-05 13:59:18,036 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 42 [2024-11-05 13:59:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 13:59:18,036 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2024-11-05 13:59:18,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-05 13:59:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2024-11-05 13:59:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-05 13:59:18,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:18,037 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 13:59:18,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (11)] Forceful destruction successful, exit code 0 [2024-11-05 13:59:18,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:18,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:18,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:18,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2046464156, now seen corresponding path program 1 times [2024-11-05 13:59:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1235246784] [2024-11-05 13:59:18,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:18,239 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:18,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:18,240 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:18,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (12)] Waiting until timeout for monitored process [2024-11-05 13:59:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 13:59:18,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 13:59:18,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 13:59:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 13:59:18,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 13:59:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 13:59:18,435 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 13:59:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1235246784] [2024-11-05 13:59:18,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1235246784] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 13:59:18,436 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 13:59:18,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2024-11-05 13:59:18,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475146452] [2024-11-05 13:59:18,436 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 13:59:18,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 13:59:18,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 13:59:18,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 13:59:18,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-05 13:59:18,437 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-05 13:59:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 13:59:18,594 INFO L93 Difference]: Finished difference Result 178 states and 224 transitions. [2024-11-05 13:59:18,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 13:59:18,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 44 [2024-11-05 13:59:18,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 13:59:18,595 INFO L225 Difference]: With dead ends: 178 [2024-11-05 13:59:18,595 INFO L226 Difference]: Without dead ends: 94 [2024-11-05 13:59:18,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-05 13:59:18,595 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 25 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 13:59:18,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 408 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 13:59:18,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-05 13:59:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-11-05 13:59:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 70 states have internal predecessors, (86), 12 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-11-05 13:59:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2024-11-05 13:59:18,613 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 44 [2024-11-05 13:59:18,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 13:59:18,614 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2024-11-05 13:59:18,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-05 13:59:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2024-11-05 13:59:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-05 13:59:18,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 13:59:18,614 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 13:59:18,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (12)] Forceful destruction successful, exit code 0 [2024-11-05 13:59:18,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:18,815 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 13:59:18,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 13:59:18,815 INFO L85 PathProgramCache]: Analyzing trace with hash 964483973, now seen corresponding path program 1 times [2024-11-05 13:59:18,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 13:59:18,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1609185542] [2024-11-05 13:59:18,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 13:59:18,815 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-05 13:59:18,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:18,816 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-05 13:59:18,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (13)] Waiting until timeout for monitored process [2024-11-05 13:59:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 13:59:18,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 13:59:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 13:59:18,933 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-05 13:59:18,933 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-05 13:59:18,934 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 13:59:18,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (13)] Forceful destruction successful, exit code 0 [2024-11-05 13:59:19,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-05 13:59:19,139 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 13:59:19,161 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 13:59:19,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 01:59:19 BoogieIcfgContainer [2024-11-05 13:59:19,163 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 13:59:19,163 INFO L158 Benchmark]: Toolchain (without parser) took 19272.38ms. Allocated memory was 237.0MB in the beginning and 371.2MB in the end (delta: 134.2MB). Free memory was 194.1MB in the beginning and 236.8MB in the end (delta: -42.8MB). Peak memory consumption was 93.0MB. Max. memory is 8.0GB. [2024-11-05 13:59:19,163 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 237.0MB. Free memory is still 194.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 13:59:19,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1877.81ms. Allocated memory is still 237.0MB. Free memory was 193.6MB in the beginning and 101.6MB in the end (delta: 92.1MB). Peak memory consumption was 98.2MB. Max. memory is 8.0GB. [2024-11-05 13:59:19,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.27ms. Allocated memory is still 237.0MB. Free memory was 101.6MB in the beginning and 96.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2024-11-05 13:59:19,164 INFO L158 Benchmark]: Boogie Preprocessor took 83.76ms. Allocated memory is still 237.0MB. Free memory was 96.3MB in the beginning and 91.1MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2024-11-05 13:59:19,164 INFO L158 Benchmark]: RCFGBuilder took 605.24ms. Allocated memory was 237.0MB in the beginning and 309.3MB in the end (delta: 72.4MB). Free memory was 91.1MB in the beginning and 265.8MB in the end (delta: -174.7MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2024-11-05 13:59:19,164 INFO L158 Benchmark]: TraceAbstraction took 16596.03ms. Allocated memory was 309.3MB in the beginning and 371.2MB in the end (delta: 61.9MB). Free memory was 265.3MB in the beginning and 236.8MB in the end (delta: 28.5MB). Peak memory consumption was 90.4MB. Max. memory is 8.0GB. [2024-11-05 13:59:19,165 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 237.0MB. Free memory is still 194.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1877.81ms. Allocated memory is still 237.0MB. Free memory was 193.6MB in the beginning and 101.6MB in the end (delta: 92.1MB). Peak memory consumption was 98.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 100.27ms. Allocated memory is still 237.0MB. Free memory was 101.6MB in the beginning and 96.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 83.76ms. Allocated memory is still 237.0MB. Free memory was 96.3MB in the beginning and 91.1MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 605.24ms. Allocated memory was 237.0MB in the beginning and 309.3MB in the end (delta: 72.4MB). Free memory was 91.1MB in the beginning and 265.8MB in the end (delta: -174.7MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 16596.03ms. Allocated memory was 309.3MB in the beginning and 371.2MB in the end (delta: 61.9MB). Free memory was 265.3MB in the beginning and 236.8MB in the end (delta: 28.5MB). Peak memory consumption was 90.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7326] static __thread int tl_last_error = 0; VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7355] CALL aws_linked_list_init_harness() [L7344] struct aws_linked_list list; VAL [list={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7350] CALL aws_linked_list_init(&list) VAL [\old(list)={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4771] CALL assume_abort_if_not((list)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4771] RET assume_abort_if_not((list)) VAL [\old(list)={-1:0}, list={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4772] list->head.next = &list->tail [L4773-L4774] list->head.prev = ((void *)0) [L4776] list->tail.prev = &list->head [L4777-L4778] list->tail.next = ((void *)0) VAL [\old(list)={-1:0}, list={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4780] CALL, EXPR aws_linked_list_is_valid(list) VAL [\old(list)={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [\old(list)={-1:0}, list={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [\old(list)={-1:0}, list={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={-1:0}, list={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={-1:0}, list={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={-1:0}, list={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={-1:0}, list={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={-1:0}, list={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={-1:0}, list={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={-1:0}, s_can_fail_allocator_static={4:0}, temp={-1:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={-1:0}, s_can_fail_allocator_static={4:0}, temp={-1:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={-1:0}, s_can_fail_allocator_static={4:0}, temp={-1:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={-1:0}, node={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [\old(node)={-1:0}, node={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={-1:0}, node={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={-1:0}, s_can_fail_allocator_static={4:0}, temp={-1:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={-1:0}, s_can_fail_allocator_static={4:0}, temp={-1:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4780] RET, EXPR aws_linked_list_is_valid(list) VAL [\old(list)={-1:0}, list={-1:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4780] CALL __VERIFIER_assert(!((aws_linked_list_is_valid(list)))) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] COND TRUE !cond VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 443 mSDsluCounter, 5320 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4606 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1717 IncrementalHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 714 mSDtfsCounter, 1717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 805 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=9, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 76 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 437 NumberOfCodeBlocks, 437 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 768 ConstructedInterpolants, 44 QuantifiedInterpolants, 6317 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1395 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 72/72 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-05 13:59:19,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...