/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 05:24:30,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 05:24:30,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-06 05:24:30,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 05:24:30,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 05:24:30,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 05:24:30,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 05:24:30,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 05:24:30,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 05:24:30,608 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 05:24:30,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 05:24:30,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 05:24:30,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 05:24:30,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 05:24:30,610 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 05:24:30,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 05:24:30,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 05:24:30,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 05:24:30,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 05:24:30,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 05:24:30,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 05:24:30,617 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 05:24:30,617 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 05:24:30,617 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 05:24:30,617 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 05:24:30,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 05:24:30,618 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 05:24:30,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 05:24:30,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 05:24:30,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 05:24:30,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 05:24:30,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 05:24:30,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 05:24:30,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 05:24:30,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 05:24:30,620 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 05:24:30,622 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 05:24:30,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 05:24:30,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 05:24:30,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 05:24:30,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 05:24:30,623 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 05:24:30,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 05:24:30,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 05:24:30,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 05:24:30,874 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 05:24:30,875 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 05:24:30,875 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_rend_harness.i [2024-11-06 05:24:32,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 05:24:32,606 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 05:24:32,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness.i [2024-11-06 05:24:32,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49adf20d0/f066730ddc2c4c6aa779f9c1f7a7c21d/FLAGcbb48a345 [2024-11-06 05:24:32,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49adf20d0/f066730ddc2c4c6aa779f9c1f7a7c21d [2024-11-06 05:24:32,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 05:24:32,786 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 05:24:32,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 05:24:32,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 05:24:32,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 05:24:32,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 05:24:32" (1/1) ... [2024-11-06 05:24:32,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbec211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:32, skipping insertion in model container [2024-11-06 05:24:32,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 05:24:32" (1/1) ... [2024-11-06 05:24:32,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 05:24:33,169 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_rend_harness.i[4494,4507] [2024-11-06 05:24:33,177 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_rend_harness.i[4554,4567] [2024-11-06 05:24:33,657 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,741 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,742 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,742 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,757 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,759 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:33,761 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:33,762 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:33,762 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,763 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:33,764 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:33,770 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,771 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,777 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,777 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,788 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:33,789 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,789 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:33,790 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,791 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:33,791 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,792 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:33,792 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,794 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:33,795 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,795 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:33,796 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:33,796 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:33,796 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,056 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,056 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,057 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,057 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,196 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:24:34,246 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-06 05:24:34,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 05:24:34,285 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_rend_harness.i[4494,4507] [2024-11-06 05:24:34,287 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_rend_harness.i[4554,4567] [2024-11-06 05:24:34,317 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,336 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,337 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,337 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,349 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,350 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,350 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,350 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,351 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,351 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,352 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,357 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,357 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,359 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,359 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,363 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,363 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,363 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,364 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,364 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,365 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,365 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,365 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,366 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,367 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,368 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,372 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,372 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,373 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,425 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,425 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,426 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,426 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,455 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:24:34,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:24:34,469 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 05:24:34,485 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_rend_harness.i[4494,4507] [2024-11-06 05:24:34,485 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_rend_harness.i[4554,4567] [2024-11-06 05:24:34,539 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,539 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,540 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,540 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,541 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,547 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,549 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,550 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,550 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,551 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,553 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,553 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,553 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:24:34,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:24:34,795 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-06 05:24:34,805 INFO L204 MainTranslator]: Completed translation [2024-11-06 05:24:34,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:34 WrapperNode [2024-11-06 05:24:34,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 05:24:34,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 05:24:34,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 05:24:34,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 05:24:34,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:34" (1/1) ... [2024-11-06 05:24:34,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:34" (1/1) ... [2024-11-06 05:24:34,918 INFO L138 Inliner]: procedures = 687, calls = 1038, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 138 [2024-11-06 05:24:34,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 05:24:34,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 05:24:34,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 05:24:34,921 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 05:24:34,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:34" (1/1) ... [2024-11-06 05:24:34,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:34" (1/1) ... [2024-11-06 05:24:34,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:34" (1/1) ... [2024-11-06 05:24:34,961 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 14, 5]. 67 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2024-11-06 05:24:34,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:34" (1/1) ... [2024-11-06 05:24:34,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:34" (1/1) ... [2024-11-06 05:24:34,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:34" (1/1) ... [2024-11-06 05:24:34,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:34" (1/1) ... [2024-11-06 05:24:34,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:34" (1/1) ... [2024-11-06 05:24:35,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:34" (1/1) ... [2024-11-06 05:24:35,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 05:24:35,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 05:24:35,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 05:24:35,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 05:24:35,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:34" (1/1) ... [2024-11-06 05:24:35,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 05:24:35,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 05:24:35,040 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 05:24:35,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 05:24:35,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 05:24:35,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 05:24:35,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 05:24:35,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 05:24:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 05:24:35,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 05:24:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-06 05:24:35,070 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-06 05:24:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-06 05:24:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-06 05:24:35,070 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-06 05:24:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 05:24:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 05:24:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 05:24:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-06 05:24:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 05:24:35,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 05:24:35,071 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 05:24:35,071 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 05:24:35,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 05:24:35,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 05:24:35,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 05:24:35,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-06 05:24:35,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-06 05:24:35,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-06 05:24:35,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-06 05:24:35,071 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-06 05:24:35,072 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-06 05:24:35,320 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 05:24:35,325 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 05:24:35,639 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-06 05:24:35,640 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 05:24:35,657 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 05:24:35,657 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 05:24:35,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 05:24:35 BoogieIcfgContainer [2024-11-06 05:24:35,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 05:24:35,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 05:24:35,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 05:24:35,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 05:24:35,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 05:24:32" (1/3) ... [2024-11-06 05:24:35,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6917208f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 05:24:35, skipping insertion in model container [2024-11-06 05:24:35,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:24:34" (2/3) ... [2024-11-06 05:24:35,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6917208f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 05:24:35, skipping insertion in model container [2024-11-06 05:24:35,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 05:24:35" (3/3) ... [2024-11-06 05:24:35,667 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rend_harness.i [2024-11-06 05:24:35,682 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 05:24:35,682 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 05:24:35,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 05:24:35,740 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;@4d3f6b62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 05:24:35,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 05:24:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 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-06 05:24:35,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-06 05:24:35,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:35,755 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-06 05:24:35,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:35,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:35,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2107862704, now seen corresponding path program 1 times [2024-11-06 05:24:35,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:35,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143271013] [2024-11-06 05:24:35,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:24:35,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:35,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:35,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:24:35,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-06 05:24:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:24:36,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 05:24:36,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:36,114 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-06 05:24:36,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:24:36,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:36,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143271013] [2024-11-06 05:24:36,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143271013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:24:36,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:24:36,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 05:24:36,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39549748] [2024-11-06 05:24:36,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:24:36,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 05:24:36,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:36,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 05:24:36,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 05:24:36,150 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 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-06 05:24:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:36,178 INFO L93 Difference]: Finished difference Result 128 states and 184 transitions. [2024-11-06 05:24:36,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 05:24:36,180 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-06 05:24:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:36,187 INFO L225 Difference]: With dead ends: 128 [2024-11-06 05:24:36,188 INFO L226 Difference]: Without dead ends: 63 [2024-11-06 05:24:36,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 05:24:36,194 INFO L432 NwaCegarLoop]: 87 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, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:24:36,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:24:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-06 05:24:36,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-06 05:24:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 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-06 05:24:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-11-06 05:24:36,233 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 68 [2024-11-06 05:24:36,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:36,234 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-11-06 05:24:36,234 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-06 05:24:36,234 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-11-06 05:24:36,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-06 05:24:36,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:36,241 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-06 05:24:36,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-06 05:24:36,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:36,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:36,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:36,443 INFO L85 PathProgramCache]: Analyzing trace with hash 900796622, now seen corresponding path program 1 times [2024-11-06 05:24:36,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:36,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718315460] [2024-11-06 05:24:36,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:24:36,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:36,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:36,446 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:24:36,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-06 05:24:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:24:36,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 05:24:36,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:36,748 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-06 05:24:36,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:24:36,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:36,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718315460] [2024-11-06 05:24:36,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718315460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:24:36,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:24:36,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 05:24:36,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406020685] [2024-11-06 05:24:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:24:36,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:24:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:36,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:24:36,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:24:36,754 INFO L87 Difference]: Start difference. First operand 63 states and 82 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-06 05:24:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:36,826 INFO L93 Difference]: Finished difference Result 114 states and 152 transitions. [2024-11-06 05:24:36,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:24:36,830 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-06 05:24:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:36,832 INFO L225 Difference]: With dead ends: 114 [2024-11-06 05:24:36,832 INFO L226 Difference]: Without dead ends: 65 [2024-11-06 05:24:36,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:24:36,835 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:24:36,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 377 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:24:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-06 05:24:36,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-06 05:24:36,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.288888888888889) internal successors, (58), 47 states have internal predecessors, (58), 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-06 05:24:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2024-11-06 05:24:36,846 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 68 [2024-11-06 05:24:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:36,846 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2024-11-06 05:24:36,846 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-06 05:24:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2024-11-06 05:24:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-06 05:24:36,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:36,848 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-06 05:24:36,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-06 05:24:37,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:37,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:37,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:37,051 INFO L85 PathProgramCache]: Analyzing trace with hash 577933322, now seen corresponding path program 1 times [2024-11-06 05:24:37,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:37,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577224294] [2024-11-06 05:24:37,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:24:37,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:37,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:37,054 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:24:37,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-06 05:24:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:24:37,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:24:37,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:37,350 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-06 05:24:37,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:24:37,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:37,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577224294] [2024-11-06 05:24:37,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577224294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:24:37,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:24:37,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 05:24:37,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581772188] [2024-11-06 05:24:37,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:24:37,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:24:37,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:37,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:24:37,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:24:37,352 INFO L87 Difference]: Start difference. First operand 65 states and 86 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-06 05:24:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:37,502 INFO L93 Difference]: Finished difference Result 121 states and 163 transitions. [2024-11-06 05:24:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:24:37,503 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-06 05:24:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:37,504 INFO L225 Difference]: With dead ends: 121 [2024-11-06 05:24:37,504 INFO L226 Difference]: Without dead ends: 70 [2024-11-06 05:24:37,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:24:37,506 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 20 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:24:37,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 300 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:24:37,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-06 05:24:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-06 05:24:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 50 states have internal predecessors, (60), 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-06 05:24:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2024-11-06 05:24:37,522 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 70 [2024-11-06 05:24:37,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:37,523 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2024-11-06 05:24:37,523 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-06 05:24:37,523 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2024-11-06 05:24:37,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-06 05:24:37,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:37,525 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-06 05:24:37,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-06 05:24:37,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:37,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:37,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:37,727 INFO L85 PathProgramCache]: Analyzing trace with hash -34807881, now seen corresponding path program 1 times [2024-11-06 05:24:37,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:37,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130569956] [2024-11-06 05:24:37,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:24:37,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:37,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:37,731 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:24:37,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-06 05:24:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:24:37,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 05:24:37,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:38,004 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-06 05:24:38,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:24:38,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:38,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130569956] [2024-11-06 05:24:38,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130569956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:24:38,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:24:38,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 05:24:38,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242730593] [2024-11-06 05:24:38,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:24:38,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 05:24:38,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:38,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 05:24:38,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:24:38,007 INFO L87 Difference]: Start difference. First operand 68 states and 90 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-06 05:24:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:38,192 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2024-11-06 05:24:38,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 05:24:38,193 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-06 05:24:38,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:38,194 INFO L225 Difference]: With dead ends: 133 [2024-11-06 05:24:38,194 INFO L226 Difference]: Without dead ends: 79 [2024-11-06 05:24:38,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-06 05:24:38,196 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 29 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:24:38,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 354 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:24:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-06 05:24:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2024-11-06 05:24:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 52 states have internal predecessors, (63), 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-06 05:24:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2024-11-06 05:24:38,206 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 72 [2024-11-06 05:24:38,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:38,206 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2024-11-06 05:24:38,206 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-06 05:24:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2024-11-06 05:24:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-06 05:24:38,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:38,208 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-06 05:24:38,216 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-06 05:24:38,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:38,409 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:38,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:38,409 INFO L85 PathProgramCache]: Analyzing trace with hash 387052583, now seen corresponding path program 1 times [2024-11-06 05:24:38,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:38,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608453919] [2024-11-06 05:24:38,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:24:38,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:38,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:38,413 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:24:38,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-06 05:24:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:24:38,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 05:24:38,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:38,675 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-06 05:24:38,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:24:38,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:38,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608453919] [2024-11-06 05:24:38,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608453919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:24:38,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:24:38,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 05:24:38,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359589861] [2024-11-06 05:24:38,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:24:38,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:24:38,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:38,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:24:38,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:24:38,678 INFO L87 Difference]: Start difference. First operand 70 states and 93 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-06 05:24:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:38,803 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2024-11-06 05:24:38,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:24:38,804 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-06 05:24:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:38,805 INFO L225 Difference]: With dead ends: 133 [2024-11-06 05:24:38,805 INFO L226 Difference]: Without dead ends: 77 [2024-11-06 05:24:38,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:24:38,807 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 23 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:24:38,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 287 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:24:38,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-06 05:24:38,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2024-11-06 05:24:38,816 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-06 05:24:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-06 05:24:38,817 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 73 [2024-11-06 05:24:38,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:38,817 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-06 05:24:38,818 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-06 05:24:38,818 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-06 05:24:38,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-06 05:24:38,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:38,819 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-06 05:24:38,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-06 05:24:39,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:39,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:39,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1595103561, now seen corresponding path program 1 times [2024-11-06 05:24:39,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:39,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272448283] [2024-11-06 05:24:39,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:24:39,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:39,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:39,024 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:24:39,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-06 05:24:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:24:39,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:24:39,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:39,274 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-06 05:24:39,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:24:39,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:39,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272448283] [2024-11-06 05:24:39,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272448283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:24:39,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:24:39,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 05:24:39,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888041960] [2024-11-06 05:24:39,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:24:39,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 05:24:39,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:39,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 05:24:39,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:24:39,277 INFO L87 Difference]: Start difference. First operand 71 states and 94 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-06 05:24:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:39,343 INFO L93 Difference]: Finished difference Result 134 states and 181 transitions. [2024-11-06 05:24:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 05:24:39,345 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-06 05:24:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:39,347 INFO L225 Difference]: With dead ends: 134 [2024-11-06 05:24:39,347 INFO L226 Difference]: Without dead ends: 77 [2024-11-06 05:24:39,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:24:39,348 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 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-06 05:24:39,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:24:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-06 05:24:39,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2024-11-06 05:24:39,383 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-06 05:24:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2024-11-06 05:24:39,385 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 81 [2024-11-06 05:24:39,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:39,385 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2024-11-06 05:24:39,385 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-06 05:24:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2024-11-06 05:24:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-06 05:24:39,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:39,387 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-06 05:24:39,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-06 05:24:39,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:39,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:39,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:39,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1786751690, now seen corresponding path program 1 times [2024-11-06 05:24:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:39,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005260907] [2024-11-06 05:24:39,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:24:39,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:39,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:39,590 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:24:39,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-06 05:24:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:24:39,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 05:24:39,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:44,116 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 (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.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|)))) (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$#1.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|) (_ bv0 64))))) is different from true [2024-11-06 05:24:44,374 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-06 05:24:44,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:24:44,669 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-06 05:24:44,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:44,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005260907] [2024-11-06 05:24:44,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005260907] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:24:44,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:24:44,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-06 05:24:44,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133595138] [2024-11-06 05:24:44,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:24:44,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:24:44,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:44,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:24:44,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-06 05:24:44,672 INFO L87 Difference]: Start difference. First operand 72 states and 95 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-06 05:24:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:45,580 INFO L93 Difference]: Finished difference Result 171 states and 245 transitions. [2024-11-06 05:24:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 05:24:45,581 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-06 05:24:45,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:45,583 INFO L225 Difference]: With dead ends: 171 [2024-11-06 05:24:45,583 INFO L226 Difference]: Without dead ends: 113 [2024-11-06 05:24:45,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2024-11-06 05:24:45,586 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 31 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 05:24:45,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 492 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 252 Invalid, 0 Unknown, 224 Unchecked, 0.7s Time] [2024-11-06 05:24:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-06 05:24:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 89. [2024-11-06 05:24:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.303030303030303) internal successors, (86), 69 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-06 05:24:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2024-11-06 05:24:45,613 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 83 [2024-11-06 05:24:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:45,614 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2024-11-06 05:24:45,614 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-06 05:24:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2024-11-06 05:24:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-06 05:24:45,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:45,615 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-06 05:24:45,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-06 05:24:45,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:45,816 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:45,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2090819000, now seen corresponding path program 1 times [2024-11-06 05:24:45,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:45,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290455431] [2024-11-06 05:24:45,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:24:45,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:45,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:45,819 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:24:45,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-06 05:24:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:24:45,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:24:46,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:46,015 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-06 05:24:46,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:24:46,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:46,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290455431] [2024-11-06 05:24:46,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290455431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:24:46,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:24:46,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 05:24:46,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817361403] [2024-11-06 05:24:46,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:24:46,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 05:24:46,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:46,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 05:24:46,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 05:24:46,017 INFO L87 Difference]: Start difference. First operand 89 states and 119 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-06 05:24:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:46,045 INFO L93 Difference]: Finished difference Result 165 states and 231 transitions. [2024-11-06 05:24:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 05:24:46,045 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-06 05:24:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:46,046 INFO L225 Difference]: With dead ends: 165 [2024-11-06 05:24:46,046 INFO L226 Difference]: Without dead ends: 90 [2024-11-06 05:24:46,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 05:24:46,047 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 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-06 05:24:46,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:24:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-06 05:24:46,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-06 05:24:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 69 states have internal predecessors, (85), 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-06 05:24:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2024-11-06 05:24:46,058 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 83 [2024-11-06 05:24:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:46,058 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2024-11-06 05:24:46,058 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-06 05:24:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2024-11-06 05:24:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-06 05:24:46,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:46,059 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-06 05:24:46,068 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-06 05:24:46,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:46,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:46,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:46,261 INFO L85 PathProgramCache]: Analyzing trace with hash -242573638, now seen corresponding path program 1 times [2024-11-06 05:24:46,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:46,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255136552] [2024-11-06 05:24:46,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:24:46,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:46,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:46,264 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:24:46,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-06 05:24:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:24:46,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 05:24:46,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:46,484 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-06 05:24:46,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:24:46,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:46,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255136552] [2024-11-06 05:24:46,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255136552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:24:46,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:24:46,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 05:24:46,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945188052] [2024-11-06 05:24:46,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:24:46,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 05:24:46,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:46,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 05:24:46,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 05:24:46,486 INFO L87 Difference]: Start difference. First operand 89 states and 118 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-06 05:24:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:24:46,522 INFO L93 Difference]: Finished difference Result 164 states and 229 transitions. [2024-11-06 05:24:46,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 05:24:46,523 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-06 05:24:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:24:46,524 INFO L225 Difference]: With dead ends: 164 [2024-11-06 05:24:46,524 INFO L226 Difference]: Without dead ends: 89 [2024-11-06 05:24:46,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 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-06 05:24:46,525 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 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-06 05:24:46,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:24:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-06 05:24:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-11-06 05:24:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.253968253968254) internal successors, (79), 66 states have internal predecessors, (79), 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-06 05:24:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2024-11-06 05:24:46,539 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 83 [2024-11-06 05:24:46,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:24:46,539 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2024-11-06 05:24:46,539 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-06 05:24:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2024-11-06 05:24:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-06 05:24:46,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:24:46,541 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-06 05:24:46,550 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-06 05:24:46,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:46,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:24:46,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:24:46,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1911369352, now seen corresponding path program 1 times [2024-11-06 05:24:46,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:24:46,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319728544] [2024-11-06 05:24:46,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:24:46,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:24:46,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:24:46,744 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:24:46,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-06 05:24:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:24:46,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-06 05:24:46,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:24:47,998 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-06 05:24:47,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:24:50,421 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-06 05:24:50,422 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-06 05:24:50,438 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-06 05:24:50,438 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-06 05:24:50,480 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-06 05:24:50,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:24:50,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319728544] [2024-11-06 05:24:50,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319728544] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:24:50,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:24:50,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2024-11-06 05:24:50,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142737157] [2024-11-06 05:24:50,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:24:50,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-06 05:24:50,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:24:50,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-06 05:24:50,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-06 05:24:50,483 INFO L87 Difference]: Start difference. First operand 86 states and 112 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-06 05:24:54,982 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-06 05:24:59,130 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-06 05:25:03,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-06 05:25:07,386 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-06 05:25:11,814 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-06 05:25:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:25:14,331 INFO L93 Difference]: Finished difference Result 215 states and 275 transitions. [2024-11-06 05:25:14,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-06 05:25:14,332 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-06 05:25:14,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:25:14,334 INFO L225 Difference]: With dead ends: 215 [2024-11-06 05:25:14,334 INFO L226 Difference]: Without dead ends: 131 [2024-11-06 05:25:14,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2024-11-06 05:25:14,335 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 112 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 55 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2024-11-06 05:25:14,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 762 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 431 Invalid, 5 Unknown, 0 Unchecked, 23.2s Time] [2024-11-06 05:25:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-06 05:25:14,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2024-11-06 05:25:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 98 states have internal predecessors, (118), 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-06 05:25:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2024-11-06 05:25:14,353 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 153 transitions. Word has length 84 [2024-11-06 05:25:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:25:14,353 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 153 transitions. [2024-11-06 05:25:14,353 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-06 05:25:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 153 transitions. [2024-11-06 05:25:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-06 05:25:14,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:25:14,354 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-06 05:25:14,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-06 05:25:14,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:25:14,555 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:25:14,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:25:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1164062340, now seen corresponding path program 1 times [2024-11-06 05:25:14,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:25:14,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065641621] [2024-11-06 05:25:14,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:25:14,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:25:14,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:25:14,558 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:25:14,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-06 05:25:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:25:14,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-06 05:25:14,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:25:15,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-06 05:25:15,109 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 8 treesize of output 1 [2024-11-06 05:25:16,546 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-06 05:25:16,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:25:16,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:25:16,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065641621] [2024-11-06 05:25:16,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065641621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:25:16,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:25:16,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 05:25:16,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252515176] [2024-11-06 05:25:16,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:25:16,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 05:25:16,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:25:16,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 05:25:16,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-06 05:25:16,549 INFO L87 Difference]: Start difference. First operand 124 states and 153 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-06 05:25:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:25:18,605 INFO L93 Difference]: Finished difference Result 305 states and 384 transitions. [2024-11-06 05:25:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 05:25:18,606 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-06 05:25:18,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:25:18,607 INFO L225 Difference]: With dead ends: 305 [2024-11-06 05:25:18,608 INFO L226 Difference]: Without dead ends: 236 [2024-11-06 05:25:18,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-06 05:25:18,609 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 51 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-06 05:25:18,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 407 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 05:25:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-06 05:25:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2024-11-06 05:25:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 181 states have (on average 1.2375690607734806) internal successors, (224), 185 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-06 05:25:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 290 transitions. [2024-11-06 05:25:18,657 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 290 transitions. Word has length 84 [2024-11-06 05:25:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:25:18,657 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 290 transitions. [2024-11-06 05:25:18,657 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-06 05:25:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 290 transitions. [2024-11-06 05:25:18,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-06 05:25:18,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:25:18,659 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-06 05:25:18,669 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 (12)] Forceful destruction successful, exit code 0 [2024-11-06 05:25:18,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:25:18,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:25:18,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:25:18,860 INFO L85 PathProgramCache]: Analyzing trace with hash 261562240, now seen corresponding path program 1 times [2024-11-06 05:25:18,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:25:18,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163803983] [2024-11-06 05:25:18,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:25:18,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:25:18,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:25:18,864 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:25:18,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-06 05:25:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:25:19,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-06 05:25:19,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:25:21,399 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-06 05:25:21,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:25:27,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 05:25:27,108 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-06 05:25:27,167 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-06 05:25:27,168 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-06 05:25:27,227 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-06 05:25:27,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:25:27,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163803983] [2024-11-06 05:25:27,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163803983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:25:27,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:25:27,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2024-11-06 05:25:27,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237152702] [2024-11-06 05:25:27,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:25:27,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-06 05:25:27,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:25:27,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-06 05:25:27,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-11-06 05:25:27,229 INFO L87 Difference]: Start difference. First operand 232 states and 290 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-06 05:25:31,339 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-06 05:25:35,514 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-06 05:25:39,724 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-06 05:25:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:25:43,151 INFO L93 Difference]: Finished difference Result 366 states and 468 transitions. [2024-11-06 05:25:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-06 05:25:43,152 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-06 05:25:43,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:25:43,153 INFO L225 Difference]: With dead ends: 366 [2024-11-06 05:25:43,153 INFO L226 Difference]: Without dead ends: 236 [2024-11-06 05:25:43,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2024-11-06 05:25:43,154 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 126 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 56 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:25:43,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 792 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 486 Invalid, 3 Unknown, 0 Unchecked, 15.0s Time] [2024-11-06 05:25:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-06 05:25:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2024-11-06 05:25:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 181 states have (on average 1.2265193370165746) internal successors, (222), 185 states have internal predecessors, (222), 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-06 05:25:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 288 transitions. [2024-11-06 05:25:43,195 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 288 transitions. Word has length 84 [2024-11-06 05:25:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:25:43,196 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 288 transitions. [2024-11-06 05:25:43,196 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-06 05:25:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 288 transitions. [2024-11-06 05:25:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-06 05:25:43,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:25:43,197 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-06 05:25:43,208 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-06 05:25:43,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:25:43,398 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:25:43,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:25:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash 542359932, now seen corresponding path program 1 times [2024-11-06 05:25:43,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:25:43,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080651868] [2024-11-06 05:25:43,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:25:43,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:25:43,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:25:43,402 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:25:43,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-06 05:25:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:25:43,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 05:25:43,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:25:45,288 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-06 05:25:45,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:25:47,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 05:25:47,082 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-06 05:25:47,623 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-06 05:25:47,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:25:47,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080651868] [2024-11-06 05:25:47,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080651868] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:25:47,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:25:47,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2024-11-06 05:25:47,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437943942] [2024-11-06 05:25:47,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:25:47,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-06 05:25:47,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:25:47,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-06 05:25:47,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-11-06 05:25:47,627 INFO L87 Difference]: Start difference. First operand 232 states and 288 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-06 05:25:52,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:25:52,690 INFO L93 Difference]: Finished difference Result 600 states and 766 transitions. [2024-11-06 05:25:52,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-06 05:25:52,691 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-06 05:25:52,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:25:52,694 INFO L225 Difference]: With dead ends: 600 [2024-11-06 05:25:52,695 INFO L226 Difference]: Without dead ends: 456 [2024-11-06 05:25:52,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=235, Invalid=1405, Unknown=0, NotChecked=0, Total=1640 [2024-11-06 05:25:52,697 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 220 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-06 05:25:52,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1193 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-06 05:25:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-06 05:25:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 390. [2024-11-06 05:25:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 301 states have (on average 1.2325581395348837) internal successors, (371), 311 states have internal predecessors, (371), 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-06 05:25:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 493 transitions. [2024-11-06 05:25:52,780 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 493 transitions. Word has length 84 [2024-11-06 05:25:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:25:52,780 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 493 transitions. [2024-11-06 05:25:52,780 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-06 05:25:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 493 transitions. [2024-11-06 05:25:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-06 05:25:52,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:25:52,782 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-06 05:25:52,792 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-06 05:25:52,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:25:52,983 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:25:52,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:25:52,983 INFO L85 PathProgramCache]: Analyzing trace with hash -193997704, now seen corresponding path program 1 times [2024-11-06 05:25:52,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:25:52,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708814848] [2024-11-06 05:25:52,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:25:52,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:25:52,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:25:52,985 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:25:52,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-06 05:25:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:25:53,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 05:25:53,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:25:53,287 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-06 05:25:53,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:25:53,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:25:53,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708814848] [2024-11-06 05:25:53,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708814848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:25:53,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:25:53,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 05:25:53,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982683228] [2024-11-06 05:25:53,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:25:53,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:25:53,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:25:53,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:25:53,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:25:53,289 INFO L87 Difference]: Start difference. First operand 390 states and 493 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-06 05:25:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:25:53,459 INFO L93 Difference]: Finished difference Result 839 states and 1091 transitions. [2024-11-06 05:25:53,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:25:53,459 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-06 05:25:53,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:25:53,462 INFO L225 Difference]: With dead ends: 839 [2024-11-06 05:25:53,462 INFO L226 Difference]: Without dead ends: 377 [2024-11-06 05:25:53,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 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-06 05:25:53,465 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 24 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:25:53,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 406 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:25:53,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-06 05:25:53,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-11-06 05:25:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 288 states have (on average 1.2152777777777777) internal successors, (350), 298 states have internal predecessors, (350), 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-06 05:25:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 472 transitions. [2024-11-06 05:25:53,543 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 472 transitions. Word has length 84 [2024-11-06 05:25:53,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:25:53,543 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 472 transitions. [2024-11-06 05:25:53,543 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-06 05:25:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 472 transitions. [2024-11-06 05:25:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-06 05:25:53,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:25:53,545 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-06 05:25:53,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-06 05:25:53,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:25:53,746 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:25:53,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:25:53,746 INFO L85 PathProgramCache]: Analyzing trace with hash 868564162, now seen corresponding path program 1 times [2024-11-06 05:25:53,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:25:53,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671174126] [2024-11-06 05:25:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:25:53,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:25:53,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:25:53,748 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:25:53,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-06 05:25:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:25:53,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 05:25:53,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:25:54,197 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2024-11-06 05:25:54,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2024-11-06 05:25:54,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2024-11-06 05:25:54,318 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 05:25:54,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 05:25:54,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2024-11-06 05:25:54,332 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 9 treesize of output 7 [2024-11-06 05:25:55,568 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_2) .cse0))) (and (= (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) (= (store .cse1 (_ bv24 64) .cse0) v_DerPreprocessor_2)))) (not (= (_ bv0 64) .cse0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26|))) (let ((.cse2 (select .cse3 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (= (store (select |c_#memory_$Pointer$#1.base| .cse2) (_ bv24 64) .cse2) .cse3)))))) is different from true [2024-11-06 05:26:06,420 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_27| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_27|) (_ bv24 64)))) (and (not (= .cse0 (_ bv0 64))) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_2) .cse0))) (and (= v_DerPreprocessor_2 (store .cse1 (_ bv24 64) .cse0)) (= (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_27| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_27|))) (let ((.cse2 (select .cse3 (_ bv24 64)))) (and (not (= .cse2 (_ bv0 64))) (= (store (select |c_#memory_$Pointer$#1.base| .cse2) (_ bv24 64) .cse2) .cse3)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_2) .cse4))) (and (= (select |c_#memory_$Pointer$#1.base| .cse4) .cse5) (= (store .cse5 (_ bv24 64) .cse4) v_DerPreprocessor_2)))) (not (= (_ bv0 64) .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26|))) (let ((.cse6 (select .cse7 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse6)) (= (store (select |c_#memory_$Pointer$#1.base| .cse6) (_ bv24 64) .cse6) .cse7))))))) is different from true [2024-11-06 05:26:08,368 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|))) (let ((.cse2 (select .cse3 (_ bv24 64)))) (and (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (or (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base| v_DerPreprocessor_2) .cse2))) (and (= .cse0 .cse1) (= v_DerPreprocessor_2 (store .cse0 (_ bv24 64) .cse2))))) (= .cse3 (store .cse1 (_ bv24 64) .cse2)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_27| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_27|) (_ bv24 64)))) (and (not (= .cse4 (_ bv0 64))) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_2) .cse4))) (and (= v_DerPreprocessor_2 (store .cse5 (_ bv24 64) .cse4)) (= (select |c_#memory_$Pointer$#1.base| .cse4) .cse5))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_27| (_ BitVec 64))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_27|))) (let ((.cse6 (select .cse7 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (= (store (select |c_#memory_$Pointer$#1.base| .cse6) (_ bv24 64) .cse6) .cse7)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#1.base| .cse8 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26| v_DerPreprocessor_2) .cse8))) (and (= (select |c_#memory_$Pointer$#1.base| .cse8) .cse9) (= (store .cse9 (_ bv24 64) .cse8) v_DerPreprocessor_2)))) (not (= (_ bv0 64) .cse8))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26| (_ BitVec 64))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_26|))) (let ((.cse10 (select .cse11 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse10)) (= (store (select |c_#memory_$Pointer$#1.base| .cse10) (_ bv24 64) .cse10) .cse11)))))) (not (= (_ bv0 64) .cse2))))) is different from true