/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-pthread/cs_stateful-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 11:36:17,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 11:36:17,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 11:36:17,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 11:36:17,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 11:36:17,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 11:36:17,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 11:36:17,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 11:36:17,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 11:36:17,967 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 11:36:17,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 11:36:17,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 11:36:17,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 11:36:17,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 11:36:17,968 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 11:36:17,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 11:36:17,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 11:36:17,969 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 11:36:17,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 11:36:17,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 11:36:17,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 11:36:17,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 11:36:17,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 11:36:17,973 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 11:36:17,979 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 11:36:17,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 11:36:17,979 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 11:36:17,979 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 11:36:17,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 11:36:17,980 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 11:36:17,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 11:36:17,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 11:36:17,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 11:36:17,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 11:36:17,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:36:17,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 11:36:17,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 11:36:17,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 11:36:17,981 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 11:36:17,981 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 11:36:17,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 11:36:17,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 11:36:17,982 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 11:36:17,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 11:36:17,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 11:36:17,983 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 11:36:17,983 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 [2023-12-25 11:36:18,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 11:36:18,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 11:36:18,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 11:36:18,165 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 11:36:18,166 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 11:36:18,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_stateful-2.i [2023-12-25 11:36:19,137 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 11:36:19,301 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 11:36:19,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stateful-2.i [2023-12-25 11:36:19,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c7b33f56/aca16be44afd4372ab7324dd3007ef1b/FLAGc1040a238 [2023-12-25 11:36:19,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c7b33f56/aca16be44afd4372ab7324dd3007ef1b [2023-12-25 11:36:19,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 11:36:19,331 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 11:36:19,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 11:36:19,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 11:36:19,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 11:36:19,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:36:19" (1/1) ... [2023-12-25 11:36:19,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7160bc29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19, skipping insertion in model container [2023-12-25 11:36:19,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:36:19" (1/1) ... [2023-12-25 11:36:19,363 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 11:36:19,597 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stateful-2.i[23607,23620] [2023-12-25 11:36:19,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:36:19,675 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 11:36:19,695 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stateful-2.i[23607,23620] [2023-12-25 11:36:19,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:36:19,781 INFO L206 MainTranslator]: Completed translation [2023-12-25 11:36:19,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19 WrapperNode [2023-12-25 11:36:19,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 11:36:19,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 11:36:19,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 11:36:19,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 11:36:19,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19" (1/1) ... [2023-12-25 11:36:19,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19" (1/1) ... [2023-12-25 11:36:19,833 INFO L138 Inliner]: procedures = 149, calls = 245, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 531 [2023-12-25 11:36:19,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 11:36:19,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 11:36:19,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 11:36:19,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 11:36:19,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19" (1/1) ... [2023-12-25 11:36:19,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19" (1/1) ... [2023-12-25 11:36:19,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19" (1/1) ... [2023-12-25 11:36:19,882 INFO L175 MemorySlicer]: Split 114 memory accesses to 16 slices as follows [2, 8, 8, 3, 7, 20, 12, 0, 3, 10, 10, 6, 12, 7, 3, 3]. 18 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [2, 3, 3, 0, 0, 6, 6, 0, 0, 2, 2, 2, 4, 0, 0, 0]. The 35 writes are split as follows [0, 2, 2, 1, 1, 8, 3, 0, 1, 4, 4, 2, 4, 1, 1, 1]. [2023-12-25 11:36:19,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19" (1/1) ... [2023-12-25 11:36:19,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19" (1/1) ... [2023-12-25 11:36:19,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19" (1/1) ... [2023-12-25 11:36:19,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19" (1/1) ... [2023-12-25 11:36:19,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19" (1/1) ... [2023-12-25 11:36:19,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19" (1/1) ... [2023-12-25 11:36:19,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 11:36:19,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 11:36:19,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 11:36:19,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 11:36:19,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19" (1/1) ... [2023-12-25 11:36:19,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:36:19,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 11:36:19,958 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) [2023-12-25 11:36:19,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-25 11:36:19,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-25 11:36:19,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-25 11:36:19,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-25 11:36:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-25 11:36:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-25 11:36:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-12-25 11:36:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-12-25 11:36:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-12-25 11:36:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-12-25 11:36:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-12-25 11:36:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2023-12-25 11:36:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2023-12-25 11:36:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2023-12-25 11:36:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2023-12-25 11:36:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2023-12-25 11:36:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 11:36:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 11:36:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 11:36:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-25 11:36:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-25 11:36:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-25 11:36:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-12-25 11:36:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-12-25 11:36:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2023-12-25 11:36:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2023-12-25 11:36:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2023-12-25 11:36:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2023-12-25 11:36:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2023-12-25 11:36:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2023-12-25 11:36:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2023-12-25 11:36:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2023-12-25 11:36:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 11:36:19,990 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 11:36:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 11:36:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 11:36:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-25 11:36:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-25 11:36:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-25 11:36:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-25 11:36:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-12-25 11:36:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-12-25 11:36:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-12-25 11:36:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-12-25 11:36:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-12-25 11:36:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-12-25 11:36:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-12-25 11:36:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-12-25 11:36:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-12-25 11:36:19,978 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 [2023-12-25 11:36:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-12-25 11:36:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-12-25 11:36:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-12-25 11:36:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2023-12-25 11:36:19,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2023-12-25 11:36:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2023-12-25 11:36:19,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2023-12-25 11:36:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-12-25 11:36:19,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-12-25 11:36:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-25 11:36:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-25 11:36:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-25 11:36:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-25 11:36:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-12-25 11:36:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-12-25 11:36:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-12-25 11:36:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-12-25 11:36:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-12-25 11:36:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-12-25 11:36:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-12-25 11:36:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-12-25 11:36:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-12-25 11:36:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-12-25 11:36:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-12-25 11:36:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-12-25 11:36:19,996 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2023-12-25 11:36:19,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2023-12-25 11:36:19,996 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-25 11:36:19,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-25 11:36:19,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-25 11:36:19,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-25 11:36:19,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-25 11:36:19,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-25 11:36:19,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-25 11:36:19,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-25 11:36:19,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-12-25 11:36:19,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-12-25 11:36:19,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-12-25 11:36:19,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-12-25 11:36:19,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-12-25 11:36:19,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2023-12-25 11:36:19,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2023-12-25 11:36:19,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2023-12-25 11:36:19,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2023-12-25 11:36:19,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2023-12-25 11:36:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2023-12-25 11:36:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2023-12-25 11:36:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2023-12-25 11:36:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-25 11:36:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-25 11:36:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-25 11:36:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-12-25 11:36:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-12-25 11:36:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-12-25 11:36:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-12-25 11:36:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-12-25 11:36:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-12-25 11:36:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-12-25 11:36:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-12-25 11:36:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-12-25 11:36:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-12-25 11:36:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-12-25 11:36:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-12-25 11:36:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-12-25 11:36:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 11:36:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 11:36:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 11:36:20,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-25 11:36:20,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-25 11:36:20,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-25 11:36:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-25 11:36:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-12-25 11:36:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-12-25 11:36:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-12-25 11:36:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-12-25 11:36:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2023-12-25 11:36:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2023-12-25 11:36:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2023-12-25 11:36:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2023-12-25 11:36:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2023-12-25 11:36:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-25 11:36:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-25 11:36:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-25 11:36:20,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-25 11:36:20,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-25 11:36:20,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-25 11:36:20,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2023-12-25 11:36:20,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2023-12-25 11:36:20,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2023-12-25 11:36:20,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2023-12-25 11:36:20,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2023-12-25 11:36:20,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2023-12-25 11:36:20,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2023-12-25 11:36:20,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2023-12-25 11:36:20,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2023-12-25 11:36:20,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2023-12-25 11:36:20,014 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-12-25 11:36:20,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-12-25 11:36:20,014 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2023-12-25 11:36:20,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2023-12-25 11:36:20,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 11:36:20,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 11:36:20,262 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 11:36:20,264 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 11:36:21,082 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: SUMMARY for call __CS_cs(); srcloc: null [2023-12-25 11:36:21,084 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-12-25 11:36:21,084 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:36:21,084 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:36:21,084 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-12-25 11:36:21,084 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:36:21,084 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-12-25 11:36:25,961 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 11:36:26,006 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 11:36:26,006 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 11:36:26,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:36:26 BoogieIcfgContainer [2023-12-25 11:36:26,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 11:36:26,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 11:36:26,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 11:36:26,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 11:36:26,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 11:36:19" (1/3) ... [2023-12-25 11:36:26,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6973ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:36:26, skipping insertion in model container [2023-12-25 11:36:26,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:19" (2/3) ... [2023-12-25 11:36:26,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6973ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:36:26, skipping insertion in model container [2023-12-25 11:36:26,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:36:26" (3/3) ... [2023-12-25 11:36:26,014 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2023-12-25 11:36:26,025 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 11:36:26,025 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 11:36:26,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 11:36:26,086 INFO L357 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, mHoare=true, 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;@3ce31ecc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 11:36:26,087 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 11:36:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 100 states have (on average 1.49) internal successors, (149), 101 states have internal predecessors, (149), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-25 11:36:26,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 11:36:26,105 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:26,106 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:36:26,106 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:26,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:26,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1941247954, now seen corresponding path program 1 times [2023-12-25 11:36:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:26,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943822292] [2023-12-25 11:36:26,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:26,124 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 [2023-12-25 11:36:26,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:26,126 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) [2023-12-25 11:36:26,127 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 [2023-12-25 11:36:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:26,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 11:36:26,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-12-25 11:36:26,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:26,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:26,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943822292] [2023-12-25 11:36:26,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943822292] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:26,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:26,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 11:36:26,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907182044] [2023-12-25 11:36:26,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:26,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 11:36:26,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:26,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 11:36:26,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 11:36:26,476 INFO L87 Difference]: Start difference. First operand has 164 states, 100 states have (on average 1.49) internal successors, (149), 101 states have internal predecessors, (149), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-25 11:36:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:26,634 INFO L93 Difference]: Finished difference Result 327 states and 555 transitions. [2023-12-25 11:36:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 11:36:26,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2023-12-25 11:36:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:26,651 INFO L225 Difference]: With dead ends: 327 [2023-12-25 11:36:26,651 INFO L226 Difference]: Without dead ends: 162 [2023-12-25 11:36:26,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 11:36:26,676 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:26,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 11:36:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-12-25 11:36:26,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2023-12-25 11:36:26,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 99 states have (on average 1.4444444444444444) internal successors, (143), 99 states have internal predecessors, (143), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-25 11:36:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 251 transitions. [2023-12-25 11:36:26,729 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 251 transitions. Word has length 71 [2023-12-25 11:36:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:26,730 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 251 transitions. [2023-12-25 11:36:26,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-25 11:36:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 251 transitions. [2023-12-25 11:36:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 11:36:26,734 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:26,735 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:36:26,747 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 [2023-12-25 11:36:26,944 WARN L477 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 [2023-12-25 11:36:26,945 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:26,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:26,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1273036866, now seen corresponding path program 1 times [2023-12-25 11:36:26,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:26,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385074620] [2023-12-25 11:36:26,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:26,946 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 [2023-12-25 11:36:26,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:26,947 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) [2023-12-25 11:36:26,949 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 [2023-12-25 11:36:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:27,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 11:36:27,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:27,361 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-25 11:36:27,361 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:27,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:27,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385074620] [2023-12-25 11:36:27,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385074620] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:27,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:27,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 11:36:27,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816270324] [2023-12-25 11:36:27,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:27,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:36:27,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:27,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:36:27,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:36:27,368 INFO L87 Difference]: Start difference. First operand 162 states and 251 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-25 11:36:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:28,813 INFO L93 Difference]: Finished difference Result 323 states and 501 transitions. [2023-12-25 11:36:28,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:36:28,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2023-12-25 11:36:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:28,817 INFO L225 Difference]: With dead ends: 323 [2023-12-25 11:36:28,817 INFO L226 Difference]: Without dead ends: 165 [2023-12-25 11:36:28,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:36:28,821 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 3 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:28,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 483 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 11:36:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-25 11:36:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2023-12-25 11:36:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 100 states have (on average 1.44) internal successors, (144), 100 states have internal predecessors, (144), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-25 11:36:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 252 transitions. [2023-12-25 11:36:28,838 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 252 transitions. Word has length 71 [2023-12-25 11:36:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:28,839 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 252 transitions. [2023-12-25 11:36:28,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-25 11:36:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 252 transitions. [2023-12-25 11:36:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-25 11:36:28,842 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:28,842 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:36:28,851 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 [2023-12-25 11:36:29,050 WARN L477 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 [2023-12-25 11:36:29,051 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:29,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1410362118, now seen corresponding path program 1 times [2023-12-25 11:36:29,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:29,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709458064] [2023-12-25 11:36:29,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:29,054 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 [2023-12-25 11:36:29,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:29,057 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) [2023-12-25 11:36:29,058 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 [2023-12-25 11:36:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:29,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 11:36:29,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-25 11:36:29,436 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:29,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:29,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709458064] [2023-12-25 11:36:29,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709458064] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:29,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:29,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:36:29,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810359724] [2023-12-25 11:36:29,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:29,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:36:29,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:29,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:36:29,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:36:29,437 INFO L87 Difference]: Start difference. First operand 163 states and 252 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-25 11:36:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:29,671 INFO L93 Difference]: Finished difference Result 325 states and 504 transitions. [2023-12-25 11:36:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:36:29,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 74 [2023-12-25 11:36:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:29,674 INFO L225 Difference]: With dead ends: 325 [2023-12-25 11:36:29,674 INFO L226 Difference]: Without dead ends: 164 [2023-12-25 11:36:29,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:36:29,676 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:29,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 486 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 11:36:29,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-25 11:36:29,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2023-12-25 11:36:29,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 101 states have internal predecessors, (145), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-25 11:36:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2023-12-25 11:36:29,690 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 74 [2023-12-25 11:36:29,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:29,691 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2023-12-25 11:36:29,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-25 11:36:29,691 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2023-12-25 11:36:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 11:36:29,693 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:29,693 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:36:29,709 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 [2023-12-25 11:36:29,899 WARN L477 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 [2023-12-25 11:36:29,900 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:29,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:29,901 INFO L85 PathProgramCache]: Analyzing trace with hash 283034204, now seen corresponding path program 1 times [2023-12-25 11:36:29,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:29,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642481516] [2023-12-25 11:36:29,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:29,901 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 [2023-12-25 11:36:29,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:29,904 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) [2023-12-25 11:36:29,927 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 [2023-12-25 11:36:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:30,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 11:36:30,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-25 11:36:30,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:36:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-25 11:36:30,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:30,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642481516] [2023-12-25 11:36:30,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642481516] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:36:30,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:36:30,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 11:36:30,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013063484] [2023-12-25 11:36:30,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:36:30,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:36:30,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:30,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:36:30,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:36:30,550 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-25 11:36:31,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:31,536 INFO L93 Difference]: Finished difference Result 328 states and 508 transitions. [2023-12-25 11:36:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 11:36:31,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 75 [2023-12-25 11:36:31,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:31,538 INFO L225 Difference]: With dead ends: 328 [2023-12-25 11:36:31,538 INFO L226 Difference]: Without dead ends: 166 [2023-12-25 11:36:31,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:36:31,540 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 0 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:31,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1212 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 11:36:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-25 11:36:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-12-25 11:36:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 103 states have internal predecessors, (147), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-25 11:36:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 255 transitions. [2023-12-25 11:36:31,549 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 255 transitions. Word has length 75 [2023-12-25 11:36:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:31,549 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 255 transitions. [2023-12-25 11:36:31,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-25 11:36:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 255 transitions. [2023-12-25 11:36:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-25 11:36:31,551 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:31,551 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:36:31,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 11:36:31,757 WARN L477 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 [2023-12-25 11:36:31,758 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:31,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:31,759 INFO L85 PathProgramCache]: Analyzing trace with hash 799972892, now seen corresponding path program 2 times [2023-12-25 11:36:31,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:31,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039610597] [2023-12-25 11:36:31,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 11:36:31,759 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 [2023-12-25 11:36:31,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:31,760 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) [2023-12-25 11:36:31,762 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 [2023-12-25 11:36:32,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 11:36:32,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 11:36:32,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 11:36:32,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2023-12-25 11:36:32,074 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:32,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:32,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039610597] [2023-12-25 11:36:32,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039610597] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:32,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:32,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:36:32,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240282815] [2023-12-25 11:36:32,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:32,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:36:32,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:32,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:36:32,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:36:32,076 INFO L87 Difference]: Start difference. First operand 166 states and 255 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-25 11:36:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:32,239 INFO L93 Difference]: Finished difference Result 319 states and 492 transitions. [2023-12-25 11:36:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:36:32,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 77 [2023-12-25 11:36:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:32,241 INFO L225 Difference]: With dead ends: 319 [2023-12-25 11:36:32,241 INFO L226 Difference]: Without dead ends: 166 [2023-12-25 11:36:32,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:36:32,242 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:32,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 11:36:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-25 11:36:32,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-12-25 11:36:32,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 103 states have internal predecessors, (146), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-25 11:36:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 254 transitions. [2023-12-25 11:36:32,251 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 254 transitions. Word has length 77 [2023-12-25 11:36:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:32,251 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 254 transitions. [2023-12-25 11:36:32,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-25 11:36:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 254 transitions. [2023-12-25 11:36:32,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-25 11:36:32,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:32,252 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:36:32,260 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 [2023-12-25 11:36:32,458 WARN L477 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 [2023-12-25 11:36:32,458 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:32,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:32,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1413650761, now seen corresponding path program 1 times [2023-12-25 11:36:32,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:32,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005752175] [2023-12-25 11:36:32,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:32,459 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 [2023-12-25 11:36:32,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:32,460 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) [2023-12-25 11:36:32,462 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 [2023-12-25 11:36:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:32,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 11:36:32,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2023-12-25 11:36:32,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:36:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2023-12-25 11:36:33,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:33,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005752175] [2023-12-25 11:36:33,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005752175] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:36:33,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:36:33,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-12-25 11:36:33,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254960336] [2023-12-25 11:36:33,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:36:33,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:36:33,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:33,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:36:33,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:36:33,039 INFO L87 Difference]: Start difference. First operand 166 states and 254 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-25 11:36:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:35,411 INFO L93 Difference]: Finished difference Result 335 states and 512 transitions. [2023-12-25 11:36:35,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 11:36:35,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 96 [2023-12-25 11:36:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:35,413 INFO L225 Difference]: With dead ends: 335 [2023-12-25 11:36:35,413 INFO L226 Difference]: Without dead ends: 177 [2023-12-25 11:36:35,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:36:35,414 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 8 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:35,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 722 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-25 11:36:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-25 11:36:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2023-12-25 11:36:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 109 states have internal predecessors, (153), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-25 11:36:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 261 transitions. [2023-12-25 11:36:35,422 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 261 transitions. Word has length 96 [2023-12-25 11:36:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:35,422 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 261 transitions. [2023-12-25 11:36:35,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-25 11:36:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 261 transitions. [2023-12-25 11:36:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-25 11:36:35,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:35,424 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:36:35,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 11:36:35,634 WARN L477 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 [2023-12-25 11:36:35,634 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:35,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:35,635 INFO L85 PathProgramCache]: Analyzing trace with hash 853759735, now seen corresponding path program 1 times [2023-12-25 11:36:35,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:35,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364832900] [2023-12-25 11:36:35,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:35,635 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 [2023-12-25 11:36:35,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:35,636 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) [2023-12-25 11:36:35,637 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 [2023-12-25 11:36:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:36,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 11:36:36,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2023-12-25 11:36:36,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:36,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:36,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364832900] [2023-12-25 11:36:36,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364832900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:36,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:36,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 11:36:36,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189731766] [2023-12-25 11:36:36,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:36,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 11:36:36,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:36,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 11:36:36,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:36:36,845 INFO L87 Difference]: Start difference. First operand 172 states and 261 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-25 11:36:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:40,099 INFO L93 Difference]: Finished difference Result 375 states and 597 transitions. [2023-12-25 11:36:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 11:36:40,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 101 [2023-12-25 11:36:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:40,103 INFO L225 Difference]: With dead ends: 375 [2023-12-25 11:36:40,103 INFO L226 Difference]: Without dead ends: 349 [2023-12-25 11:36:40,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 11:36:40,104 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 307 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:40,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 755 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-25 11:36:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-12-25 11:36:40,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2023-12-25 11:36:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 215 states have (on average 1.4511627906976745) internal successors, (312), 215 states have internal predecessors, (312), 114 states have call successors, (114), 16 states have call predecessors, (114), 19 states have return successors, (133), 117 states have call predecessors, (133), 114 states have call successors, (133) [2023-12-25 11:36:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 559 transitions. [2023-12-25 11:36:40,137 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 559 transitions. Word has length 101 [2023-12-25 11:36:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:40,137 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 559 transitions. [2023-12-25 11:36:40,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-25 11:36:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 559 transitions. [2023-12-25 11:36:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-25 11:36:40,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:40,140 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:36:40,151 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 (8)] Forceful destruction successful, exit code 0 [2023-12-25 11:36:40,351 WARN L477 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 [2023-12-25 11:36:40,351 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:40,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:40,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1547131058, now seen corresponding path program 1 times [2023-12-25 11:36:40,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:40,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278202484] [2023-12-25 11:36:40,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:40,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:36:40,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:40,353 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) [2023-12-25 11:36:40,354 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 [2023-12-25 11:36:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:40,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:36:40,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:40,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-25 11:36:40,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-25 11:36:40,911 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 5 treesize of output 3 [2023-12-25 11:36:40,921 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 5 treesize of output 3 [2023-12-25 11:36:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-25 11:36:41,083 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:41,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:41,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278202484] [2023-12-25 11:36:41,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278202484] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:41,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:41,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 11:36:41,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240906228] [2023-12-25 11:36:41,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:41,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 11:36:41,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:41,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 11:36:41,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 11:36:41,084 INFO L87 Difference]: Start difference. First operand 349 states and 559 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2023-12-25 11:36:45,211 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 [] [2023-12-25 11:36:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:47,980 INFO L93 Difference]: Finished difference Result 1025 states and 1668 transitions. [2023-12-25 11:36:47,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 11:36:47,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 163 [2023-12-25 11:36:47,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:47,984 INFO L225 Difference]: With dead ends: 1025 [2023-12-25 11:36:47,984 INFO L226 Difference]: Without dead ends: 693 [2023-12-25 11:36:47,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:36:47,986 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 293 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:47,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 641 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 145 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2023-12-25 11:36:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2023-12-25 11:36:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 353. [2023-12-25 11:36:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 217 states have (on average 1.4470046082949308) internal successors, (314), 219 states have internal predecessors, (314), 114 states have call successors, (114), 16 states have call predecessors, (114), 21 states have return successors, (138), 117 states have call predecessors, (138), 114 states have call successors, (138) [2023-12-25 11:36:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 566 transitions. [2023-12-25 11:36:48,028 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 566 transitions. Word has length 163 [2023-12-25 11:36:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:48,028 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 566 transitions. [2023-12-25 11:36:48,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2023-12-25 11:36:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 566 transitions. [2023-12-25 11:36:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-25 11:36:48,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:48,032 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:36:48,044 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 [2023-12-25 11:36:48,242 WARN L477 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 [2023-12-25 11:36:48,243 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:48,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:48,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1748051852, now seen corresponding path program 1 times [2023-12-25 11:36:48,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:48,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71416685] [2023-12-25 11:36:48,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:48,244 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 [2023-12-25 11:36:48,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:48,245 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) [2023-12-25 11:36:48,246 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 [2023-12-25 11:36:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:49,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:36:49,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:49,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-25 11:36:49,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 10 treesize of output 4 [2023-12-25 11:36:49,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 9 [2023-12-25 11:36:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-25 11:36:49,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:49,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:49,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71416685] [2023-12-25 11:36:49,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71416685] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:49,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:49,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 11:36:49,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070791373] [2023-12-25 11:36:49,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:49,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 11:36:49,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:49,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 11:36:49,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:36:49,910 INFO L87 Difference]: Start difference. First operand 353 states and 566 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2023-12-25 11:36:54,059 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 [] [2023-12-25 11:36:58,065 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 [] [2023-12-25 11:37:02,080 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 [] [2023-12-25 11:37:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:37:07,781 INFO L93 Difference]: Finished difference Result 1071 states and 1748 transitions. [2023-12-25 11:37:07,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 11:37:07,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 162 [2023-12-25 11:37:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:37:07,786 INFO L225 Difference]: With dead ends: 1071 [2023-12-25 11:37:07,786 INFO L226 Difference]: Without dead ends: 739 [2023-12-25 11:37:07,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 11:37:07,787 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 328 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 218 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2023-12-25 11:37:07,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 580 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 384 Invalid, 3 Unknown, 0 Unchecked, 17.6s Time] [2023-12-25 11:37:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2023-12-25 11:37:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 731. [2023-12-25 11:37:07,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 440 states have (on average 1.4431818181818181) internal successors, (635), 445 states have internal predecessors, (635), 246 states have call successors, (246), 32 states have call predecessors, (246), 44 states have return successors, (309), 253 states have call predecessors, (309), 246 states have call successors, (309) [2023-12-25 11:37:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1190 transitions. [2023-12-25 11:37:07,845 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1190 transitions. Word has length 162 [2023-12-25 11:37:07,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:37:07,847 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1190 transitions. [2023-12-25 11:37:07,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2023-12-25 11:37:07,847 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1190 transitions. [2023-12-25 11:37:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-25 11:37:07,850 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:37:07,850 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:37:07,868 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 [2023-12-25 11:37:08,060 WARN L477 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 [2023-12-25 11:37:08,060 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:37:08,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:37:08,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1264804106, now seen corresponding path program 1 times [2023-12-25 11:37:08,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:37:08,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137443661] [2023-12-25 11:37:08,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:37:08,062 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 [2023-12-25 11:37:08,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:37:08,067 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) [2023-12-25 11:37:08,105 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 [2023-12-25 11:37:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:37:09,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:37:09,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:37:09,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-25 11:37:09,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 10 treesize of output 4 [2023-12-25 11:37:10,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 9 [2023-12-25 11:37:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-25 11:37:10,066 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:37:10,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:37:10,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137443661] [2023-12-25 11:37:10,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137443661] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:37:10,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:37:10,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 11:37:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024033050] [2023-12-25 11:37:10,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:37:10,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 11:37:10,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:37:10,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 11:37:10,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:37:10,067 INFO L87 Difference]: Start difference. First operand 731 states and 1190 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2023-12-25 11:37:14,238 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 [] [2023-12-25 11:37:18,243 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 [] [2023-12-25 11:37:22,251 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 [] [2023-12-25 11:37:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:37:26,888 INFO L93 Difference]: Finished difference Result 1333 states and 2144 transitions. [2023-12-25 11:37:26,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 11:37:26,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 162 [2023-12-25 11:37:26,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:37:26,892 INFO L225 Difference]: With dead ends: 1333 [2023-12-25 11:37:26,892 INFO L226 Difference]: Without dead ends: 541 [2023-12-25 11:37:26,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 11:37:26,895 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 313 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 206 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2023-12-25 11:37:26,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 658 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 403 Invalid, 3 Unknown, 0 Unchecked, 16.6s Time] [2023-12-25 11:37:26,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2023-12-25 11:37:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 532. [2023-12-25 11:37:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 327 states have (on average 1.4128440366972477) internal successors, (462), 328 states have internal predecessors, (462), 171 states have call successors, (171), 25 states have call predecessors, (171), 33 states have return successors, (212), 178 states have call predecessors, (212), 171 states have call successors, (212) [2023-12-25 11:37:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 845 transitions. [2023-12-25 11:37:26,928 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 845 transitions. Word has length 162 [2023-12-25 11:37:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:37:26,928 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 845 transitions. [2023-12-25 11:37:26,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2023-12-25 11:37:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 845 transitions. [2023-12-25 11:37:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-12-25 11:37:26,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:37:26,932 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 8, 8, 6, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:37:26,949 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 [2023-12-25 11:37:27,145 WARN L477 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 [2023-12-25 11:37:27,145 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:37:27,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:37:27,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1204776282, now seen corresponding path program 1 times [2023-12-25 11:37:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:37:27,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143330810] [2023-12-25 11:37:27,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:37:27,147 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 [2023-12-25 11:37:27,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:37:27,148 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) [2023-12-25 11:37:27,148 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 [2023-12-25 11:37:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:37:27,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 11:37:27,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:37:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 320 proven. 4 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2023-12-25 11:37:28,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:37:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2023-12-25 11:37:29,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:37:29,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143330810] [2023-12-25 11:37:29,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143330810] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:37:29,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:37:29,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2023-12-25 11:37:29,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998767220] [2023-12-25 11:37:29,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:37:29,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 11:37:29,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:37:29,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 11:37:29,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:37:29,291 INFO L87 Difference]: Start difference. First operand 532 states and 845 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 7 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 5 states have call predecessors, (44), 7 states have call successors, (44) [2023-12-25 11:37:33,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:37,472 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 [] [2023-12-25 11:37:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:37:44,134 INFO L93 Difference]: Finished difference Result 1246 states and 2007 transitions. [2023-12-25 11:37:44,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:37:44,135 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 7 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 5 states have call predecessors, (44), 7 states have call successors, (44) Word has length 197 [2023-12-25 11:37:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:37:44,144 INFO L225 Difference]: With dead ends: 1246 [2023-12-25 11:37:44,144 INFO L226 Difference]: Without dead ends: 750 [2023-12-25 11:37:44,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-25 11:37:44,147 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 346 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 224 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2023-12-25 11:37:44,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 874 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 798 Invalid, 2 Unknown, 0 Unchecked, 14.6s Time] [2023-12-25 11:37:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2023-12-25 11:37:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 738. [2023-12-25 11:37:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 448 states have (on average 1.4196428571428572) internal successors, (636), 450 states have internal predecessors, (636), 239 states have call successors, (239), 43 states have call predecessors, (239), 50 states have return successors, (292), 244 states have call predecessors, (292), 239 states have call successors, (292) [2023-12-25 11:37:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1167 transitions. [2023-12-25 11:37:44,193 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1167 transitions. Word has length 197 [2023-12-25 11:37:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:37:44,194 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1167 transitions. [2023-12-25 11:37:44,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 7 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 5 states have call predecessors, (44), 7 states have call successors, (44) [2023-12-25 11:37:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1167 transitions. [2023-12-25 11:37:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-12-25 11:37:44,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:37:44,198 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 8, 8, 6, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:37:44,224 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 [2023-12-25 11:37:44,422 WARN L477 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 [2023-12-25 11:37:44,423 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:37:44,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:37:44,423 INFO L85 PathProgramCache]: Analyzing trace with hash -911884828, now seen corresponding path program 1 times [2023-12-25 11:37:44,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:37:44,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685847040] [2023-12-25 11:37:44,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:37:44,424 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 [2023-12-25 11:37:44,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:37:44,425 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) [2023-12-25 11:37:44,426 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 [2023-12-25 11:37:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:37:45,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 11:37:45,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:37:46,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-25 11:37:47,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2023-12-25 11:37:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2023-12-25 11:37:47,619 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:37:47,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:37:47,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685847040] [2023-12-25 11:37:47,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685847040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:37:47,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:37:47,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 11:37:47,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937845475] [2023-12-25 11:37:47,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:37:47,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 11:37:47,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:37:47,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 11:37:47,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-25 11:37:47,621 INFO L87 Difference]: Start difference. First operand 738 states and 1167 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 7 states have call successors, (26), 4 states have call predecessors, (26), 6 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2023-12-25 11:37:51,941 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 [] [2023-12-25 11:37:55,957 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 [] [2023-12-25 11:37:59,969 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 [] [2023-12-25 11:38:03,974 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 [] [2023-12-25 11:38:07,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:12,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:16,027 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 [] [2023-12-25 11:38:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:38:31,719 INFO L93 Difference]: Finished difference Result 1158 states and 1856 transitions. [2023-12-25 11:38:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 11:38:31,719 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 7 states have call successors, (26), 4 states have call predecessors, (26), 6 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) Word has length 197 [2023-12-25 11:38:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:38:31,724 INFO L225 Difference]: With dead ends: 1158 [2023-12-25 11:38:31,724 INFO L226 Difference]: Without dead ends: 1119 [2023-12-25 11:38:31,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2023-12-25 11:38:31,725 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 687 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 608 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:38:31,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 1668 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 1719 Invalid, 7 Unknown, 0 Unchecked, 43.3s Time] [2023-12-25 11:38:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2023-12-25 11:38:31,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1108. [2023-12-25 11:38:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 666 states have (on average 1.4159159159159158) internal successors, (943), 673 states have internal predecessors, (943), 367 states have call successors, (367), 59 states have call predecessors, (367), 74 states have return successors, (464), 375 states have call predecessors, (464), 367 states have call successors, (464) [2023-12-25 11:38:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1774 transitions. [2023-12-25 11:38:31,817 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1774 transitions. Word has length 197 [2023-12-25 11:38:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:38:31,818 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1774 transitions. [2023-12-25 11:38:31,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 7 states have call successors, (26), 4 states have call predecessors, (26), 6 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2023-12-25 11:38:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1774 transitions. [2023-12-25 11:38:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-12-25 11:38:31,824 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:38:31,824 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 10, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:38:31,840 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 [2023-12-25 11:38:32,038 WARN L477 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 [2023-12-25 11:38:32,038 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:38:32,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:38:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash 962775954, now seen corresponding path program 1 times [2023-12-25 11:38:32,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:38:32,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333891042] [2023-12-25 11:38:32,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:38:32,039 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 [2023-12-25 11:38:32,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:38:32,040 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) [2023-12-25 11:38:32,041 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 [2023-12-25 11:38:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:38:33,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 11:38:33,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:38:34,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-25 11:38:34,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2023-12-25 11:38:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 476 proven. 19 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2023-12-25 11:38:34,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:38:35,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 19 [2023-12-25 11:38:35,357 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 25 treesize of output 21 [2023-12-25 11:38:35,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 19 [2023-12-25 11:38:35,808 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 25 treesize of output 21 [2023-12-25 11:38:35,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 19 [2023-12-25 11:38:35,993 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 25 treesize of output 21 [2023-12-25 11:38:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 974 trivial. 0 not checked. [2023-12-25 11:38:36,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:38:36,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333891042] [2023-12-25 11:38:36,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333891042] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:38:36,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:38:36,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-25 11:38:36,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808182977] [2023-12-25 11:38:36,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:38:36,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 11:38:36,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:38:36,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 11:38:36,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-12-25 11:38:36,387 INFO L87 Difference]: Start difference. First operand 1108 states and 1774 transitions. Second operand has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 10 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 10 states have call predecessors, (58), 10 states have call successors, (58) [2023-12-25 11:38:38,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:41,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:46,867 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 [] [2023-12-25 11:38:50,874 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 [] [2023-12-25 11:38:54,887 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 [] [2023-12-25 11:38:58,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:02,920 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 [] [2023-12-25 11:39:06,932 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 [] [2023-12-25 11:39:10,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:14,959 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 [] [2023-12-25 11:39:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:39:24,849 INFO L93 Difference]: Finished difference Result 1858 states and 2951 transitions. [2023-12-25 11:39:24,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 11:39:24,850 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 10 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 10 states have call predecessors, (58), 10 states have call successors, (58) Word has length 226 [2023-12-25 11:39:24,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:39:24,855 INFO L225 Difference]: With dead ends: 1858 [2023-12-25 11:39:24,855 INFO L226 Difference]: Without dead ends: 1115 [2023-12-25 11:39:24,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 441 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2023-12-25 11:39:24,858 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 676 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 600 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.7s IncrementalHoareTripleChecker+Time [2023-12-25 11:39:24,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 963 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [600 Valid, 947 Invalid, 8 Unknown, 0 Unchecked, 47.7s Time] [2023-12-25 11:39:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2023-12-25 11:39:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1108. [2023-12-25 11:39:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 666 states have (on average 1.4114114114114114) internal successors, (940), 673 states have internal predecessors, (940), 367 states have call successors, (367), 59 states have call predecessors, (367), 74 states have return successors, (464), 375 states have call predecessors, (464), 367 states have call successors, (464) [2023-12-25 11:39:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1771 transitions. [2023-12-25 11:39:24,981 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1771 transitions. Word has length 226 [2023-12-25 11:39:24,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:39:24,981 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1771 transitions. [2023-12-25 11:39:24,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 10 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 10 states have call predecessors, (58), 10 states have call successors, (58) [2023-12-25 11:39:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1771 transitions. [2023-12-25 11:39:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-25 11:39:24,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:39:24,988 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 11, 11, 11, 11, 6, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:39:25,006 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 (14)] Forceful destruction successful, exit code 0 [2023-12-25 11:39:25,196 WARN L477 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 [2023-12-25 11:39:25,196 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:39:25,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:39:25,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1818377705, now seen corresponding path program 1 times [2023-12-25 11:39:25,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:39:25,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143844293] [2023-12-25 11:39:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:39:25,198 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 [2023-12-25 11:39:25,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:39:25,199 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) [2023-12-25 11:39:25,200 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 [2023-12-25 11:39:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:39:26,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 11:39:26,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:39:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 543 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2023-12-25 11:39:27,715 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:39:27,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:39:27,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143844293] [2023-12-25 11:39:27,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143844293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:39:27,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:39:27,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 11:39:27,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668759797] [2023-12-25 11:39:27,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:39:27,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 11:39:27,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:39:27,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 11:39:27,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:39:27,717 INFO L87 Difference]: Start difference. First operand 1108 states and 1771 transitions. Second operand has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (32), 5 states have call predecessors, (32), 4 states have call successors, (32) [2023-12-25 11:39:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:39:32,918 INFO L93 Difference]: Finished difference Result 2751 states and 4394 transitions. [2023-12-25 11:39:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 11:39:32,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (32), 5 states have call predecessors, (32), 4 states have call successors, (32) Word has length 244 [2023-12-25 11:39:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:39:32,934 INFO L225 Difference]: With dead ends: 2751 [2023-12-25 11:39:32,935 INFO L226 Difference]: Without dead ends: 1686 [2023-12-25 11:39:32,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-25 11:39:32,941 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 476 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-25 11:39:32,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 420 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-25 11:39:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2023-12-25 11:39:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1587. [2023-12-25 11:39:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 978 states have (on average 1.2770961145194275) internal successors, (1249), 961 states have internal predecessors, (1249), 482 states have call successors, (482), 81 states have call predecessors, (482), 126 states have return successors, (704), 544 states have call predecessors, (704), 482 states have call successors, (704) [2023-12-25 11:39:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2435 transitions. [2023-12-25 11:39:33,095 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2435 transitions. Word has length 244 [2023-12-25 11:39:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:39:33,095 INFO L495 AbstractCegarLoop]: Abstraction has 1587 states and 2435 transitions. [2023-12-25 11:39:33,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (32), 5 states have call predecessors, (32), 4 states have call successors, (32) [2023-12-25 11:39:33,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2435 transitions. [2023-12-25 11:39:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-25 11:39:33,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:39:33,102 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 11, 11, 11, 11, 6, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:39:33,116 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 (15)] Forceful destruction successful, exit code 0 [2023-12-25 11:39:33,315 WARN L477 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 [2023-12-25 11:39:33,315 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:39:33,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:39:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2042083993, now seen corresponding path program 1 times [2023-12-25 11:39:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:39:33,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353641161] [2023-12-25 11:39:33,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:39:33,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:39:33,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:39:33,318 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) [2023-12-25 11:39:33,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 11:39:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:39:34,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 11:39:34,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:39:34,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-25 11:39:35,074 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 5 treesize of output 3 [2023-12-25 11:39:35,196 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 11 treesize of output 7 [2023-12-25 11:39:35,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 552 proven. 15 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2023-12-25 11:39:35,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:39:35,423 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 12 treesize of output 8 [2023-12-25 11:39:35,867 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 26 treesize of output 24 [2023-12-25 11:39:36,310 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 26 treesize of output 24 [2023-12-25 11:39:36,622 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 26 treesize of output 24 [2023-12-25 11:39:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2023-12-25 11:39:37,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:39:37,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353641161] [2023-12-25 11:39:37,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353641161] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:39:37,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:39:37,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-12-25 11:39:37,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881769721] [2023-12-25 11:39:37,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:39:37,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 11:39:37,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:39:37,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 11:39:37,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-25 11:39:37,293 INFO L87 Difference]: Start difference. First operand 1587 states and 2435 transitions. Second operand has 16 states, 16 states have (on average 7.5625) internal successors, (121), 15 states have internal predecessors, (121), 11 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 11 states have call successors, (60) [2023-12-25 11:39:41,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:45,724 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 [] [2023-12-25 11:39:49,735 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 [] [2023-12-25 11:39:53,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:57,765 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 [] [2023-12-25 11:40:01,785 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 [] [2023-12-25 11:40:05,797 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 [] [2023-12-25 11:40:09,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:11,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:15,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:40:30,111 INFO L93 Difference]: Finished difference Result 3413 states and 5102 transitions. [2023-12-25 11:40:30,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 11:40:30,112 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 15 states have internal predecessors, (121), 11 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 11 states have call successors, (60) Word has length 244 [2023-12-25 11:40:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:40:30,118 INFO L225 Difference]: With dead ends: 3413 [2023-12-25 11:40:30,119 INFO L226 Difference]: Without dead ends: 1941 [2023-12-25 11:40:30,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 483 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=364, Invalid=1358, Unknown=0, NotChecked=0, Total=1722 [2023-12-25 11:40:30,123 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 941 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 747 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:40:30,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 1655 Invalid, 2905 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [747 Valid, 2150 Invalid, 8 Unknown, 0 Unchecked, 50.3s Time] [2023-12-25 11:40:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2023-12-25 11:40:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1884. [2023-12-25 11:40:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1162 states have (on average 1.2538726333907058) internal successors, (1457), 1142 states have internal predecessors, (1457), 563 states have call successors, (563), 112 states have call predecessors, (563), 158 states have return successors, (775), 629 states have call predecessors, (775), 563 states have call successors, (775) [2023-12-25 11:40:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2795 transitions. [2023-12-25 11:40:30,310 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2795 transitions. Word has length 244 [2023-12-25 11:40:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:40:30,311 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 2795 transitions. [2023-12-25 11:40:30,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 15 states have internal predecessors, (121), 11 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 11 states have call successors, (60) [2023-12-25 11:40:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2795 transitions. [2023-12-25 11:40:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-25 11:40:30,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:40:30,317 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 11, 11, 11, 11, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:40:30,335 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 (16)] Forceful destruction successful, exit code 0 [2023-12-25 11:40:30,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 [2023-12-25 11:40:30,536 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:40:30,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:40:30,537 INFO L85 PathProgramCache]: Analyzing trace with hash 196389169, now seen corresponding path program 1 times [2023-12-25 11:40:30,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:40:30,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618149657] [2023-12-25 11:40:30,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:40:30,538 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 [2023-12-25 11:40:30,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:40:30,539 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2023-12-25 11:40:30,541 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 (17)] Waiting until timeout for monitored process [2023-12-25 11:40:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:40:31,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 11:40:31,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:40:31,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-25 11:40:32,372 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 5 treesize of output 3 [2023-12-25 11:40:32,493 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 11 treesize of output 7 [2023-12-25 11:40:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 553 proven. 12 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2023-12-25 11:40:32,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:40:32,686 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 12 treesize of output 8 [2023-12-25 11:40:33,086 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 26 treesize of output 24 [2023-12-25 11:40:33,493 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 26 treesize of output 24 [2023-12-25 11:40:33,768 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 26 treesize of output 24 [2023-12-25 11:40:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2023-12-25 11:40:34,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:40:34,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618149657] [2023-12-25 11:40:34,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618149657] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:40:34,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:40:34,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-12-25 11:40:34,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254872650] [2023-12-25 11:40:34,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:40:34,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 11:40:34,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:40:34,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 11:40:34,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-25 11:40:34,377 INFO L87 Difference]: Start difference. First operand 1884 states and 2795 transitions. Second operand has 16 states, 16 states have (on average 7.5625) internal successors, (121), 15 states have internal predecessors, (121), 11 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 11 states have call successors, (60) [2023-12-25 11:40:38,818 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 [] [2023-12-25 11:40:42,841 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 [] [2023-12-25 11:40:46,853 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 [] [2023-12-25 11:40:50,860 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 [] [2023-12-25 11:40:54,867 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 [] [2023-12-25 11:40:58,882 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 [] [2023-12-25 11:41:02,888 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 [] [2023-12-25 11:41:06,897 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 [] [2023-12-25 11:41:10,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:11,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:13,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:41:35,850 INFO L93 Difference]: Finished difference Result 2801 states and 4097 transitions. [2023-12-25 11:41:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-25 11:41:35,857 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 15 states have internal predecessors, (121), 11 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 11 states have call successors, (60) Word has length 245 [2023-12-25 11:41:35,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:41:35,868 INFO L225 Difference]: With dead ends: 2801 [2023-12-25 11:41:35,868 INFO L226 Difference]: Without dead ends: 1956 [2023-12-25 11:41:35,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 482 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 11:41:35,872 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 916 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 748 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 3382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 748 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.0s IncrementalHoareTripleChecker+Time [2023-12-25 11:41:35,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 2118 Invalid, 3382 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [748 Valid, 2626 Invalid, 8 Unknown, 0 Unchecked, 59.0s Time] [2023-12-25 11:41:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2023-12-25 11:41:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1879. [2023-12-25 11:41:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1157 states have (on average 1.2489196197061365) internal successors, (1445), 1143 states have internal predecessors, (1445), 560 states have call successors, (560), 112 states have call predecessors, (560), 161 states have return successors, (775), 623 states have call predecessors, (775), 560 states have call successors, (775) [2023-12-25 11:41:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2780 transitions. [2023-12-25 11:41:36,208 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2780 transitions. Word has length 245 [2023-12-25 11:41:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:41:36,208 INFO L495 AbstractCegarLoop]: Abstraction has 1879 states and 2780 transitions. [2023-12-25 11:41:36,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 15 states have internal predecessors, (121), 11 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 11 states have call successors, (60) [2023-12-25 11:41:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2780 transitions. [2023-12-25 11:41:36,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-25 11:41:36,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:41:36,218 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 11, 11, 11, 11, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:41:36,247 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 (17)] Forceful destruction successful, exit code 0 [2023-12-25 11:41:36,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 [2023-12-25 11:41:36,441 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:41:36,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:41:36,441 INFO L85 PathProgramCache]: Analyzing trace with hash 303198891, now seen corresponding path program 1 times [2023-12-25 11:41:36,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:41:36,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824209656] [2023-12-25 11:41:36,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:41:36,443 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 [2023-12-25 11:41:36,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:41:36,453 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2023-12-25 11:41:36,472 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 (18)] Waiting until timeout for monitored process [2023-12-25 11:41:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:41:39,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 11:41:39,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:41:39,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-25 11:41:39,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 10 treesize of output 4 [2023-12-25 11:41:40,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-25 11:41:40,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-12-25 11:41:40,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:41:40,666 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 21 treesize of output 9 [2023-12-25 11:41:40,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:41:40,925 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 31 treesize of output 13 [2023-12-25 11:41:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 553 proven. 12 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2023-12-25 11:41:41,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:41:43,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 18 [2023-12-25 11:41:43,106 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 31 treesize of output 27 [2023-12-25 11:41:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1094 trivial. 0 not checked. [2023-12-25 11:41:43,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:41:43,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824209656] [2023-12-25 11:41:43,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824209656] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:41:43,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:41:43,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-25 11:41:43,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833338692] [2023-12-25 11:41:43,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:41:43,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 11:41:43,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:41:43,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 11:41:43,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-12-25 11:41:43,927 INFO L87 Difference]: Start difference. First operand 1879 states and 2780 transitions. Second operand has 16 states, 16 states have (on average 8.8125) internal successors, (141), 16 states have internal predecessors, (141), 13 states have call successors, (61), 7 states have call predecessors, (61), 7 states have return successors, (61), 11 states have call predecessors, (61), 13 states have call successors, (61) [2023-12-25 11:41:48,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:52,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:56,464 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 [] [2023-12-25 11:42:00,474 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 [] [2023-12-25 11:42:04,483 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 [] [2023-12-25 11:42:08,491 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 [] [2023-12-25 11:42:12,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:15,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:18,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:24,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:35,231 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 [] [2023-12-25 11:42:37,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:39,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:43,397 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 [] [2023-12-25 11:42:47,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:51,909 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 [] [2023-12-25 11:42:56,252 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 [] [2023-12-25 11:43:00,351 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 [] [2023-12-25 11:43:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:43:00,895 INFO L93 Difference]: Finished difference Result 2466 states and 3552 transitions. [2023-12-25 11:43:00,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 11:43:00,896 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.8125) internal successors, (141), 16 states have internal predecessors, (141), 13 states have call successors, (61), 7 states have call predecessors, (61), 7 states have return successors, (61), 11 states have call predecessors, (61), 13 states have call successors, (61) Word has length 245 [2023-12-25 11:43:00,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:43:00,902 INFO L225 Difference]: With dead ends: 2466 [2023-12-25 11:43:00,902 INFO L226 Difference]: Without dead ends: 1551 [2023-12-25 11:43:00,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2023-12-25 11:43:00,905 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 611 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 499 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.9s IncrementalHoareTripleChecker+Time [2023-12-25 11:43:00,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1262 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 1219 Invalid, 12 Unknown, 0 Unchecked, 75.9s Time] [2023-12-25 11:43:00,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2023-12-25 11:43:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1538. [2023-12-25 11:43:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 957 states have (on average 1.2497387669801463) internal successors, (1196), 947 states have internal predecessors, (1196), 440 states have call successors, (440), 99 states have call predecessors, (440), 140 states have return successors, (604), 491 states have call predecessors, (604), 440 states have call successors, (604) [2023-12-25 11:43:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2240 transitions. [2023-12-25 11:43:01,090 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2240 transitions. Word has length 245 [2023-12-25 11:43:01,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:43:01,092 INFO L495 AbstractCegarLoop]: Abstraction has 1538 states and 2240 transitions. [2023-12-25 11:43:01,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.8125) internal successors, (141), 16 states have internal predecessors, (141), 13 states have call successors, (61), 7 states have call predecessors, (61), 7 states have return successors, (61), 11 states have call predecessors, (61), 13 states have call successors, (61) [2023-12-25 11:43:01,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2240 transitions. [2023-12-25 11:43:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-12-25 11:43:01,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:43:01,097 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 10, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:43:01,127 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 (18)] Forceful destruction successful, exit code 0 [2023-12-25 11:43:01,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 [2023-12-25 11:43:01,313 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:43:01,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:43:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash 186643452, now seen corresponding path program 1 times [2023-12-25 11:43:01,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:43:01,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9236330] [2023-12-25 11:43:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:43:01,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:43:01,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:43:01,315 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2023-12-25 11:43:01,316 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 (19)] Waiting until timeout for monitored process [2023-12-25 11:43:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:43:03,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-25 11:43:03,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:43:04,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-12-25 11:43:04,180 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 24 treesize of output 19 [2023-12-25 11:43:04,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2023-12-25 11:43:07,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2023-12-25 11:43:10,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-12-25 11:43:13,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-12-25 11:43:14,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 30 [2023-12-25 11:43:14,816 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 49 treesize of output 41 [2023-12-25 11:43:16,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2023-12-25 11:43:16,898 INFO L349 Elim1Store]: treesize reduction 36, result has 44.6 percent of original size [2023-12-25 11:43:16,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 89 [2023-12-25 11:43:21,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2023-12-25 11:43:21,909 INFO L349 Elim1Store]: treesize reduction 93, result has 16.2 percent of original size [2023-12-25 11:43:21,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 80 [2023-12-25 11:43:32,814 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-25 11:43:32,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 48 [2023-12-25 11:43:32,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13 [2023-12-25 11:43:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 549 proven. 194 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-25 11:43:33,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:43:37,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:43:37,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9236330] [2023-12-25 11:43:37,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9236330] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 11:43:37,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [742454191] [2023-12-25 11:43:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:43:37,101 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 11:43:37,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 11:43:37,137 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 11:43:37,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-25 11:43:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:43:39,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 83 conjunts are in the unsatisfiable core [2023-12-25 11:43:39,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:43:40,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-12-25 11:43:40,181 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 24 treesize of output 19 [2023-12-25 11:43:40,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2023-12-25 11:43:49,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-25 11:43:52,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2023-12-25 11:43:53,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2023-12-25 11:43:57,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-12-25 11:43:59,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-12-25 11:44:03,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 30 [2023-12-25 11:44:03,705 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 49 treesize of output 41 [2023-12-25 11:44:06,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-12-25 11:44:15,220 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2023-12-25 11:44:15,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2023-12-25 11:44:25,382 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-25 11:44:25,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 48 [2023-12-25 11:44:25,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13 [2023-12-25 11:44:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 296 proven. 534 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-12-25 11:44:25,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:44:32,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [742454191] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 11:44:32,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:44:32,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 48] total 63 [2023-12-25 11:44:32,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957764567] [2023-12-25 11:44:32,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:44:32,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-12-25 11:44:32,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:44:32,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-12-25 11:44:32,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=4196, Unknown=2, NotChecked=0, Total=4556 [2023-12-25 11:44:32,716 INFO L87 Difference]: Start difference. First operand 1538 states and 2240 transitions. Second operand has 63 states, 56 states have (on average 2.8035714285714284) internal successors, (157), 55 states have internal predecessors, (157), 29 states have call successors, (52), 18 states have call predecessors, (52), 24 states have return successors, (54), 27 states have call predecessors, (54), 29 states have call successors, (54) [2023-12-25 11:44:35,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:44:41,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:44:44,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:44:51,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:44:57,868 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] [2023-12-25 11:45:01,876 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] [2023-12-25 11:45:05,886 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] [2023-12-25 11:45:09,894 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] [2023-12-25 11:45:13,903 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] [2023-12-25 11:45:17,909 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] [2023-12-25 11:45:21,916 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] [2023-12-25 11:45:25,927 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] [2023-12-25 11:45:29,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:45:33,956 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] [2023-12-25 11:45:37,969 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] [2023-12-25 11:45:41,977 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] [2023-12-25 11:45:45,983 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] [2023-12-25 11:45:50,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:45:54,020 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] [2023-12-25 11:45:58,033 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] [2023-12-25 11:46:02,045 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] [2023-12-25 11:46:06,053 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] [2023-12-25 11:46:10,057 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] [2023-12-25 11:46:14,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:46:18,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:46:22,130 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] [2023-12-25 11:46:26,137 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] [2023-12-25 11:46:30,144 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] [2023-12-25 11:46:34,153 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] [2023-12-25 11:46:38,162 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] [2023-12-25 11:46:42,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:46:46,192 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] [2023-12-25 11:46:50,204 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] [2023-12-25 11:46:54,213 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] [2023-12-25 11:46:58,221 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] [2023-12-25 11:47:02,229 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] [2023-12-25 11:47:06,236 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] [2023-12-25 11:47:10,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:47:14,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:47:18,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:47:22,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:47:26,344 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] [2023-12-25 11:47:30,353 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] [2023-12-25 11:47:34,365 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] [2023-12-25 11:47:38,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:47:42,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:47:46,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:47:50,445 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] [2023-12-25 11:47:54,460 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] [2023-12-25 11:47:58,470 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] [2023-12-25 11:48:02,477 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] [2023-12-25 11:48:06,489 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] [2023-12-25 11:48:10,499 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] [2023-12-25 11:48:14,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:48:18,531 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] [2023-12-25 11:48:22,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:48:26,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:48:30,623 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] [2023-12-25 11:48:34,630 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] [2023-12-25 11:48:38,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:48:52,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:03,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:06,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:08,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:16,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:18,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:19,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:21,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:25,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:27,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:29,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:30,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:32,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:33,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:36,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:39,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:40,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:42,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:46,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:51,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:56,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:50:10,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:50:25,798 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] [2023-12-25 11:50:30,158 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] [2023-12-25 11:50:42,465 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] Received shutdown request... [2023-12-25 11:50:43,464 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 11:50:43,464 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 11:50:43,464 WARN L340 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 (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 11:50:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-25 11:50:43,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 480 SyntacticMatches, 40 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5191 ImplicationChecksByTransitivity, 82.9s TimeCoverageRelationStatistics Valid=1555, Invalid=10433, Unknown=2, NotChecked=0, Total=11990 [2023-12-25 11:50:43,725 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 654 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 2865 mSolverCounterSat, 477 mSolverCounterUnsat, 59 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 332.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 3401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 2865 IncrementalHoareTripleChecker+Invalid, 59 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 335.6s IncrementalHoareTripleChecker+Time [2023-12-25 11:50:43,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1132 Invalid, 3401 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [477 Valid, 2865 Invalid, 59 Unknown, 0 Unchecked, 335.6s Time] [2023-12-25 11:50:43,725 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 11:50:43,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2023-12-25 11:50:43,942 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 (19)] Ended with exit code 0 [2023-12-25 11:50:44,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /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 [2023-12-25 11:50:44,126 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (1538states) and FLOYD_HOARE automaton (currently 44 states, 63 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 110 known predicates. [2023-12-25 11:50:44,130 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:50:44,131 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 11:50:44,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 11:50:44 BoogieIcfgContainer [2023-12-25 11:50:44,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 11:50:44,133 INFO L158 Benchmark]: Toolchain (without parser) took 864801.67ms. Allocated memory was 223.3MB in the beginning and 343.9MB in the end (delta: 120.6MB). Free memory was 157.8MB in the beginning and 267.7MB in the end (delta: -109.9MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2023-12-25 11:50:44,133 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 223.3MB. Free memory was 172.9MB in the beginning and 172.8MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 11:50:44,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.19ms. Allocated memory was 223.3MB in the beginning and 286.3MB in the end (delta: 62.9MB). Free memory was 157.5MB in the beginning and 236.2MB in the end (delta: -78.7MB). Peak memory consumption was 19.0MB. Max. memory is 8.0GB. [2023-12-25 11:50:44,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.75ms. Allocated memory is still 286.3MB. Free memory was 236.2MB in the beginning and 232.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-25 11:50:44,133 INFO L158 Benchmark]: Boogie Preprocessor took 92.79ms. Allocated memory is still 286.3MB. Free memory was 232.0MB in the beginning and 223.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-25 11:50:44,133 INFO L158 Benchmark]: RCFGBuilder took 6079.65ms. Allocated memory is still 286.3MB. Free memory was 223.1MB in the beginning and 214.4MB in the end (delta: 8.7MB). Peak memory consumption was 48.0MB. Max. memory is 8.0GB. [2023-12-25 11:50:44,133 INFO L158 Benchmark]: TraceAbstraction took 858123.35ms. Allocated memory was 286.3MB in the beginning and 343.9MB in the end (delta: 57.7MB). Free memory was 213.4MB in the beginning and 267.7MB in the end (delta: -54.4MB). Peak memory consumption was 3.3MB. Max. memory is 8.0GB. [2023-12-25 11:50:44,134 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 223.3MB. Free memory was 172.9MB in the beginning and 172.8MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 449.19ms. Allocated memory was 223.3MB in the beginning and 286.3MB in the end (delta: 62.9MB). Free memory was 157.5MB in the beginning and 236.2MB in the end (delta: -78.7MB). Peak memory consumption was 19.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.75ms. Allocated memory is still 286.3MB. Free memory was 236.2MB in the beginning and 232.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 92.79ms. Allocated memory is still 286.3MB. Free memory was 232.0MB in the beginning and 223.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 6079.65ms. Allocated memory is still 286.3MB. Free memory was 223.1MB in the beginning and 214.4MB in the end (delta: 8.7MB). Peak memory consumption was 48.0MB. Max. memory is 8.0GB. * TraceAbstraction took 858123.35ms. Allocated memory was 286.3MB in the beginning and 343.9MB in the end (delta: 57.7MB). Free memory was 213.4MB in the beginning and 267.7MB in the end (delta: -54.4MB). Peak memory consumption was 3.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 542). Cancelled while NwaCegarLoop was constructing difference of abstraction (1538states) and FLOYD_HOARE automaton (currently 44 states, 63 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 110 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 164 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 858.1s, OverallIterations: 18, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 725.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 111 mSolverCounterUnknown, 6901 SdHoareTripleChecker+Valid, 680.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6559 mSDsluCounter, 16357 SdHoareTripleChecker+Invalid, 672.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11958 mSDsCounter, 5027 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14440 IncrementalHoareTripleChecker+Invalid, 19578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5027 mSolverCounterUnsat, 4399 mSDtfsCounter, 14440 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4698 GetRequests, 4368 SyntacticMatches, 43 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5988 ImplicationChecksByTransitivity, 94.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1884occurred in iteration=15, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 640 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 11.8s SatisfiabilityAnalysisTime, 109.7s InterpolantComputationTime, 3102 NumberOfCodeBlocks, 3042 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4404 ConstructedInterpolants, 210 QuantifiedInterpolants, 29972 SizeOfPredicates, 99 NumberOfNonLiveVariables, 16040 ConjunctsInSsa, 273 ConjunctsInUnsatCore, 26 InterpolantComputations, 10 PerfectInterpolantSequences, 16404/17240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown