/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_begin_harness_negated.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:16:38,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:16:38,725 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:16:38,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:16:38,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:16:38,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:16:38,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:16:38,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:16:38,768 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:16:38,769 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:16:38,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:16:38,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:16:38,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:16:38,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:16:38,773 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:16:38,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:16:38,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:16:38,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:16:38,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:16:38,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:16:38,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:16:38,779 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:16:38,780 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:16:38,780 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:16:38,780 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:16:38,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:16:38,780 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:16:38,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:16:38,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:16:38,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:16:38,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:16:38,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:16:38,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:16:38,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:16:38,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:16:38,782 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:16:38,783 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:16:38,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:16:38,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:16:38,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:16:38,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:16:38,786 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:16:39,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:16:39,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:16:39,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:16:39,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:16:39,119 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:16:39,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness_negated.i [2024-11-05 08:16:40,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:16:41,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:16:41,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness_negated.i [2024-11-05 08:16:41,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17666af0c/93f21f2934be43b5ae1a3b430b04bd87/FLAG180ee4212 [2024-11-05 08:16:41,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17666af0c/93f21f2934be43b5ae1a3b430b04bd87 [2024-11-05 08:16:41,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:16:41,359 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:16:41,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:16:41,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:16:41,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:16:41,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:16:41" (1/1) ... [2024-11-05 08:16:41,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a97d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:41, skipping insertion in model container [2024-11-05 08:16:41,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:16:41" (1/1) ... [2024-11-05 08:16:41,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:16:41,782 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness_negated.i[4495,4508] [2024-11-05 08:16:41,790 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness_negated.i[4555,4568] [2024-11-05 08:16:42,388 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:16:42,485 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:16:42,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:16:42,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:16:42,500 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:16:42,501 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:42,502 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:42,502 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:42,503 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:16:42,503 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:42,504 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:42,506 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:16:42,506 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:16:42,509 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:16:42,509 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:16:42,522 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:42,522 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:16:42,523 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:42,523 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:16:42,525 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:42,526 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:16:42,526 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:42,526 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:16:42,528 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:42,529 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:16:42,529 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:42,529 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:16:42,530 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:42,530 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:42,806 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:16:42,806 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:16:42,807 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:16:42,807 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:16:42,901 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:16:42,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:16:42,939 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-05 08:16:42,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:16:42,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness_negated.i[4495,4508] [2024-11-05 08:16:42,972 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness_negated.i[4555,4568] [2024-11-05 08:16:42,999 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:16:43,016 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:16:43,017 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:16:43,017 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:16:43,024 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:16:43,030 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,030 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,031 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,031 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:16:43,031 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,032 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,037 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:16:43,037 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:16:43,038 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:16:43,039 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:16:43,047 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,048 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:16:43,048 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,048 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:16:43,049 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,050 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:16:43,050 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,051 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:16:43,052 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,053 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:16:43,053 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,054 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:16:43,054 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,054 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,113 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:16:43,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:16:43,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:16:43,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:16:43,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:16:43,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:16:43,187 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:16:43,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness_negated.i[4495,4508] [2024-11-05 08:16:43,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness_negated.i[4555,4568] [2024-11-05 08:16:43,268 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,269 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,269 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,269 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,270 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,282 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,283 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,286 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,286 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,287 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,287 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,288 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,288 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:43,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:16:43,540 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-05 08:16:43,550 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:16:43,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:43 WrapperNode [2024-11-05 08:16:43,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:16:43,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:16:43,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:16:43,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:16:43,559 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:16:43" (1/1) ... [2024-11-05 08:16:43,633 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:16:43" (1/1) ... [2024-11-05 08:16:43,680 INFO L138 Inliner]: procedures = 687, calls = 1039, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 144 [2024-11-05 08:16:43,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:16:43,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:16:43,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:16:43,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:16:43,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:43" (1/1) ... [2024-11-05 08:16:43,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:43" (1/1) ... [2024-11-05 08:16:43,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:43" (1/1) ... [2024-11-05 08:16:43,725 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:16:43,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:43" (1/1) ... [2024-11-05 08:16:43,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:43" (1/1) ... [2024-11-05 08:16:43,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:43" (1/1) ... [2024-11-05 08:16:43,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:43" (1/1) ... [2024-11-05 08:16:43,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:43" (1/1) ... [2024-11-05 08:16:43,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:43" (1/1) ... [2024-11-05 08:16:43,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:16:43,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:16:43,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:16:43,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:16:43,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:43" (1/1) ... [2024-11-05 08:16:43,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:16:43,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:16:43,817 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:16:43,820 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:16:43,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 08:16:43,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:16:43,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 08:16:43,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 08:16:43,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 08:16:43,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 08:16:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:16:43,852 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:16:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-05 08:16:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-05 08:16:43,852 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-05 08:16:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:16:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-05 08:16:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-05 08:16:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-05 08:16:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:16:43,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:16:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:16:43,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:16:43,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 08:16:43,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-05 08:16:43,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-05 08:16:43,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-05 08:16:43,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-05 08:16:43,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-05 08:16:43,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-05 08:16:43,853 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-05 08:16:43,853 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-05 08:16:44,194 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:16:44,196 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:16:44,513 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-05 08:16:44,513 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:16:44,525 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:16:44,526 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-05 08:16:44,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:16:44 BoogieIcfgContainer [2024-11-05 08:16:44,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:16:44,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:16:44,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:16:44,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:16:44,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:16:41" (1/3) ... [2024-11-05 08:16:44,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2084f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:16:44, skipping insertion in model container [2024-11-05 08:16:44,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:43" (2/3) ... [2024-11-05 08:16:44,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2084f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:16:44, skipping insertion in model container [2024-11-05 08:16:44,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:16:44" (3/3) ... [2024-11-05 08:16:44,534 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_begin_harness_negated.i [2024-11-05 08:16:44,549 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:16:44,550 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:16:44,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:16:44,606 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;@2632982d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:16:44,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:16:44,610 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:16:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-05 08:16:44,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:16:44,620 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:16:44,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:16:44,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:16:44,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1062572114, now seen corresponding path program 1 times [2024-11-05 08:16:44,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:16:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1943417866] [2024-11-05 08:16:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:16:44,637 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:16:44,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:16:44,642 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:16:44,644 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:16:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:16:44,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 08:16:44,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:16:44,948 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:16:44,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:16:45,004 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:16:45,005 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:16:45,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1943417866] [2024-11-05 08:16:45,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1943417866] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:16:45,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:16:45,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 08:16:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117207059] [2024-11-05 08:16:45,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:16:45,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 08:16:45,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:16:45,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 08:16:45,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:16:45,034 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:16:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:16:45,058 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2024-11-05 08:16:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 08:16:45,060 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:16:45,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:16:45,066 INFO L225 Difference]: With dead ends: 130 [2024-11-05 08:16:45,066 INFO L226 Difference]: Without dead ends: 64 [2024-11-05 08:16:45,070 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:16:45,074 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:16:45,075 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:16:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-05 08:16:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-05 08:16:45,112 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:16:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2024-11-05 08:16:45,118 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 68 [2024-11-05 08:16:45,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:16:45,118 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2024-11-05 08:16:45,118 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:16:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-11-05 08:16:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-05 08:16:45,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:16:45,124 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:16:45,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 08:16:45,328 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:16:45,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:16:45,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:16:45,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1946087212, now seen corresponding path program 1 times [2024-11-05 08:16:45,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:16:45,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1586371903] [2024-11-05 08:16:45,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:16:45,331 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:16:45,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:16:45,334 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:16:45,335 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:16:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:16:45,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 08:16:45,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:16:45,640 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:16:45,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:16:45,762 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:16:45,762 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:16:45,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1586371903] [2024-11-05 08:16:45,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1586371903] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:16:45,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:16:45,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-05 08:16:45,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247059240] [2024-11-05 08:16:45,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:16:45,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:16:45,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:16:45,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:16:45,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:16:45,767 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:16:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:16:45,849 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2024-11-05 08:16:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:16:45,852 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:16:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:16:45,855 INFO L225 Difference]: With dead ends: 116 [2024-11-05 08:16:45,857 INFO L226 Difference]: Without dead ends: 66 [2024-11-05 08:16:45,858 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:16:45,858 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:16:45,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:16:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-05 08:16:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-05 08:16:45,878 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:16:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2024-11-05 08:16:45,880 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 68 [2024-11-05 08:16:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:16:45,880 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2024-11-05 08:16:45,880 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:16:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-11-05 08:16:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-05 08:16:45,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:16:45,886 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:16:45,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-05 08:16:46,086 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:16:46,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:16:46,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:16:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1195332088, now seen corresponding path program 1 times [2024-11-05 08:16:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:16:46,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1801095483] [2024-11-05 08:16:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:16:46,088 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:16:46,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:16:46,090 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:16:46,091 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:16:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:16:46,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 08:16:46,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:16:46,397 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:16:46,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:16:46,566 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:16:46,567 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:16:46,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1801095483] [2024-11-05 08:16:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1801095483] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:16:46,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:16:46,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-11-05 08:16:46,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361144491] [2024-11-05 08:16:46,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:16:46,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:16:46,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:16:46,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:16:46,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:16:46,569 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:16:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:16:46,723 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2024-11-05 08:16:46,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:16:46,723 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:16:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:16:46,725 INFO L225 Difference]: With dead ends: 123 [2024-11-05 08:16:46,725 INFO L226 Difference]: Without dead ends: 71 [2024-11-05 08:16:46,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:16:46,726 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:16:46,727 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:16:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-05 08:16:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-05 08:16:46,744 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:16:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-05 08:16:46,749 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 70 [2024-11-05 08:16:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:16:46,749 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-05 08:16:46,749 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:16:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-05 08:16:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-05 08:16:46,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:16:46,755 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:16:46,766 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:16:46,955 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:16:46,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:16:46,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:16:46,957 INFO L85 PathProgramCache]: Analyzing trace with hash -316025515, now seen corresponding path program 1 times [2024-11-05 08:16:46,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:16:46,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2097222486] [2024-11-05 08:16:46,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:16:46,957 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:16:46,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:16:46,961 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:16:46,962 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:16:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:16:47,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:16:47,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:16:47,294 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:16:47,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:16:47,469 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:16:47,470 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:16:47,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2097222486] [2024-11-05 08:16:47,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2097222486] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:16:47,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:16:47,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-11-05 08:16:47,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875755338] [2024-11-05 08:16:47,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:16:47,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:16:47,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:16:47,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:16:47,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:16:47,472 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:16:47,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:16:47,681 INFO L93 Difference]: Finished difference Result 135 states and 183 transitions. [2024-11-05 08:16:47,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:16:47,682 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:16:47,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:16:47,683 INFO L225 Difference]: With dead ends: 135 [2024-11-05 08:16:47,684 INFO L226 Difference]: Without dead ends: 80 [2024-11-05 08:16:47,684 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:16:47,685 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 30 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:16:47,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 354 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:16:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-05 08:16:47,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2024-11-05 08:16:47,695 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:16:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-05 08:16:47,696 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 72 [2024-11-05 08:16:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:16:47,696 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-05 08:16:47,696 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:16:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-05 08:16:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-05 08:16:47,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:16:47,698 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:16:47,708 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:16:47,901 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:16:47,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:16:47,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:16:47,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1928092350, now seen corresponding path program 1 times [2024-11-05 08:16:47,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:16:47,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1997696269] [2024-11-05 08:16:47,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:16:47,903 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:16:47,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:16:47,904 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:16:47,905 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:16:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:16:48,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:16:48,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:16:48,200 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:16:48,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:16:48,254 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:16:48,254 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:16:48,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1997696269] [2024-11-05 08:16:48,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1997696269] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:16:48,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:16:48,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 7 [2024-11-05 08:16:48,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580038777] [2024-11-05 08:16:48,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:16:48,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:16:48,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:16:48,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:16:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:16:48,257 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:16:48,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:16:48,394 INFO L93 Difference]: Finished difference Result 135 states and 185 transitions. [2024-11-05 08:16:48,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:16:48,395 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:16:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:16:48,396 INFO L225 Difference]: With dead ends: 135 [2024-11-05 08:16:48,396 INFO L226 Difference]: Without dead ends: 78 [2024-11-05 08:16:48,397 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:16:48,398 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:16:48,398 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:16:48,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-05 08:16:48,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-11-05 08:16:48,418 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:16:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2024-11-05 08:16:48,423 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 73 [2024-11-05 08:16:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:16:48,424 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2024-11-05 08:16:48,424 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:16:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2024-11-05 08:16:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-05 08:16:48,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:16:48,426 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:16:48,438 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:16:48,626 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:16:48,627 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:16:48,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:16:48,627 INFO L85 PathProgramCache]: Analyzing trace with hash 137287748, now seen corresponding path program 1 times [2024-11-05 08:16:48,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:16:48,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626699161] [2024-11-05 08:16:48,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:16:48,628 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:16:48,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:16:48,631 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:16:48,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-05 08:16:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:16:48,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 08:16:48,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:16:48,924 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:16:48,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:16:49,024 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:16:49,025 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:16:49,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626699161] [2024-11-05 08:16:49,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [626699161] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:16:49,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:16:49,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-05 08:16:49,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257471817] [2024-11-05 08:16:49,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:16:49,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:16:49,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:16:49,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:16:49,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:16:49,027 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:16:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:16:49,103 INFO L93 Difference]: Finished difference Result 136 states and 183 transitions. [2024-11-05 08:16:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:16:49,105 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:16:49,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:16:49,108 INFO L225 Difference]: With dead ends: 136 [2024-11-05 08:16:49,108 INFO L226 Difference]: Without dead ends: 78 [2024-11-05 08:16:49,112 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:16:49,113 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.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:16:49,114 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.1s Time] [2024-11-05 08:16:49,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-05 08:16:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2024-11-05 08:16:49,126 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:16:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2024-11-05 08:16:49,129 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 81 [2024-11-05 08:16:49,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:16:49,130 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2024-11-05 08:16:49,130 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:16:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2024-11-05 08:16:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-05 08:16:49,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:16:49,132 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:16:49,145 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:16:49,337 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:16:49,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:16:49,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:16:49,338 INFO L85 PathProgramCache]: Analyzing trace with hash 431382673, now seen corresponding path program 1 times [2024-11-05 08:16:49,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:16:49,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [367857543] [2024-11-05 08:16:49,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:16:49,339 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:16:49,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:16:49,340 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:16:49,341 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:16:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:16:49,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 08:16:49,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:16:53,949 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:16:54,297 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:16:54,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:16:54,590 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:16:54,590 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:16:54,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [367857543] [2024-11-05 08:16:54,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [367857543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:16:54,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:16:54,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-05 08:16:54,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685744965] [2024-11-05 08:16:54,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:16:54,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 08:16:54,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:16:54,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 08:16:54,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-05 08:16:54,593 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:16:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:16:55,757 INFO L93 Difference]: Finished difference Result 173 states and 247 transitions. [2024-11-05 08:16:55,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-05 08:16:55,758 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:16:55,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:16:55,760 INFO L225 Difference]: With dead ends: 173 [2024-11-05 08:16:55,761 INFO L226 Difference]: Without dead ends: 114 [2024-11-05 08:16:55,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2024-11-05 08:16:55,762 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 31 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2024-11-05 08:16:55,762 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.9s Time] [2024-11-05 08:16:55,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-05 08:16:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2024-11-05 08:16:55,791 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:16:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2024-11-05 08:16:55,792 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 120 transitions. Word has length 83 [2024-11-05 08:16:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:16:55,793 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 120 transitions. [2024-11-05 08:16:55,793 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:16:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2024-11-05 08:16:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-05 08:16:55,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:16:55,795 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:16:55,808 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:16:55,996 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:16:55,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:16:55,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:16:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash 13986067, now seen corresponding path program 1 times [2024-11-05 08:16:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:16:55,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2059574917] [2024-11-05 08:16:55,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:16:55,998 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:16:55,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:16:55,999 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:16:56,000 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:16:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:16:56,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 08:16:56,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:16:56,216 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:16:56,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:16:56,258 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:16:56,258 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:16:56,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2059574917] [2024-11-05 08:16:56,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2059574917] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:16:56,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:16:56,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-05 08:16:56,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626472662] [2024-11-05 08:16:56,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:16:56,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:16:56,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:16:56,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:16:56,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:16:56,260 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:16:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:16:56,299 INFO L93 Difference]: Finished difference Result 167 states and 233 transitions. [2024-11-05 08:16:56,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:16:56,301 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:16:56,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:16:56,303 INFO L225 Difference]: With dead ends: 167 [2024-11-05 08:16:56,303 INFO L226 Difference]: Without dead ends: 91 [2024-11-05 08:16:56,303 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:16:56,304 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:16:56,304 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:16:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-05 08:16:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-05 08:16:56,326 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:16:56,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2024-11-05 08:16:56,329 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 83 [2024-11-05 08:16:56,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:16:56,329 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2024-11-05 08:16:56,330 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:16:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2024-11-05 08:16:56,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-05 08:16:56,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:16:56,331 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:16:56,344 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 (9)] Forceful destruction successful, exit code 0 [2024-11-05 08:16:56,531 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:16:56,531 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:16:56,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:16:56,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1975560725, now seen corresponding path program 1 times [2024-11-05 08:16:56,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:16:56,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1364665959] [2024-11-05 08:16:56,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:16:56,533 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:16:56,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:16:56,536 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:16:56,537 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:16:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:16:56,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:16:56,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:16:56,756 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:16:56,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:16:56,799 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:16:56,799 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:16:56,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1364665959] [2024-11-05 08:16:56,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1364665959] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:16:56,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:16:56,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-05 08:16:56,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409744022] [2024-11-05 08:16:56,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:16:56,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 08:16:56,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:16:56,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 08:16:56,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:16:56,801 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:16:56,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:16:56,845 INFO L93 Difference]: Finished difference Result 166 states and 231 transitions. [2024-11-05 08:16:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:16:56,846 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:16:56,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:16:56,848 INFO L225 Difference]: With dead ends: 166 [2024-11-05 08:16:56,848 INFO L226 Difference]: Without dead ends: 90 [2024-11-05 08:16:56,848 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:16:56,849 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:16:56,849 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:16:56,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-05 08:16:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-05 08:16:56,861 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:16:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2024-11-05 08:16:56,862 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 83 [2024-11-05 08:16:56,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:16:56,863 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2024-11-05 08:16:56,865 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:16:56,865 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2024-11-05 08:16:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:16:56,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:16:56,867 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:16:56,879 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 (10)] Forceful destruction successful, exit code 0 [2024-11-05 08:16:57,067 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:16:57,068 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:16:57,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:16:57,068 INFO L85 PathProgramCache]: Analyzing trace with hash -233275002, now seen corresponding path program 1 times [2024-11-05 08:16:57,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:16:57,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1578135239] [2024-11-05 08:16:57,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:16:57,068 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:16:57,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:16:57,070 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:16:57,079 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:16:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:16:57,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-05 08:16:57,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:16:58,420 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:16:58,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:01,433 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-05 08:17:01,434 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:17:01,447 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-05 08:17:01,448 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:17:01,505 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:17:01,505 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:01,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1578135239] [2024-11-05 08:17:01,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1578135239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:17:01,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:17:01,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2024-11-05 08:17:01,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076294589] [2024-11-05 08:17:01,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:17:01,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-05 08:17:01,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:01,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-05 08:17:01,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:17:01,508 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:17:06,116 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:17:10,297 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:17:14,354 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:17:18,389 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:17:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:22,393 INFO L93 Difference]: Finished difference Result 217 states and 277 transitions. [2024-11-05 08:17:22,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 08:17:22,394 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:17:22,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:22,396 INFO L225 Difference]: With dead ends: 217 [2024-11-05 08:17:22,396 INFO L226 Difference]: Without dead ends: 132 [2024-11-05 08:17:22,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2024-11-05 08:17:22,398 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 116 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 51 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:22,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 683 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 376 Invalid, 4 Unknown, 0 Unchecked, 19.9s Time] [2024-11-05 08:17:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-05 08:17:22,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2024-11-05 08:17:22,417 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:17:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2024-11-05 08:17:22,418 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 154 transitions. Word has length 84 [2024-11-05 08:17:22,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:22,419 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 154 transitions. [2024-11-05 08:17:22,419 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:17:22,419 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2024-11-05 08:17:22,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:17:22,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:22,421 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:17:22,436 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:17:22,621 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:17:22,621 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:22,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:22,622 INFO L85 PathProgramCache]: Analyzing trace with hash -980582014, now seen corresponding path program 1 times [2024-11-05 08:17:22,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:22,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1959884059] [2024-11-05 08:17:22,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:22,622 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:17:22,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:22,624 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:17:22,625 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:17:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:22,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-05 08:17:22,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:23,288 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:17:23,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:17:23,330 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:17:25,518 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:17:25,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:26,913 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-05 08:17:26,913 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:17:26,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:17:26,972 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:17:26,991 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:17:27,242 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:17:27,265 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:17:27,767 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:17:27,768 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:27,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1959884059] [2024-11-05 08:17:27,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1959884059] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:17:27,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:17:27,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-11-05 08:17:27,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65289615] [2024-11-05 08:17:27,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:27,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-05 08:17:27,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:27,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-05 08:17:27,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:17:27,769 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:17:31,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:31,119 INFO L93 Difference]: Finished difference Result 308 states and 387 transitions. [2024-11-05 08:17:31,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 08:17:31,120 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:17:31,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:31,122 INFO L225 Difference]: With dead ends: 308 [2024-11-05 08:17:31,122 INFO L226 Difference]: Without dead ends: 238 [2024-11-05 08:17:31,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-11-05 08:17:31,123 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 34 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.8s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:31,124 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.8s Time] [2024-11-05 08:17:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-05 08:17:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-05 08:17:31,175 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:17:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 292 transitions. [2024-11-05 08:17:31,177 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 292 transitions. Word has length 84 [2024-11-05 08:17:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:31,178 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 292 transitions. [2024-11-05 08:17:31,178 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:17:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 292 transitions. [2024-11-05 08:17:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:17:31,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:31,180 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:17:31,196 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:17:31,380 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:17:31,381 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:31,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:31,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1883082114, now seen corresponding path program 1 times [2024-11-05 08:17:31,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:31,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [530128490] [2024-11-05 08:17:31,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:31,382 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:17:31,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:31,383 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:17:31,385 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:17:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:31,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-05 08:17:31,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:34,808 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:17:34,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:41,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:17:41,140 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 29 [2024-11-05 08:17:41,207 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-05 08:17:41,207 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 19 [2024-11-05 08:17:41,279 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:17:41,279 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:41,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [530128490] [2024-11-05 08:17:41,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [530128490] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:17:41,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:17:41,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2024-11-05 08:17:41,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770542887] [2024-11-05 08:17:41,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:17:41,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-05 08:17:41,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:41,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-05 08:17:41,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-11-05 08:17:41,282 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:17:45,392 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:17:49,590 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:17:53,829 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:17:58,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:58,025 INFO L93 Difference]: Finished difference Result 370 states and 472 transitions. [2024-11-05 08:17:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 08:17:58,026 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:17:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:58,028 INFO L225 Difference]: With dead ends: 370 [2024-11-05 08:17:58,028 INFO L226 Difference]: Without dead ends: 238 [2024-11-05 08:17:58,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2024-11-05 08:17:58,029 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 100 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 50 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s 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, 15.9s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:58,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 967 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 671 Invalid, 3 Unknown, 0 Unchecked, 15.9s Time] [2024-11-05 08:17:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-05 08:17:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-05 08:17:58,073 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:17:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2024-11-05 08:17:58,075 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 84 [2024-11-05 08:17:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:58,075 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2024-11-05 08:17:58,075 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:17:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2024-11-05 08:17:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:17:58,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:58,076 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:17:58,086 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 (13)] Forceful destruction successful, exit code 0 [2024-11-05 08:17:58,277 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:17:58,277 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:58,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:58,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1602284422, now seen corresponding path program 1 times [2024-11-05 08:17:58,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:58,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1038935182] [2024-11-05 08:17:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:58,278 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:17:58,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:58,281 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:17:58,282 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:17:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:58,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-05 08:17:58,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:59,900 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:17:59,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:01,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:18:01,093 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:18:01,940 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:18:01,941 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:01,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1038935182] [2024-11-05 08:18:01,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1038935182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:18:01,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:18:01,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2024-11-05 08:18:01,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749978443] [2024-11-05 08:18:01,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:18:01,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-05 08:18:01,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:01,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-05 08:18:01,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-11-05 08:18:01,943 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:18:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:08,051 INFO L93 Difference]: Finished difference Result 606 states and 772 transitions. [2024-11-05 08:18:08,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-05 08:18:08,052 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:18:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:08,055 INFO L225 Difference]: With dead ends: 606 [2024-11-05 08:18:08,055 INFO L226 Difference]: Without dead ends: 460 [2024-11-05 08:18:08,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=235, Invalid=1405, Unknown=0, NotChecked=0, Total=1640 [2024-11-05 08:18:08,057 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 222 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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.7s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:08,057 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.7s Time] [2024-11-05 08:18:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-05 08:18:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 394. [2024-11-05 08:18:08,118 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:18:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 497 transitions. [2024-11-05 08:18:08,121 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 497 transitions. Word has length 84 [2024-11-05 08:18:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:08,122 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 497 transitions. [2024-11-05 08:18:08,122 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:18:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 497 transitions. [2024-11-05 08:18:08,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:18:08,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:08,123 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:18:08,133 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:18:08,324 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:18:08,324 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:08,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:08,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1956325238, now seen corresponding path program 1 times [2024-11-05 08:18:08,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:08,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1574073504] [2024-11-05 08:18:08,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:08,325 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:18:08,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:08,326 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:18:08,327 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:18:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:08,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:18:08,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:08,751 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:18:08,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:09,043 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:18:09,044 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:09,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1574073504] [2024-11-05 08:18:09,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1574073504] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:18:09,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:18:09,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2024-11-05 08:18:09,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349511586] [2024-11-05 08:18:09,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:09,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:18:09,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:09,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:18:09,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 08:18:09,045 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:18:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:09,278 INFO L93 Difference]: Finished difference Result 847 states and 1099 transitions. [2024-11-05 08:18:09,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:18:09,279 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:18:09,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:09,282 INFO L225 Difference]: With dead ends: 847 [2024-11-05 08:18:09,282 INFO L226 Difference]: Without dead ends: 381 [2024-11-05 08:18:09,285 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:18:09,285 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:18:09,288 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:18:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-05 08:18:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-11-05 08:18:09,342 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:18:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 476 transitions. [2024-11-05 08:18:09,345 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 476 transitions. Word has length 84 [2024-11-05 08:18:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:09,345 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 476 transitions. [2024-11-05 08:18:09,345 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:18:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2024-11-05 08:18:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-05 08:18:09,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:09,347 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:18:09,356 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:18:09,547 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:18:09,548 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:09,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:09,548 INFO L85 PathProgramCache]: Analyzing trace with hash 428580672, now seen corresponding path program 1 times [2024-11-05 08:18:09,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:09,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [72111598] [2024-11-05 08:18:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:09,550 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:18:09,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:09,553 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:18:09,554 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:18:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:09,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-05 08:18:09,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:10,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-05 08:18:10,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:18:10,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-11-05 08:18:10,062 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:18:10,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 21 [2024-11-05 08:18:10,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-05 08:18:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-05 08:18:11,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:12,217 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-05 08:18:12,217 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:18:12,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:18:12,262 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:18:12,280 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:18:12,512 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:18:12,548 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:18:12,852 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:18:12,852 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:12,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [72111598] [2024-11-05 08:18:12,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [72111598] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:18:12,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:18:12,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-11-05 08:18:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389655094] [2024-11-05 08:18:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:12,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-05 08:18:12,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-05 08:18:12,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:18:12,853 INFO L87 Difference]: Start difference. First operand 381 states and 476 transitions. Second operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 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)