/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 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:18:55,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:18:55,911 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 08:18:55,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:18:55,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:18:55,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:18:55,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:18:55,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:18:55,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:18:55,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:18:55,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:18:55,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:18:55,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:18:55,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:18:55,953 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:18:55,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:18:55,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:18:55,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:18:55,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:18:55,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:18:55,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:18:55,958 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:18:55,959 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:18:55,959 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:18:55,959 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:18:55,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:18:55,960 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:18:55,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:18:55,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:18:55,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:18:55,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:18:55,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:18:55,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:18:55,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:18:55,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:18:55,962 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:18:55,962 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:18:55,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:18:55,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:18:55,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:18:55,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:18:55,964 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 -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:18:56,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:18:56,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:18:56,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:18:56,215 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:18:56,215 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:18:56,216 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_rbegin_harness.i [2024-11-05 08:18:57,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:18:58,050 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:18:58,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness.i [2024-11-05 08:18:58,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6201800d2/472b10a957b24630a706d239227f9acd/FLAGee6f29c83 [2024-11-05 08:18:58,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6201800d2/472b10a957b24630a706d239227f9acd [2024-11-05 08:18:58,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:18:58,098 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:18:58,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:18:58,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:18:58,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:18:58,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:18:58" (1/1) ... [2024-11-05 08:18:58,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8414ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58, skipping insertion in model container [2024-11-05 08:18:58,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:18:58" (1/1) ... [2024-11-05 08:18:58,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:18:58,455 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_rbegin_harness.i[4496,4509] [2024-11-05 08:18:58,463 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_rbegin_harness.i[4556,4569] [2024-11-05 08:18:59,015 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 08:18:59,114 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 08:18:59,114 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 08:18:59,115 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 08:18:59,132 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 08:18:59,137 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,137 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,138 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,138 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 08:18:59,139 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,140 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,142 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,142 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,144 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 08:18:59,145 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 08:18:59,154 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,154 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 08:18:59,155 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,155 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,158 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,158 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 08:18:59,159 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,159 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 08:18:59,160 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,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 08:18:59,162 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,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 08:18:59,162 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,163 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,486 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 08:18:59,487 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 08:18:59,488 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 08:18:59,491 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 08:18:59,601 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 08:18:59,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:18:59,638 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-05 08:18:59,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:18:59,688 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_rbegin_harness.i[4496,4509] [2024-11-05 08:18:59,688 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_rbegin_harness.i[4556,4569] [2024-11-05 08:18:59,716 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 08:18:59,728 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 08:18:59,728 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 08:18:59,730 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 08:18:59,740 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 08:18:59,741 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,741 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,741 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,742 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 08:18:59,742 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,743 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,744 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 08:18:59,744 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 08:18:59,746 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 08:18:59,746 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 08:18:59,750 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,751 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,751 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,751 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,752 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,753 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 08:18:59,753 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,753 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 08:18:59,754 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,754 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 08:18:59,755 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,755 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 08:18:59,755 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,756 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,826 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 08:18:59,826 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 08:18:59,826 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 08:18:59,827 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 08:18:59,850 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 08:18:59,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:18:59,861 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:18:59,876 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_rbegin_harness.i[4496,4509] [2024-11-05 08:18:59,876 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_rbegin_harness.i[4556,4569] [2024-11-05 08:18:59,909 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,909 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,909 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,910 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,910 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,915 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,916 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,916 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,917 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,917 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,918 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,918 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,918 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:19:00,136 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-05 08:19:00,144 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:19:00,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:00 WrapperNode [2024-11-05 08:19:00,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:19:00,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:19:00,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:19:00,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:19:00,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:00" (1/1) ... [2024-11-05 08:19:00,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:00" (1/1) ... [2024-11-05 08:19:00,256 INFO L138 Inliner]: procedures = 687, calls = 1039, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 144 [2024-11-05 08:19:00,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:19:00,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:19:00,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:19:00,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:19:00,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:00" (1/1) ... [2024-11-05 08:19:00,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:00" (1/1) ... [2024-11-05 08:19:00,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:00" (1/1) ... [2024-11-05 08:19:00,307 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2024-11-05 08:19:00,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:00" (1/1) ... [2024-11-05 08:19:00,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:00" (1/1) ... [2024-11-05 08:19:00,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:00" (1/1) ... [2024-11-05 08:19:00,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:00" (1/1) ... [2024-11-05 08:19:00,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:00" (1/1) ... [2024-11-05 08:19:00,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:00" (1/1) ... [2024-11-05 08:19:00,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:19:00,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:19:00,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:19:00,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:19:00,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:00" (1/1) ... [2024-11-05 08:19:00,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:19:00,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:19:00,388 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 08:19:00,391 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 08:19:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 08:19:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:19:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 08:19:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 08:19:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 08:19:00,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 08:19:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:19:00,420 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:19:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-05 08:19:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-05 08:19:00,420 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-05 08:19:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:19:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-05 08:19:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-05 08:19:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-05 08:19:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:19:00,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:19:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:19:00,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:19:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 08:19:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-05 08:19:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-05 08:19:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-05 08:19:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-05 08:19:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-05 08:19:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-05 08:19:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-05 08:19:00,422 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-05 08:19:00,694 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:19:00,696 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:19:01,004 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-05 08:19:01,004 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:19:01,019 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:19:01,019 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-05 08:19:01,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:19:01 BoogieIcfgContainer [2024-11-05 08:19:01,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:19:01,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:19:01,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:19:01,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:19:01,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:18:58" (1/3) ... [2024-11-05 08:19:01,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255cce81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:19:01, skipping insertion in model container [2024-11-05 08:19:01,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:00" (2/3) ... [2024-11-05 08:19:01,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255cce81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:19:01, skipping insertion in model container [2024-11-05 08:19:01,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:19:01" (3/3) ... [2024-11-05 08:19:01,034 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness.i [2024-11-05 08:19:01,045 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:19:01,046 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:19:01,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:19:01,102 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;@65cc6292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:19:01,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:19:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-05 08:19:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-05 08:19:01,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:01,116 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:01,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:01,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1062572114, now seen corresponding path program 1 times [2024-11-05 08:19:01,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:01,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1166760759] [2024-11-05 08:19:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:01,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:01,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:01,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:01,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 08:19:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:01,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 08:19:01,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-05 08:19:01,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-05 08:19:01,485 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:01,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1166760759] [2024-11-05 08:19:01,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1166760759] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:01,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:01,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 08:19:01,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882648128] [2024-11-05 08:19:01,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:01,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 08:19:01,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:01,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 08:19:01,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:19:01,518 INFO L87 Difference]: Start difference. First operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:01,544 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2024-11-05 08:19:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 08:19:01,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-05 08:19:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:01,554 INFO L225 Difference]: With dead ends: 130 [2024-11-05 08:19:01,554 INFO L226 Difference]: Without dead ends: 64 [2024-11-05 08:19:01,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:19:01,560 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:01,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:01,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-05 08:19:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-05 08:19:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-05 08:19:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2024-11-05 08:19:01,594 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 68 [2024-11-05 08:19:01,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:01,596 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2024-11-05 08:19:01,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-11-05 08:19:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-05 08:19:01,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:01,600 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:01,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-05 08:19:01,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:01,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:01,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:01,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1946087212, now seen corresponding path program 1 times [2024-11-05 08:19:01,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:01,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [837532480] [2024-11-05 08:19:01,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:01,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:01,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:01,808 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:01,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 08:19:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:02,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 08:19:02,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 08:19:02,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-05 08:19:02,226 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:02,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [837532480] [2024-11-05 08:19:02,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [837532480] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:02,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:02,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-05 08:19:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566715655] [2024-11-05 08:19:02,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:02,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:19:02,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:02,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:19:02,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:19:02,229 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-05 08:19:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:02,289 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2024-11-05 08:19:02,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:19:02,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-05 08:19:02,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:02,292 INFO L225 Difference]: With dead ends: 116 [2024-11-05 08:19:02,292 INFO L226 Difference]: Without dead ends: 66 [2024-11-05 08:19:02,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:19:02,294 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:02,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-05 08:19:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-05 08:19:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-11-05 08:19:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2024-11-05 08:19:02,308 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 68 [2024-11-05 08:19:02,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:02,308 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2024-11-05 08:19:02,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-05 08:19:02,309 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-11-05 08:19:02,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-05 08:19:02,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:02,310 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:02,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 08:19:02,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:02,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:02,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:02,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1195332088, now seen corresponding path program 1 times [2024-11-05 08:19:02,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:02,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2075603284] [2024-11-05 08:19:02,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:02,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:02,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:02,514 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:02,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 08:19:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:02,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 08:19:02,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 08:19:02,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-05 08:19:02,927 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:02,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2075603284] [2024-11-05 08:19:02,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2075603284] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:02,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:02,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-11-05 08:19:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956787179] [2024-11-05 08:19:02,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:02,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:19:02,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:02,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:19:02,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:19:02,929 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:03,081 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2024-11-05 08:19:03,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:19:03,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-05 08:19:03,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:03,083 INFO L225 Difference]: With dead ends: 123 [2024-11-05 08:19:03,083 INFO L226 Difference]: Without dead ends: 71 [2024-11-05 08:19:03,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:19:03,085 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 21 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:03,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 300 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:19:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-05 08:19:03,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-05 08:19:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 51 states have internal predecessors, (61), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-05 08:19:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-05 08:19:03,107 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 70 [2024-11-05 08:19:03,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:03,107 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-05 08:19:03,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-05 08:19:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-05 08:19:03,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:03,112 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:03,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 08:19:03,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:03,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:03,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:03,313 INFO L85 PathProgramCache]: Analyzing trace with hash -316025515, now seen corresponding path program 1 times [2024-11-05 08:19:03,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:03,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2071102153] [2024-11-05 08:19:03,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:03,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:03,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:03,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:03,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 08:19:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:03,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:19:03,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 08:19:03,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-05 08:19:03,765 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:03,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2071102153] [2024-11-05 08:19:03,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2071102153] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:03,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:03,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-11-05 08:19:03,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431791957] [2024-11-05 08:19:03,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:03,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:19:03,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:03,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:19:03,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:19:03,768 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:03,950 INFO L93 Difference]: Finished difference Result 135 states and 183 transitions. [2024-11-05 08:19:03,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:19:03,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-05 08:19:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:03,952 INFO L225 Difference]: With dead ends: 135 [2024-11-05 08:19:03,952 INFO L226 Difference]: Without dead ends: 80 [2024-11-05 08:19:03,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-05 08:19:03,954 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 30 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:03,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 354 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:19:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-05 08:19:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2024-11-05 08:19:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-05 08:19:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-05 08:19:03,965 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 72 [2024-11-05 08:19:03,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:03,965 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-05 08:19:03,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-05 08:19:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-05 08:19:03,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:03,967 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:03,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-05 08:19:04,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:04,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:04,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:04,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1928092350, now seen corresponding path program 1 times [2024-11-05 08:19:04,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:04,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [811248209] [2024-11-05 08:19:04,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:04,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:04,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:04,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:04,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-05 08:19:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:04,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:19:04,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 08:19:04,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-05 08:19:04,493 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:04,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [811248209] [2024-11-05 08:19:04,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [811248209] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:04,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:04,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 7 [2024-11-05 08:19:04,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112312717] [2024-11-05 08:19:04,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:04,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:19:04,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:04,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:19:04,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:19:04,495 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:04,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:04,604 INFO L93 Difference]: Finished difference Result 135 states and 185 transitions. [2024-11-05 08:19:04,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:19:04,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2024-11-05 08:19:04,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:04,606 INFO L225 Difference]: With dead ends: 135 [2024-11-05 08:19:04,607 INFO L226 Difference]: Without dead ends: 78 [2024-11-05 08:19:04,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:19:04,608 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:04,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 230 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:19:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-05 08:19:04,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-11-05 08:19:04,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-05 08:19:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2024-11-05 08:19:04,620 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 73 [2024-11-05 08:19:04,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:04,620 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2024-11-05 08:19:04,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2024-11-05 08:19:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-05 08:19:04,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:04,622 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:04,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-05 08:19:04,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:04,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:04,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash 137287748, now seen corresponding path program 1 times [2024-11-05 08:19:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:04,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1780974336] [2024-11-05 08:19:04,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:04,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:04,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:04,826 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:04,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-05 08:19:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:05,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 08:19:05,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 08:19:05,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-05 08:19:05,172 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:05,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1780974336] [2024-11-05 08:19:05,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1780974336] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:05,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:05,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-05 08:19:05,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125117927] [2024-11-05 08:19:05,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:05,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:19:05,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:05,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:19:05,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:19:05,174 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-05 08:19:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:05,230 INFO L93 Difference]: Finished difference Result 136 states and 183 transitions. [2024-11-05 08:19:05,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:19:05,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2024-11-05 08:19:05,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:05,235 INFO L225 Difference]: With dead ends: 136 [2024-11-05 08:19:05,235 INFO L226 Difference]: Without dead ends: 78 [2024-11-05 08:19:05,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:19:05,236 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:05,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:05,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-05 08:19:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2024-11-05 08:19:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-05 08:19:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2024-11-05 08:19:05,255 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 81 [2024-11-05 08:19:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:05,255 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2024-11-05 08:19:05,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-05 08:19:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2024-11-05 08:19:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-05 08:19:05,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:05,257 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:05,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-05 08:19:05,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:05,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:05,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash 431382673, now seen corresponding path program 1 times [2024-11-05 08:19:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:05,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1891502730] [2024-11-05 08:19:05,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:05,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:05,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:05,459 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:05,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-05 08:19:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:05,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 08:19:05,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:09,872 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|))))) is different from true [2024-11-05 08:19:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 08:19:10,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-05 08:19:10,336 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:10,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1891502730] [2024-11-05 08:19:10,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1891502730] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:19:10,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:19:10,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-05 08:19:10,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844647134] [2024-11-05 08:19:10,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:19:10,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 08:19:10,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:10,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 08:19:10,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-05 08:19:10,338 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-05 08:19:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:11,291 INFO L93 Difference]: Finished difference Result 173 states and 247 transitions. [2024-11-05 08:19:11,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-05 08:19:11,292 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 83 [2024-11-05 08:19:11,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:11,294 INFO L225 Difference]: With dead ends: 173 [2024-11-05 08:19:11,294 INFO L226 Difference]: Without dead ends: 114 [2024-11-05 08:19:11,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2024-11-05 08:19:11,295 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 31 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:11,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 588 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 329 Invalid, 0 Unknown, 225 Unchecked, 0.8s Time] [2024-11-05 08:19:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-05 08:19:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2024-11-05 08:19:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 70 states have internal predecessors, (87), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-05 08:19:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2024-11-05 08:19:11,314 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 120 transitions. Word has length 83 [2024-11-05 08:19:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:11,314 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 120 transitions. [2024-11-05 08:19:11,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-05 08:19:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2024-11-05 08:19:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-05 08:19:11,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:11,316 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:11,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-05 08:19:11,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:11,517 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:11,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:11,517 INFO L85 PathProgramCache]: Analyzing trace with hash 13986067, now seen corresponding path program 1 times [2024-11-05 08:19:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1971815964] [2024-11-05 08:19:11,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:11,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:11,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:11,520 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:11,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-05 08:19:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:11,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 08:19:11,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-05 08:19:11,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-05 08:19:11,795 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:11,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1971815964] [2024-11-05 08:19:11,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1971815964] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:11,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:11,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-05 08:19:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076539672] [2024-11-05 08:19:11,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:11,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:19:11,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:11,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:19:11,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:19:11,797 INFO L87 Difference]: Start difference. First operand 90 states and 120 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 08:19:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:11,829 INFO L93 Difference]: Finished difference Result 167 states and 233 transitions. [2024-11-05 08:19:11,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:19:11,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2024-11-05 08:19:11,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:11,831 INFO L225 Difference]: With dead ends: 167 [2024-11-05 08:19:11,831 INFO L226 Difference]: Without dead ends: 91 [2024-11-05 08:19:11,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:19:11,832 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:11,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:11,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-05 08:19:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-05 08:19:11,845 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), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-05 08:19:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2024-11-05 08:19:11,847 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 83 [2024-11-05 08:19:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:11,847 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2024-11-05 08:19:11,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 08:19:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2024-11-05 08:19:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-05 08:19:11,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:11,848 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:11,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-05 08:19:12,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:12,049 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:12,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1975560725, now seen corresponding path program 1 times [2024-11-05 08:19:12,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:12,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2076175743] [2024-11-05 08:19:12,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:12,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:12,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:12,052 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:12,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-05 08:19:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:12,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:19:12,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-05 08:19:12,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-05 08:19:12,318 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:12,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2076175743] [2024-11-05 08:19:12,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2076175743] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:12,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:12,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-05 08:19:12,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174660941] [2024-11-05 08:19:12,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:12,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 08:19:12,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:12,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 08:19:12,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:19:12,321 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 08:19:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:12,370 INFO L93 Difference]: Finished difference Result 166 states and 231 transitions. [2024-11-05 08:19:12,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:19:12,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2024-11-05 08:19:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:12,374 INFO L225 Difference]: With dead ends: 166 [2024-11-05 08:19:12,374 INFO L226 Difference]: Without dead ends: 90 [2024-11-05 08:19:12,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:19:12,375 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:12,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-05 08:19:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-05 08:19:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.25) internal successors, (80), 67 states have internal predecessors, (80), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-05 08:19:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2024-11-05 08:19:12,396 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 83 [2024-11-05 08:19:12,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:12,396 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2024-11-05 08:19:12,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 08:19:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2024-11-05 08:19:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:19:12,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:12,398 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:12,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-05 08:19:12,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:12,598 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:12,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:12,599 INFO L85 PathProgramCache]: Analyzing trace with hash -233275002, now seen corresponding path program 1 times [2024-11-05 08:19:12,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:12,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863002757] [2024-11-05 08:19:12,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:12,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:12,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:12,602 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:12,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-05 08:19:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:12,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-05 08:19:12,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 08:19:13,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:15,706 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-05 08:19:15,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-05 08:19:15,724 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-05 08:19:15,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2024-11-05 08:19:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-05 08:19:15,774 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:15,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863002757] [2024-11-05 08:19:15,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1863002757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:19:15,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:19:15,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2024-11-05 08:19:15,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869311121] [2024-11-05 08:19:15,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:19:15,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-05 08:19:15,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:15,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-05 08:19:15,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:19:15,776 INFO L87 Difference]: Start difference. First operand 87 states and 113 transitions. Second operand has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 8 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-05 08:19:20,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:24,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:28,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:32,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:36,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:39,077 INFO L93 Difference]: Finished difference Result 217 states and 277 transitions. [2024-11-05 08:19:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 08:19:39,078 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 8 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) Word has length 84 [2024-11-05 08:19:39,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:39,079 INFO L225 Difference]: With dead ends: 217 [2024-11-05 08:19:39,079 INFO L226 Difference]: Without dead ends: 132 [2024-11-05 08:19:39,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2024-11-05 08:19:39,080 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 116 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 51 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:39,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 683 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 376 Invalid, 5 Unknown, 0 Unchecked, 22.6s Time] [2024-11-05 08:19:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-05 08:19:39,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2024-11-05 08:19:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 99 states have internal predecessors, (119), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2024-11-05 08:19:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2024-11-05 08:19:39,097 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 154 transitions. Word has length 84 [2024-11-05 08:19:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:39,098 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 154 transitions. [2024-11-05 08:19:39,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 8 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-05 08:19:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2024-11-05 08:19:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:19:39,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:39,099 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:39,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-05 08:19:39,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:39,299 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:39,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:39,300 INFO L85 PathProgramCache]: Analyzing trace with hash -980582014, now seen corresponding path program 1 times [2024-11-05 08:19:39,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:39,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1334276009] [2024-11-05 08:19:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:39,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:39,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:39,302 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:39,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-05 08:19:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:39,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-05 08:19:39,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:39,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-05 08:19:39,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:19:39,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-11-05 08:19:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-05 08:19:41,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:42,381 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-05 08:19:42,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 103 [2024-11-05 08:19:42,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:19:42,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 97 [2024-11-05 08:19:42,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2024-11-05 08:19:42,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-05 08:19:42,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-05 08:19:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-05 08:19:42,896 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:42,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1334276009] [2024-11-05 08:19:42,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1334276009] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:42,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:42,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-11-05 08:19:42,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832558045] [2024-11-05 08:19:42,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:42,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-05 08:19:42,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:42,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-05 08:19:42,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:19:42,898 INFO L87 Difference]: Start difference. First operand 125 states and 154 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-05 08:19:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:45,372 INFO L93 Difference]: Finished difference Result 308 states and 387 transitions. [2024-11-05 08:19:45,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 08:19:45,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 84 [2024-11-05 08:19:45,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:45,375 INFO L225 Difference]: With dead ends: 308 [2024-11-05 08:19:45,375 INFO L226 Difference]: Without dead ends: 238 [2024-11-05 08:19:45,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-11-05 08:19:45,377 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 34 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:45,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 509 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-05 08:19:45,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-05 08:19:45,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-05 08:19:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 183 states have (on average 1.2349726775956285) internal successors, (226), 187 states have internal predecessors, (226), 30 states have call successors, (30), 18 states have call predecessors, (30), 20 states have return successors, (36), 28 states have call predecessors, (36), 28 states have call successors, (36) [2024-11-05 08:19:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 292 transitions. [2024-11-05 08:19:45,411 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 292 transitions. Word has length 84 [2024-11-05 08:19:45,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:45,412 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 292 transitions. [2024-11-05 08:19:45,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-05 08:19:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 292 transitions. [2024-11-05 08:19:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:19:45,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:45,413 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:45,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-05 08:19:45,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:45,618 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:45,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:45,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1883082114, now seen corresponding path program 1 times [2024-11-05 08:19:45,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:45,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [724858262] [2024-11-05 08:19:45,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:45,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:45,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:45,620 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:45,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-05 08:19:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:45,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-05 08:19:45,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 08:19:47,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:50,619 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-05 08:19:50,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-05 08:19:50,648 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-05 08:19:50,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2024-11-05 08:19:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-05 08:19:50,677 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:50,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [724858262] [2024-11-05 08:19:50,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [724858262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:19:50,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:19:50,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2024-11-05 08:19:50,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209558757] [2024-11-05 08:19:50,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:19:50,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-05 08:19:50,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:50,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-05 08:19:50,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-11-05 08:19:50,679 INFO L87 Difference]: Start difference. First operand 234 states and 292 transitions. Second operand has 23 states, 21 states have (on average 4.857142857142857) internal successors, (102), 21 states have internal predecessors, (102), 8 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-05 08:19:54,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:58,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:20:03,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:20:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:07,651 INFO L93 Difference]: Finished difference Result 370 states and 472 transitions. [2024-11-05 08:20:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 08:20:07,653 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.857142857142857) internal successors, (102), 21 states have internal predecessors, (102), 8 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) Word has length 84 [2024-11-05 08:20:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:07,654 INFO L225 Difference]: With dead ends: 370 [2024-11-05 08:20:07,654 INFO L226 Difference]: Without dead ends: 238 [2024-11-05 08:20:07,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2024-11-05 08:20:07,656 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 100 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 50 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:07,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 967 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 671 Invalid, 3 Unknown, 0 Unchecked, 16.0s Time] [2024-11-05 08:20:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-05 08:20:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-05 08:20:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 183 states have (on average 1.2240437158469946) internal successors, (224), 187 states have internal predecessors, (224), 30 states have call successors, (30), 18 states have call predecessors, (30), 20 states have return successors, (36), 28 states have call predecessors, (36), 28 states have call successors, (36) [2024-11-05 08:20:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2024-11-05 08:20:07,689 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 84 [2024-11-05 08:20:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:07,690 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2024-11-05 08:20:07,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.857142857142857) internal successors, (102), 21 states have internal predecessors, (102), 8 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-05 08:20:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2024-11-05 08:20:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:20:07,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:07,691 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:20:07,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-05 08:20:07,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:07,896 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:07,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:07,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1602284422, now seen corresponding path program 1 times [2024-11-05 08:20:07,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:07,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [86240705] [2024-11-05 08:20:07,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:07,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:07,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:07,899 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:20:07,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-05 08:20:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:08,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-05 08:20:08,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 36 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:20:10,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:11,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:20:11,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-11-05 08:20:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 08:20:12,620 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:12,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [86240705] [2024-11-05 08:20:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [86240705] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:20:12,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:20:12,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2024-11-05 08:20:12,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594973667] [2024-11-05 08:20:12,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:20:12,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-05 08:20:12,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:12,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-05 08:20:12,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-11-05 08:20:12,622 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand has 27 states, 25 states have (on average 4.48) internal successors, (112), 25 states have internal predecessors, (112), 9 states have call successors, (17), 3 states have call predecessors, (17), 7 states have return successors, (16), 7 states have call predecessors, (16), 9 states have call successors, (16) [2024-11-05 08:20:19,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:19,026 INFO L93 Difference]: Finished difference Result 606 states and 772 transitions. [2024-11-05 08:20:19,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-05 08:20:19,026 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 4.48) internal successors, (112), 25 states have internal predecessors, (112), 9 states have call successors, (17), 3 states have call predecessors, (17), 7 states have return successors, (16), 7 states have call predecessors, (16), 9 states have call successors, (16) Word has length 84 [2024-11-05 08:20:19,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:19,029 INFO L225 Difference]: With dead ends: 606 [2024-11-05 08:20:19,029 INFO L226 Difference]: Without dead ends: 460 [2024-11-05 08:20:19,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=235, Invalid=1405, Unknown=0, NotChecked=0, Total=1640 [2024-11-05 08:20:19,031 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 222 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:19,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1148 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-05 08:20:19,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-05 08:20:19,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 394. [2024-11-05 08:20:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 305 states have (on average 1.2295081967213115) internal successors, (375), 315 states have internal predecessors, (375), 52 states have call successors, (52), 28 states have call predecessors, (52), 36 states have return successors, (70), 50 states have call predecessors, (70), 48 states have call successors, (70) [2024-11-05 08:20:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 497 transitions. [2024-11-05 08:20:19,110 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 497 transitions. Word has length 84 [2024-11-05 08:20:19,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:19,110 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 497 transitions. [2024-11-05 08:20:19,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 4.48) internal successors, (112), 25 states have internal predecessors, (112), 9 states have call successors, (17), 3 states have call predecessors, (17), 7 states have return successors, (16), 7 states have call predecessors, (16), 9 states have call successors, (16) [2024-11-05 08:20:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 497 transitions. [2024-11-05 08:20:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:20:19,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:19,113 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:20:19,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-05 08:20:19,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:19,317 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:19,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:19,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1956325238, now seen corresponding path program 1 times [2024-11-05 08:20:19,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:19,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [13511442] [2024-11-05 08:20:19,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:19,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:19,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:19,319 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:20:19,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-05 08:20:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:19,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:20:19,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-05 08:20:19,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-05 08:20:19,787 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:19,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [13511442] [2024-11-05 08:20:19,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [13511442] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:19,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:19,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2024-11-05 08:20:19,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421485062] [2024-11-05 08:20:19,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:19,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:20:19,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:19,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:20:19,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 08:20:19,788 INFO L87 Difference]: Start difference. First operand 394 states and 497 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 08:20:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:19,979 INFO L93 Difference]: Finished difference Result 847 states and 1099 transitions. [2024-11-05 08:20:19,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:20:19,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 84 [2024-11-05 08:20:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:19,983 INFO L225 Difference]: With dead ends: 847 [2024-11-05 08:20:19,983 INFO L226 Difference]: Without dead ends: 381 [2024-11-05 08:20:19,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:20:19,986 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:19,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 318 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:20:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-05 08:20:20,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-11-05 08:20:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 292 states have (on average 1.2123287671232876) internal successors, (354), 302 states have internal predecessors, (354), 52 states have call successors, (52), 28 states have call predecessors, (52), 36 states have return successors, (70), 50 states have call predecessors, (70), 48 states have call successors, (70) [2024-11-05 08:20:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 476 transitions. [2024-11-05 08:20:20,043 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 476 transitions. Word has length 84 [2024-11-05 08:20:20,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:20,044 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 476 transitions. [2024-11-05 08:20:20,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 08:20:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2024-11-05 08:20:20,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-05 08:20:20,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:20,045 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:20:20,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-05 08:20:20,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:20,246 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:20,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash 428580672, now seen corresponding path program 1 times [2024-11-05 08:20:20,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:20,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1279384820] [2024-11-05 08:20:20,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:20,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:20,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:20,248 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:20:20,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-05 08:20:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:20,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-05 08:20:20,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:20,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-05 08:20:20,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-05 08:20:20,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-05 08:20:20,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:20:20,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-11-05 08:20:22,574 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (let ((.cse0 (select .cse1 (_ bv24 64)))) (or (and (not (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|)) (= .cse0 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|)) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) (_ bv24 64) .cse0) .cse1)) (not (= (_ bv0 64) .cse0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (_ BitVec 64))) (and (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|) (_ bv24 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (let ((.cse2 (select .cse3 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|) (_ bv24 64) .cse2) .cse3)) (not (= (_ bv0 64) .cse2))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))) (let ((.cse4 (select .cse5 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse4)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64) .cse4) .cse5)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) is different from true [2024-11-05 08:20:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 08:20:25,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:27,466 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-05 08:20:27,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 185 [2024-11-05 08:20:27,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2024-11-05 08:20:27,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:20:27,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 93 [2024-11-05 08:20:27,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-05 08:20:27,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-05 08:20:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-05 08:20:28,350 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:28,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1279384820] [2024-11-05 08:20:28,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1279384820] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:28,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:28,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [10] total 23 [2024-11-05 08:20:28,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638336809] [2024-11-05 08:20:28,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:28,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-05 08:20:28,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:28,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-05 08:20:28,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=360, Unknown=24, NotChecked=40, Total=506 [2024-11-05 08:20:28,352 INFO L87 Difference]: Start difference. First operand 381 states and 476 transitions. Second operand has 15 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 6 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8)